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).

  • Contacts in totally separable packings in the plane and in high dimensions
    Naszódi, Márton and Swanepoel, Konrad J. ORCID: 0000-0002-1668-887X (2022) Contacts in totally separable packings in the plane and in high dimensions. Journal of Computational Geometry, 13 (1). pp. 471-483. ISSN 1920-180X
  • When you come at the king you best not miss
    Lachish, Oded, Reidl, Felix and Trehan, Chhaya (2022) When you come at the king you best not miss. In: Proceedings of the FSTTCS: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. UNSPECIFIED. (In Press)
  • Testing idealness in the filter oracle model
    Abdi, Ahmad ORCID: 0000-0002-3008-4167 , Cornuéjols, Gérard, Guenin, Bertrand and Tunçel, Levent (2022) Testing idealness in the filter oracle model. Operations Research Letters. ISSN 0167-6377 (In Press)
  • On the Gleason-Kahane-Żelazko theorem for associative algebras
    Sasane, Amol and Roitman, Moshe (2022) On the Gleason-Kahane-Żelazko theorem for associative algebras. Results in Mathematics. ISSN 1422-6383 (In Press)
  • The number of small-degree vertices in matchstick graphs
    Lavollée, Jérémy and Swanepoel, Konrad ORCID: 0000-0002-1668-887X (2022) The number of small-degree vertices in matchstick graphs. Australasian Journal of Combinatorics. ISSN 2202-3518
  • Directed shortest paths via approximate cost balancing
    Orlin, James B. and Végh, László A. ORCID: 0000-0003-1152-200X (2022) Directed shortest paths via approximate cost balancing. Journal of the ACM. ISSN 0004-5411
  • Finding an optimal proximity bound in a very special scenario
    Williams, Aled (2022) Finding an optimal proximity bound in a very special scenario. WSEAS Transactions on Mathematics, 21. 600 - 603. ISSN 1109-2769
  • An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems
    Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2022) An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. Mathematics of Operations Research. ISSN 0364-765X (In Press)
  • Directed shortest paths via approximate cost balancing
    Orlin, James B. and Végh, László A. ORCID: 0000-0003-1152-200X (2022) Directed shortest paths via approximate cost balancing. In: Marx, Daniel, (ed.) ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, 235 - 254. ISBN 9781611976465
  • Regularity of the minmax value and equilibria in multiplayer Blackwell games
    Ashkenazi-Golan, Galit, Flesch, János, Predtetchinski, Arkadi and Solan, Eilon (2022) Regularity of the minmax value and equilibria in multiplayer Blackwell games. Israel Journal of Mathematics. ISSN 0021-2172 (In Press)
  • Automated equilibrium analysis of 2 × 2 × 2 games
    Jahani, Sahar and von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2022) Automated equilibrium analysis of 2 × 2 × 2 games. In: Kanellopoulos, Panagiotis, Kyropoulou, Maria and Voudouris, Alexandros, (eds.) Algorithmic Game Theory - 15th International Symposium, SAGT 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. 223-237. ISBN 9783031157134
  • The computational complexity of ReLU network training parameterized by data dimensionality
    Froese, Vincent, Hertrich, Christoph and Niedermeier, Rolf (2022) The computational complexity of ReLU network training parameterized by data dimensionality. Journal of Artificial Intelligence Research, 74. pp. 1775-1790. ISSN 1076-9757
  • Beyond value iteration for parity games: strategy iteration with universal trees
    Koh, Zhuan Khye and Loho, Georg (2022) Beyond value iteration for parity games: strategy iteration with universal trees. In: Szeider, Stefan, Ganian, Robert and Silva, Alexandra, (eds.) Leibniz International Proceedings in Informatics, LIPIcs. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772563
  • (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.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics, LIPIcs,51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Germany, 51:1 – 51:23. ISBN 9783959772495
  • 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