Author of the publication

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

FPT Algorithms for Connected Feedback Vertex Set, , , , and . CoRR, (2009)Finding Even Subgraphs Even Faster., , , , and . CoRR, (2014)Hitting forbidden minors: Approximation and Kernelization, , , , and . CoRR, (2010)Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound., , , and . FSTTCS, volume 18 of LIPIcs, page 412-423. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)B-Chromatic Number: Beyond NP-Hardness., , and . IPEC, volume 43 of LIPIcs, page 389-401. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Hitting Forbidden Minors: Approximation and Kernelization., , , , and . SIAM J. Discret. Math., 30 (1): 383-410 (2016)On Parameterized Independent Feedback Vertex Set., , , and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 98-109. Springer, (2011)Dominating set is fixed parameter tractable in claw-free graphs., , , , and . Theor. Comput. Sci., 412 (50): 6982-7000 (2011)A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion., , , , and . ICALP, volume 168 of LIPIcs, page 80:1-80:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound, , , and . CoRR, (2012)