Author of the publication

Parameterized Algorithms for Parity Games.

, , , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 336-347. Springer, (2015)

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

Ordered Coloring Grids and Related Graphs., , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 30-43. Springer, (2009)Parameterized Algorithms for Modular-Width., , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 163-176. Springer, (2013)Parameterized Power Vertex Cover., , , and . WG, volume 9941 of Lecture Notes in Computer Science, page 97-108. (2016)New Results on Directed Edge Dominating Set., , , , and . MFCS, volume 117 of LIPIcs, page 67:1-67:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Finer Tight Bounds for Coloring on Clique-Width.. ICALP, volume 107 of LIPIcs, page 86:1-86:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Token Sliding on Split Graphs., , , , , and . Theory Comput. Syst., 65 (4): 662-686 (2021)Maximum Independent Sets in Subcubic Graphs: New Results., , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 40-52. Springer, (2019)Parameterized Complexity of Safe Set., , , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 38-49. Springer, (2019)Faster Winner Determination Algorithms for (Colored) Arc Kayles., , , , and . SOFSEM, volume 14519 of Lecture Notes in Computer Science, page 297-310. Springer, (2024)Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse., , and . STACS, volume 47 of LIPIcs, page 37:1-37:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)