Author of the publication

Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths.

, , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 148-160. Springer, (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

Parameterized Aspects of Strong Subgraph Closure., , , , and . Algorithmica, 82 (7): 2006-2038 (2020)b-Coloring Parameterized by Clique-Width., , and . CoRR, (2020)Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs., , , , and . MFCS, volume 117 of LIPIcs, page 83:1-83:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs., and . CoRR, (2018)On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs., and . ISAAC, volume 248 of LIPIcs, page 43:1-43:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Treewidth Is NP-Complete on Cubic Graphs., , , , , , , , and . IPEC, volume 285 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)b-Coloring Parameterized by Clique-Width., , and . Theory Comput. Syst., 68 (4): 1049-1081 (August 2024)Reducing graph transversals via edge contractions., , , and . J. Comput. Syst. Sci., (2021)Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation., , , , , , and . CoRR, (2022)A tight quasi-polynomial bound for Global Label Min-Cut., , , , and . CoRR, (2022)