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

Hard problems that quickly become very easy., , and . Inf. Process. Lett., (2022)Partitioning H-free graphs of bounded diameter., , , , and . Theor. Comput. Sci., (2022)The Complexity of L(p, q)-Edge-Labelling., , , and . Algorithmica, 85 (11): 3406-3429 (November 2023)Partitioning H-Free Graphs of Bounded Diameter., , , , and . ISAAC, volume 212 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 398-411. Springer, (2022)Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs., , , , , and . MFCS, volume 272 of LIPIcs, page 57:1-57:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The complexity of L(p, q)-Edge-Labelling., , , and . CoRR, (2020)Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision., , , , and . CoRR, (2022)Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter., , and . Theor. Comput. Sci., (2022)Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter., , and . CoRR, (2021)