| Approximating Nash social welfare under Rado valuations J Garg, E Husić, LA Végh Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 36 | 2021 |
| Approximating nash social welfare by matching and local search J Garg, E Husić, W Li, LA Végh, J Vondrák Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1298-1310, 2023 | 21 | 2023 |
| An auction algorithm for market equilibrium with weak gross substitute demands J Garg, E Husić, LA Végh ACM Transactions on Economics and Computation 11 (3-4), 1-24, 2023 | 20* | 2023 |
| FPT Algorithms for Finding Near-Cliques in -Closed Graphs B Behera, E Husić, S Jain, T Roughgarden, C Seshadhri arXiv preprint arXiv:2007.09768, 2020 | 17* | 2020 |
| Safety in multi-assembly via paths appearing in all path covers of a DAG M Cáceres, B Mumey, E Husić, R Rizzi, M Cairo, K Sahlin, AI Tomescu IEEE/ACM Transactions on Computational Biology and Bioinformatics 19 (6 …, 2021 | 16 | 2021 |
| MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP E Husić, X Li, A Hujdurović, M Mehine, R Rizzi, V Mäkinen, M Milanič, ... Bioinformatics 35 (5), 769-777, 2019 | 15 | 2019 |
| Tractable fragments of the maximum Nash welfare problem J Garg, E Husić, A Murhekar, L Végh arXiv preprint arXiv:2112.10199, 2021 | 14 | 2021 |
| Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth’s theorem A Hujdurović, E Husić, M Milanić, R Rizzi, AI Tomescu ACM Transactions on Algorithms (TALG) 14 (2), 1-26, 2018 | 9* | 2018 |
| On complete classes of valuated matroids E Husić, G Loho, B Smith, LA Végh Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 7 | 2022 |
| On the correlation gap of matroids E Husić, ZK Koh, G Loho, LA Végh Mathematical Programming, 1-50, 2024 | 3 | 2024 |
| The independent set problem is FPT for even-hole-free graphs E Husic, S Thomassé, N Trotignon 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019 | 3 | 2019 |
| A Polynomial-Time Algorithm for the Independent Set Problem in-Free Graphs E Husić, M Milanič International Workshop on Graph-Theoretic Concepts in Computer Science, 271-284, 2019 | 1 | 2019 |
| Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions F Grandoni, E Husić, M Mari, A Tinguely arXiv preprint arXiv:2402.07666, 2024 | | 2024 |
| Economics and Computation P Goldberg, U Ünver, J Garg, E Husić, LA Végh, N Immorlica, S Singla, ... ACM Transactions on 11 (3-4), 2023 | | 2023 |
| Safety in multi-assembly via paths appearing in all path covers of a DAG MA Caceres Reyes, B Mumey, E Husic, R Rizzi, M Cairo, K Sahlin, ... | | 2022 |
| 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) P Bürgisser, P Ossona de Mendez, L Tendera, D Aggarwal, Y Chen, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2021 | | 2021 |
| Nash welfare, valuated matroids, and gross substitutes E Husić London School of Economics and Political Science, 2021 | | 2021 |
László A. VéghDepartment of Mathematics, London School of Economics and Political ScienceVerified email at lse.ac.uk
