Personal information

Other IDs

Scopus Author ID: 57197716172

Activities

Collapse all

Works (16)

On the correlation gap of matroids

Mathematical Programming
2025-03 | Journal article
DOI: 10.1007/s10107-024-02116-w
Contributors: Edin Husić; Zhuan Khye Koh; Georg Loho; László A. Végh
Source: check_circle
Crossref

On complete classes of valuated matroids

TheoretiCS
2024-11-18 | Journal article
DOI: 10.46298/theoretics.24.24
Contributors: Edin Husić; Georg Loho; Ben Smith; László A. Végh
Source: check_circle
Crossref

On the Correlation Gap of Matroids

2023 | Book chapter
DOI: 10.1007/978-3-031-32726-1_15
Contributors: Edin Husić; Zhuan Khye Koh; Georg Loho; László A. Végh
Source: check_circle
Crossref

An Auction Algorithm for Market Equilibrium with Weak Gross Substitute Demands

ACM Transactions on Economics and Computation
2023-09-14 | Journal article
DOI: 10.1145/3624558
Part of ISSN: 2167-8375
Part of ISSN: 2167-8383
Contributors: Jugal Garg; Edin Husić; László A. Végh
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 2)‎

Approximating Nash Social Welfare by Matching and Local Search

Proceedings of the 55th Annual ACM Symposium on Theory of Computing
2023-06-02 | Conference paper
DOI: 10.1145/3564246.3585255
Contributors: Jugal Garg; Edin Husić; Wenzheng Li; László A. Végh; Jan Vondrák
Source: Self-asserted source
Edin Husić

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

Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2022 | Journal article
DOI: 10.4230/LIPICS.ITCS.2022.17
Contributors: Balaram Behera; Edin Husić; Shweta Jain; Tim Roughgarden; C. Seshadhri
Source: Self-asserted source
Edin Husić

On complete classes of valuated matroids

Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
2022-01 | Book chapter
DOI: 10.1137/1.9781611977073.41
Contributors: Edin Husić; Georg Loho; Ben Smith; László A. Végh
Source: Self-asserted source
Edin Husić

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

Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2021 | Conference paper
DOI: 10.4230/LIPICS.STACS.2021.33
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 2)‎

Safety in multi-assembly via paths appearing in all path covers of a DAG

IEEE/ACM Transactions on Computational Biology and Bioinformatics
2021 | Journal article
DOI: 10.1109/tcbb.2021.3131203
Part of ISSN: 1545-5963
Part of ISSN: 1557-9964
Part of ISSN: 2374-0043
Contributors: Manuel Caceres; Brendan Mumey; Edin Husic; Romeo Rizzi; Massimo Cairo; Kristoffer Sahlin; Alexandru I. Ioan Tomescu
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 2)‎

Approximating nash social welfare under rado valuations

ACM SIGecom Exchanges
2021-06 | Journal article
DOI: 10.1145/3476436.3476444
Part of ISSN: 1551-9031
Contributors: Jugal Garg; Edin Husić; László A. Végh
Source: Self-asserted source
Edin Husić

Approximating Nash social welfare under rado valuations

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2021-06-15 | Conference paper
DOI: 10.1145/3406325.3451031
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 3)‎

A Polynomial-Time Algorithm for the Independent Set Problem in $$\{{P_{10}},C_4,C_6\}$$ -Free Graphs

Graph-Theoretic Concepts in Computer Science
2019 | Book chapter
DOI: 10.1007/978-3-030-30786-8_21
Part of ISBN: 9783030307851
Part of ISBN: 9783030307868
Part of ISSN: 0302-9743
Part of ISSN: 1611-3349
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 3)‎

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

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
2019 | Journal article
DOI: 10.4230/LIPICS.IPEC.2019.21
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 3)‎

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

Bioinformatics
2019-03-01 | Journal article
DOI: 10.1093/bioinformatics/bty683
Part of ISSN: 1367-4803
Part of ISSN: 1460-2059
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 3)‎

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

ACM Transactions on Algorithms
2018-06-04 | Journal article
DOI: 10.1145/3182178
Part of ISSN: 1549-6325
Part of ISSN: 1549-6333
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 3)‎

The Minimum Conflict-Free Row Split Problem Revisited

Graph-Theoretic Concepts in Computer Science
2017 | Book chapter
DOI: 10.1007/978-3-319-68705-6_23
Part of ISBN: 9783319687049
Part of ISBN: 9783319687056
Part of ISSN: 0302-9743
Part of ISSN: 1611-3349
Source: Self-asserted source
Edin Husić
grade
Preferred source (of 4)‎

Peer review (1 review for 1 publication/grant)

Review activity for SIAM journal on discrete mathematics. (1)
How many people are using ORCID?