Edin Husic

According to our database, Edin Husic authored at least 17 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions.

Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Approximating Nash Social Welfare by Matching and Local Search.

Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

On the Correlation Gap of Matroids.

Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.

Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Tractable Fragments of the Maximum Nash Welfare Problem.

Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

On complete classes of valuated matroids.

Edin Husic, Georg Loho, Ben Smith, László A. Végh

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

FPT Algorithms for Finding Near-Cliques in c-Closed Graphs.

Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Approximating nash social welfare under rado valuations.

Jugal Garg, Edin Husic, László A. Végh

SIGecom Exch., 2021

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications.

Jugal Garg, Edin Husic, László A. Végh

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020

FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs.

Edin Husic, Tim Roughgarden

CoRR, 2020

2019

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands.

Jugal Garg, Edin Husic, László A. Végh

CoRR, 2019

MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP.

Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu

Bioinform., 2019

A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs.

Edin Husic, Martin Milanic

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

The Independent Set Problem Is FPT for Even-Hole-Free Graphs.

Edin Husic, Stéphan Thomassé, Nicolas Trotignon

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem.

Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu

ACM Trans. Algorithms, 2018

2017

The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues.

Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu

CoRR, 2017

The Minimum Conflict-Free Row Split Problem Revisited.

Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017