Author of the publication

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.

, , , and . MFCS, volume 170 of LIPIcs, page 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Recognizing k-Clique Extendible Orderings., , and . WG, volume 12301 of Lecture Notes in Computer Science, page 274-285. Springer, (2020)Exact and Parameterized Algorithms for (k, i)-Coloring., , , and . CALDAM, volume 10156 of Lecture Notes in Computer Science, page 281-293. Springer, (2017)Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints., , and . ITCS, volume 287 of LIPIcs, page 84:1-84:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Tractability of Konig Edge Deletion Problems., , , and . CoRR, (2018)On the Parameterized Complexity of Deletion to ℋ-Free Strong Components., , , and . MFCS, volume 170 of LIPIcs, page 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)