Author of the publication

Grundy Distinguishes Treewidth from Pathwidth.

, , , , and . ESA, volume 173 of LIPIcs, page 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

The Ferry Cover Problem., and . Theory Comput. Syst., 44 (2): 215-229 (2009)Complexity of planar signed graph homomorphisms to cycles., , , , and . Discret. Appl. Math., (2020)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)Parameterized Algorithms for Parity Games., , , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 336-347. Springer, (2015)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)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)Grundy Distinguishes Treewidth from Pathwidth., , , , and . ESA, volume 173 of LIPIcs, page 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Treewidth with a Quantifier Alternation Revisited., and . IPEC, volume 89 of LIPIcs, page 26:1-26:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)