Author of the publication

On Girth and the Parameterized Complexity of Token Sliding and Token Jumping.

, , , , and . Algorithmica, 83 (9): 2914-2951 (2021)

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

Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure., , and . SIAM J. Discret. Math., 35 (4): 2618-2646 (2021)On Girth and the Parameterized Complexity of Token Sliding and Token Jumping., , , , and . Algorithmica, 83 (9): 2914-2951 (2021)Graphs with at most two moplexes., , , , and . CoRR, (2021)Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs., , , , , , , and . ADT, volume 13023 of Lecture Notes in Computer Science, page 243-257. Springer, (2021)Functionality of box intersection graphs., , , , and . CoRR, (2023)Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure., , and . CoRR, (2022)Finding k-community structures in special graph classes., , , and . CoRR, (2022)Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction., , , , , , and . CoRR, (2024)Detecting K2, 3 as an induced minor., , , , , and . CoRR, (2024)Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs., and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 136-147. Springer, (2019)