Get started
Author

Edin Husić

Approximating Nash social welfare under rado valuations
2021 · Jugal Garg, Edin Husić, et al. · ACM SIGecom Exchanges · 33
PDF
Tractable Fragments of the Maximum Nash Welfare Problem
2021 · Garg, Jugal, Husić, Edin, et al. · arXiv (Cornell University) · 15
PDF
MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP
2018 · Edin Husić, Xinyue Li, et al. · Bioinformatics · 14
PDF
Approximating Nash Social Welfare by Matching and Local Search
2023 · Jugal Garg, Edin Husić, et al. · ACM Symposium on Theory of Computing (STOC) · 13
PDF
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands
2019 · Garg, Jugal, Husić, Edin, et al. · arXiv (Cornell University) · 11
PDF
Approximating Nash Social Welfare by Matching and Local Search
2026 · Jugal Garg, Edin Husić, et al. · Journal of the ACM · 10
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem
2018 · Ademir Hujdurović, Edin Husić, et al. · ACM Transactions on Algorithms · 8
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG
2021 · Manuel Cáceres, Brendan Mumey, et al. · IEEE Transactions on Computational Biology and Bioinformatics · 6
PDF
FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs.
2020 · Edin Husić, Tim Roughgarden · arXiv (Cornell University) · 6
An Auction Algorithm for Market Equilibrium with Weak Gross Substitute Demands
2023 · Jugal Garg, Edin Husić, et al. · ACM Transactions on Economics and Computation · 5
PDF
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and their Applications
2019 · Jugal Garg, Edin Husić, et al. · London School of Economics and Political Science Research Online (London School of Economics and Political Science) · 4
On the correlation gap of matroids
2024 · Edin Husić, Zhuan Khye Koh, et al. · Mathematical Programming · 3
PDF
On the Approximability of Unsplittable Flow on a Path with Time Windows
2025 · Alexander Armbruster, Fabrizio Grandoni, et al. · Mathematical Programming · 2
PDF
On complete classes of valuated matroids
2024 · Edin Husić, Georg Loho, et al. · TheoretiCS · 2
The Minimum Conflict-Free Row Split Problem Revisited
2017 · Ademir Hujdurović, Edin Husić, et al. · Lecture notes in computer science · 2
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
2024 · Grandoni, Fabrizio, Husić, Edin, et al. · arXiv (Cornell University) · 1
PDF
On the Correlation Gap of Matroids
2023 · Edin Husić, Zhuan Khye Koh, et al. · Lecture notes in computer science · 1
On complete classes of valuated matroids
2022 · Edin Husić, Georg Loho, et al. · Society for Industrial and Applied Mathematics eBooks · 1
PDF
The Independent Set Problem Is FPT for Even-Hole-Free Graphs
2019 · Husić, Edin, Thomassé, Stéphan, et al. · arXiv (Cornell University) · 1
PDF
A Polynomial-Time Algorithm for the Independent Set Problem in $$\{{P_{10}},C_4,C_6\}$$ -Free Graphs
2019 · Edin Husić, Martin Milanič · Lecture notes in computer science
The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues.
2017 · Ademir Hujdurović, Edin Husić, et al. · arXiv (Cornell University)
Submodularne funkcije : zaključna naloga
2015 · Edin Husić
Works count: 27
Citation count: 139
H-index: 7
I10-index: 6
Year
Topic
Type