default search action
Edin Husic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely:
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. SoCG 2024: 61:1-61:16 - [i9]Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely:
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. CoRR abs/2402.07666 (2024) - 2023
- [c10]Edin Husic
, Zhuan Khye Koh
On the Correlation Gap of Matroids. IPCO 2023: 203-216 - [c9]Jugal Garg, Edin Husic
Approximating Nash Social Welfare by Matching and Local Search. STOC 2023: 1298-1310 - 2022
- [j4]Manuel Cáceres
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3673-3684 (2022) - [c8]Balaram Behera, Edin Husic
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. ITCS 2022: 17:1-17:24 - [c7]Edin Husic
On complete classes of valuated matroids. SODA 2022: 945-962 - [c6]Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh:
Tractable Fragments of the Maximum Nash Welfare Problem. WINE 2022: 362-363 - [i8]Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh:
On the Correlation Gap of Matroids. CoRR abs/2209.09896 (2022) - [i7]Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák:
Approximating Nash Social Welfare by Matching and Local Search. CoRR abs/2211.03883 (2022) - 2021
- [j3]Jugal Garg, Edin Husic
Approximating nash social welfare under rado valuations. SIGecom Exch. 19(1): 45-51 (2021) - [c5]Jugal Garg, Edin Husic
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. STACS 2021: 33:1-33:19 - [c4]Jugal Garg, Edin Husic
Approximating Nash social welfare under rado valuations. STOC 2021: 1412-1425 - [i6]Edin Husic, Georg Loho, Ben Smith, László A. Végh:
On complete classes of valuated matroids. CoRR abs/2107.06961 (2021) - [i5]Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh:
Tractable Fragments of the Maximum Nash Welfare Problem. CoRR abs/2112.10199 (2021) - 2020
- [i4]Edin Husic, Tim Roughgarden:
FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs. CoRR abs/2007.09768 (2020) - [i3]Jugal Garg, Edin Husic, László A. Végh:
Approximating Nash Social Welfare under Rado Valuations. CoRR abs/2009.14793 (2020)
2010 – 2019
- 2019
- [j2]Edin Husic
MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. 35(5): 769-777 (2019) - [c3]Edin Husic
The Independent Set Problem Is FPT for Even-Hole-Free Graphs. IPEC 2019: 21:1-21:12 - [c2]Edin Husic
A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. WG 2019: 271-284 - [i2]Jugal Garg, Edin Husic, László A. Végh:
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands. CoRR abs/1908.07948 (2019) - 2018
- [j1]Ademir Hujdurovic
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. ACM Trans. Algorithms 14(2): 20:1-20:26 (2018) - 2017
- [c1]Ademir Hujdurovic
The Minimum Conflict-Free Row Split Problem Revisited. WG 2017: 303-315 - [i1]Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. CoRR abs/1701.05492 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-07 19:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: