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 . J. Comb. Optim., 24 (2): 131-146 (2012)On the parameterized complexity of b-chromatic number., , and . J. Comput. Syst. Sci., (2017)Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments., , and . Algorithmica, 76 (2): 320-343 (2016)Parameterized Complexity of Superstring Problems., , , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 89-99. Springer, (2015)On the Parameterized Complexity of Edge-Linked Paths., , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 286-298. Springer, (2019)Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors., , , and . ACM Trans. Algorithms, 14 (1): 6:1-6:31 (2018)Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes., , and . J. ACM, 65 (2): 10:1-10:44 (2018)Editing to Connected f-Degree Graph., , , and . STACS, volume 47 of LIPIcs, page 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Fixed-Parameter Tractability of Satisfying beyond the Number of Variables., , , , , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 355-368. Springer, (2012)Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)