LSE creators

Number of items: 7.
None
  • Garg, Jugal, Husić, Edin, Li, Wenzheng, Végh, László A., Vondrák, Jan (2023). Approximating Nash social welfare by matching and local search. In Saha, Barna, Servedio, Rocco A. (Eds.), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1298-1310). Association for Computing Machinery. https://doi.org/10.1145/3564246.3585255
  • Husić, Edin, Koh, Zhuan Khye, Loho, Georg, Végh, László A. (2023). On the correlation gap of matroids. In Del Pia, Alberto, Kaibel, Volker (Eds.), Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings (pp. 203-216). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-32726-1_15
    • Public
  • Koh, Zhuan Khye, Husic, Edin, Loho, Georg, Végh, László A. (2025). On the correlation gap of matroids. Mathematical Programming, 210(1-2), 407 - 456. https://doi.org/10.1007/s10107-024-02116-w picture_as_pdf
  • Caceres, Manuel, Mumey, Brendan, Husic, Edin, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer, Tomescu, Alexandru I.Ioan (2022). Safety in multi-assembly via paths appearing in all path covers of a DAG. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 19(6), 3673 - 3684. https://doi.org/10.1109/TCBB.2021.3131203 picture_as_pdf
  • Behera, Balaram, Husić, Edin, Jain, Shweta, Roughgarden, Tim, Seshadhri, C. (2022). FPT algorithms for finding near-cliques in c-closed graphs. In Braverman, Mark (Ed.), 13th Innovations in Theoretical Computer Science Conference, ITCS 2022 (pp. 17:1 - 17:24). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2022.17 picture_as_pdf
  • Husić, Edin (2021). Nash welfare, valuated matroids, and gross substitutes [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.00004335
  • Garg, Jugal, Husić, Edin, Végh, László A. (2021). Auction algorithms for market equilibrium with weak gross substitute demands and their applications. In Blaser, Markus, Monmege, Benjamin (Eds.), 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2021.33 picture_as_pdf