Author of the publication

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.

, , and . FSTTCS, volume 13 of LIPIcs, page 164-175. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation., , and . FSTTCS, volume 13 of LIPIcs, page 164-175. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Vertex Exponential Algorithms for Connected f-Factors., and . FSTTCS, volume 29 of LIPIcs, page 61-71. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Disjoint Stable Matchings in Linear Time., , and . CoRR, (2020)α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms., , , and . CoRR, (2021)2-Approximating Feedback Vertex Set in Tournaments., , , , , and . SODA, page 1010-1018. SIAM, (2020)Subset Feedback Vertex Set in Chordal and Split Graphs., , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 365-376. Springer, (2019)FPT Algorithms for Connected Feedback Vertex Set, , , , and . CoRR, (2009)Finding Even Subgraphs Even Faster., , , , and . CoRR, (2014)On Parameterized Independent Feedback Vertex Set., , , and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 98-109. Springer, (2011)B-Chromatic Number: Beyond NP-Hardness., , and . IPEC, volume 43 of LIPIcs, page 389-401. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)