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

Reducing the Vertex Cover Number via Edge Contractions., , , , and . MFCS, volume 241 of LIPIcs, page 69:1-69:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Double Exponential Lower Bound for Telephone Broadcast.. CoRR, (2024)Lossy Kernels for Graph Contraction Problems., , , and . FSTTCS, volume 65 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized and Exact Algorithms for Class Domination Coloring., , , and . SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 336-349. Springer, (2017)The Complexity of Contracting Bipartite Graphs into Small Cycles., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 356-369. Springer, (2022)Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters., , , , and . MFCS, volume 241 of LIPIcs, page 51:1-51:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sparsification lower bound for linear spanners in directed graphs.. Theor. Comput. Sci., (2022)α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms., , , and . CoRR, (2021)Revisiting Path Contraction and Cycle Contraction., , and . CoRR, (2024)Subset Feedback Vertex Set in Chordal and Split Graphs., , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 365-376. Springer, (2019)