Author of the publication

On the Parameterized Complexity of Contraction to Generalization of Trees.

, , and . IPEC, volume 89 of LIPIcs, page 1:1-1:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)., , , , and . Dagstuhl Reports, 12 (11): 109-123 (November 2022)Parameterized Complexity of Minimum Membership Dominating Set., , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 288-299. Springer, (2022)Recognizing well-dominated graphs is coNP-complete., , , , and . CoRR, (2022)Interval Vertex Deletion Admits a Polynomial Kernel., , , and . SODA, page 1711-1730. SIAM, (2019)A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion., , and . LATIN (2), volume 14579 of Lecture Notes in Computer Science, page 208-222. Springer, (2024)Quadratic Vertex Kernel for Split Vertex Deletion., , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 1-12. Springer, (2019)On the Parameterized Complexity of Clique Elimination Distance., and . IPEC, volume 180 of LIPIcs, page 1:1-1:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On Finding Short Reconfiguration Sequences Between Independent Sets., , and . ISAAC, volume 248 of LIPIcs, page 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time., , , , and . SODA, page 5276-5290. SIAM, (2024)Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent., , , , , , and . SODA, page 1976-2004. SIAM, (2022)