Edin Husić

ScholarGPS® ID: 15129143958911

Affiliation

London School of Economics and Political Science, London, United Kingdom

Affiliation History

Field

Physical Sciences and Mathematics

Discipline

Mathematics

Top Specialties

Phylogenetics

Metrics Summary

Publication Count

Predicted Citations

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
An Auction Algorithm for Market Equilibrium with Weak Gross Substitute Demands (journal article) Garg, Jugal \| Husić, Edin \| Végh, László A. ACM Transactions on Economics and Computation, volume 11, issue 3-4, pages 1-24 (2023). 10.1145/3624558 Cite \| Source
Approximating Nash Social Welfare by Matching and Local Search (conference) Garg, Jugal \| Husić, Edin \| Li, Wenzheng \| Végh, László A. \| Vondrák, Jan STOC '23: 55th Annual ACM Symposium on Theory of Computing (2023) Orlando FL USA 10.1145/3564246.3585255 Cited by (1) \| Cite \| Source
On the Correlation Gap of Matroids (book chapter) In Integer Programming and Combinatorial Optimization Husić, Edin \| Koh, Zhuan Khye \| Loho, Georg \| Végh, László A. Springer International Publishing (2023) 10.1007/978-3-031-32726-1_15 Cite \| Source
On complete classes of valuated matroids (book chapter) In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) Husić, Edin \| Loho, Georg \| Smith, Ben \| Végh, László A. Society for Industrial and Applied Mathematics (2022) 10.1137/1.9781611977073.41 Cite \| Source
Approximating Nash social welfare under rado valuations (conference) Garg, Jugal \| Husić, Edin \| Végh, László A. STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) Virtual Italy 10.1145/3406325.3451031 Cited by (11) \| Cite \| Source
Approximating nash social welfare under rado valuations (journal article) Garg, Jugal \| Husić, Edin \| Végh, László A. ACM SIGecom Exchanges, volume 19, issue 1, pages 45-51 (2021). 10.1145/3476436.3476444 Cited by (1) \| Cite \| Source
Safety in multi-assembly via paths appearing in all path covers of a DAG (journal article) Caceres, Manuel \| Mumey, Brendan \| Husic, Edin \| Rizzi, Romeo \| Cairo, Massimo \| Sahlin, Kristoffer \| Tomescu, Alexandru I. Ioan IEEE/ACM Transactions on Computational Biology and Bioinformatics (2021). 10.1109/TCBB.2021.3131203 Cited by (2) \| Cite \| Source
MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP (journal article) Husić, Edin \| Li, Xinyue \| Hujdurović, Ademir \| Mehine, Miika \| Rizzi, Romeo \| Mäkinen, Veli \| Milanič, Martin \| Tomescu, Alexandru I Bioinformatics, volume 35, issue 5, pages 769-777 (2019). 10.1093/bioinformatics/bty683 Cited by (7) \| Cite \| Source \| Open Access
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem (journal article) Hujdurović, Ademir \| Husić, Edin \| Milanić, Martin \| Rizzi, Romeo \| Tomescu, Alexandru I. ACM Transactions on Algorithms, volume 14, issue 2, pages 1-26 (2018). 10.1145/3182178 Cited by (4) \| Cite \| Source \| Open Access
The Minimum Conflict-Free Row Split Problem Revisited (book chapter) In Graph-Theoretic Concepts in Computer Science Hujdurović, Ademir \| Husić, Edin \| Milanič, Martin \| Rizzi, Romeo \| Tomescu, Alexandru I. Springer International Publishing (2017) 10.1007/978-3-319-68705-6_23 Cite \| Source