Author of the publication

On the Complexity of Singly Connected Vertex Deletion.

, , , , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 237-250. 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

How to Find a Good Explanation for Clustering?, , , , , and . AAAI, page 3904-3912. AAAI Press, (2022)On the Parameterized Complexity of Minus Domination., , , , , and . SOFSEM, volume 14519 of Lecture Notes in Computer Science, page 96-110. Springer, (2024)FPT Approximation for Fair Minimum-Load Clustering., , , , and . IPEC, volume 249 of LIPIcs, page 4:1-4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Exact Exponential Algorithms for Clustering Problems., , , , and . IPEC, volume 249 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Metric Dimension Parameterized by Treewidth., and . IPEC, volume 148 of LIPIcs, page 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Metric Dimension Parameterized By Treewidth., and . Algorithmica, 83 (8): 2606-2633 (2021)On the Complexity of Singly Connected Vertex Deletion., , , , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 237-250. Springer, (2020)Efficient Algorithms for a Graph Partitioning Problem., , and . FAW, volume 10823 of Lecture Notes in Computer Science, page 29-42. Springer, (2018)Parameterized Complexity of Categorical Clustering with Size Constraints., , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 385-398. Springer, (2021)Lossy Kernelization of Same-Size Clustering., , , , and . CSR, volume 13296 of Lecture Notes in Computer Science, page 96-114. Springer, (2022)