Edin Husic

According to our database1, Edin Husic authored at least 8 papers between 2017 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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...