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

Complexity of planar signed graph homomorphisms to cycles., , , , and . Discret. Appl. Math., (2020)The Ferry Cover Problem., and . Theory Comput. Syst., 44 (2): 215-229 (2009)Ordered Coloring Grids and Related Graphs., , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 30-43. Springer, (2009)Hanabi is NP-complete, Even for Cheaters who Look at Their Cards., , , , , , , and . FUN, volume 49 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Token Sliding on Split Graphs., , , , , and . Theory Comput. Syst., 65 (4): 662-686 (2021)On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 220-231. Springer, (2008)The Computational Complexity of the Game of Set and Its Theoretical Applications., and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 24-34. Springer, (2014)Parameterized Algorithms for Parity Games., , , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 336-347. Springer, (2015)Grundy Distinguishes Treewidth from Pathwidth., , , , and . ESA, volume 173 of LIPIcs, page 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth., and . ICALP, volume 55 of LIPIcs, page 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)