Author of the publication

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel.

, , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 517-528. Springer, (2015)

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

Faster algorithms for feedback vertex set., , and . Electron. Notes Discret. Math., (2005)On the Complexity of Singly Connected Vertex Deletion., , , , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 237-250. Springer, (2020)Well-Structured Committees., , and . IJCAI, page 189-195. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..On the Parameterized Complexity of Edge-Linked Paths., , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 286-298. Springer, (2019)Multivariate Complexity Analysis of Geometric Red Blue Set Cover., , and . Algorithmica, 79 (3): 667-697 (2017)Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A characterization of König-Egerváry graphs with extendable vertex covers., , and . Inf. Process. Lett., (2020)On the Hardness of Losing Width., , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems., , , , and . SIAM J. Discret. Math., 37 (4): 2626-2669 (December 2023)