Edin Husic

According to our database1, Edin Husic authored at least 13 papers between 2017 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
On complete classes of valuated matroids.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

FPT Algorithms for Finding Near-Cliques in c-Closed Graphs.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Approximating nash social welfare under rado valuations.
SIGecom Exch., 2021

Tractable Fragments of the Maximum Nash Welfare Problem.
CoRR, 2021

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

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

2019
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands.
CoRR, 2019

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

A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

The Independent Set Problem Is FPT for Even-Hole-Free Graphs.
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.
ACM Trans. Algorithms, 2018

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

The Minimum Conflict-Free Row Split Problem Revisited.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017


  Loading...