Author of the publication

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.

, , , , and . WG, volume 7551 of Lecture Notes in Computer Science, page 332-343. Springer, (2012)

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

Two Dots is NP-complete.. FUN, volume 49 of LIPIcs, page 24:1-24:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard., and . MFCS, volume 83 of LIPIcs, page 57:1-57:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Computational Hardness of Manipulating Pairwise Voting Rules., , , and . AAMAS, page 358-367. ACM, (2016)On structural parameterizations of firefighting., , , , , , and . Theor. Comput. Sci., (2019)Subexponential algorithm for d-cluster edge deletion: Exception or rule?, , and . J. Comput. Syst. Sci., (2020)On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules., , and . IJCAI, page 89-95. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles., , , , and . J. Graph Theory, 74 (4): 417-424 (2013)On Structural Parameterizations of Firefighting., , , and . CoRR, (2017)Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs., , , , and . WG, volume 8165 of Lecture Notes in Computer Science, page 370-381. Springer, (2013)Algorithmic Aspects of Dominator Colorings in Graphs., , , , and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 19-30. Springer, (2011)