Close
LSE_Library_3252_1400x255_sRGBe

Publications

Below is the list of the Department's recent research publications. This information is generated by an RSS feed from LSE Research Online, and shows the most recent 20 publications (either published, or accepted for publication).

  • (1 + )-Approximate shortest paths in dynamic streams
    Elkin, Michael and Trehan, Chhaya (2022) (1 + )-Approximate shortest paths in dynamic streams. In: Chakrabarti, Amit and Swamy, Chaitanya, (eds.) Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Germany, 51:1–51:23. (In Press)
  • Raiffa-Kalai-Smorodinsky bargaining solution for bilateral contracts in electricity markets
    Garcia, Reinaldo Crispiniano, Contreras, Javier, de Lima Barbosa, Matheus, Toledo, Felipe Silva and da Cunha, Paulo Vinicius Aires (2020) Raiffa-Kalai-Smorodinsky bargaining solution for bilateral contracts in electricity markets. Energies, 13 (9). ISSN 1996-1073
  • Brief announcement: (1+)-approximate shortest paths in dynamic streams
    Elkin, Michael and Trehan, Chhaya (2022) Brief announcement: (1+)-approximate shortest paths in dynamic streams. In: PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, pp. 57-59. ISBN 9781450392624
  • Almost-monochromatic sets and the chromatic number of the plane
    Frankl, Nóra, Hubai, Tamás and Pálvölgyi, Dömötör (2020) Almost-monochromatic sets and the chromatic number of the plane. In: Cabello, Sergio and Chen, Danny Z., (eds.) 36th International Symposium on Computational Geometry, SoCG 2020. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959771436
  • Almost sharp bounds on the number of discrete chains in the plane
    Frankl, Nóra and Kupavskii, Andrey (2020) Almost sharp bounds on the number of discrete chains in the plane. In: Cabello, Sergio and Chen, Danny Z., (eds.) 36th International Symposium on Computational Geometry, SoCG 2020. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959771436
  • The competition complexity of dynamic pricing
    Brustle, Johannes, Correa, José, Dütting, Paul and Verdugo, Victor (2022) The competition complexity of dynamic pricing. In: EC 2022: Proceedings of the 23rd ACM Conference on Economics and Computation. EC 2022 - Proceedings of the 23rd ACM Conference on Economics and Computation. Association for Computing Machinery, Inc, 303 - 320. ISBN 9781450391504
  • On the extension complexity of scheduling polytopes
    Tiwary, Hans Raj, Verdugo, Victor and Wiese, Andreas (2020) On the extension complexity of scheduling polytopes. Operations Research Letters, 48 (4). pp. 472-479. ISSN 0167-6377
  • On dyadic fractional packings of T-joins
    Abdi, Ahmad ORCID: 0000-0002-3008-4167 , Cornuéjols, Gérard P. and Palion, Zuzanna (2022) On dyadic fractional packings of T-joins. SIAM Journal on Discrete Mathematics. ISSN 0895-4801 (In Press)
  • On circuit diameter bounds via circuit imbalances
    Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A A. ORCID: 0000-0003-1152-200X (2022) On circuit diameter bounds via circuit imbalances. In: Aardal, Karen and Sanità, Laura, (eds.) Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, 140 - 153. ISBN 9783031069000
  • Total dual dyadicness and dyadic generating sets
    Abdi, Ahmad ORCID: 0000-0002-3008-4167 , Cornuéjols, Gérard, Guenin, Bertrand and Tunçel, Levent (2022) Total dual dyadicness and dyadic generating sets. In: Aardal, Karen and Sanità, Laura, (eds.) Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, pp. 1-14. ISBN 9783031069000
  • Asymmetric Ramsey properties of random graphs involving cliques and cycles
    Liebenau, Anita, Mattos, Letícia, Mendonça, Walner and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2022) Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures & Algorithms. ISSN 1042-9832
  • Speed-robust scheduling: sand, bricks, and rocks
    Eberle, Franziska, Hoeksma, Ruben, Megow, Nicole, Nölke, Lukas, Schewior, Kevin and Simon, Bertrand (2022) Speed-robust scheduling: sand, bricks, and rocks. Mathematical Programming. ISSN 0025-5610
  • A faster interior-point method for sum-of-squares optimization
    Jiang, Shunhua, Natura, Bento and Weinstein, Omri (2022) A faster interior-point method for sum-of-squares optimization. In: Bojanczyk, Mikolaj, Merelli, Emanuela and Woodruff, David P., (eds.) 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772358
  • Breaking symmetries to rescue sum of squares in the case of makespan scheduling
    Verdugo, Victor, Verschae, José and Wiese, Andreas (2020) Breaking symmetries to rescue sum of squares in the case of makespan scheduling. Mathematical Programming, 183 (1-2). 583 - 618. ISSN 0025-5610
  • A note on spurious model selection
    Wang, Weiguan and Ruf, Johannes (2022) A note on spurious model selection. Quantitative Finance, 22 (10). 1797 - 1800. ISSN 1469-7688
  • Prophet inequalities for independent and identically distributed random variables from an unknown distribution
    Correa, José, Dütting, Paul, Fischer, Felix and Schewior, Kevin (2022) Prophet inequalities for independent and identically distributed random variables from an unknown distribution. Mathematics of Operations Research, 47 (2). 847 - 1705. ISSN 0364-765X
  • The multicolour size-Ramsey number of powers of paths
    Han, Jie, Jenssen, Matthew, Kohayakawa, Yoshiharu, Mota, Guilherme Oliveira and Roberts, Barnaby (2020) The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory. Series B, 145. 359 - 375. ISSN 0095-8956
  • Triangles in randomly perturbed graphs
    Böttcher, Julia ORCID: 0000-0002-4104-3635 , Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2022) Triangles in randomly perturbed graphs. Combinatorics, Probability and Computing. ISSN 0963-5483
  • Continuous patrolling games
    Alpern, Steve, Bui, Thuy, Lidbetter, Thomas and Papadaki, Katerina (2022) Continuous patrolling games. Operations Research. ISSN 0030-364X
  • Price manipulability in first-price auctions
    Brustle, Johannes, Dütting, Paul and Sivan, Balasubramanian (2022) Price manipulability in first-price auctions. In: WWW 2022: Proceedings of the ACM Web Conference 2022. International World Wide Web Conference. Association for Computing Machinery, Inc, New York, NY, 58 - 67. ISBN 9781450390965

Print or share

CDAM logo 747x420

CDAM Research Report Series from 1991 - 2009