Author of the publication

Subexponential Algorithms for Partial Cover Problems.

, , , and . FSTTCS, volume 4 of LIPIcs, page 193-201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)

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

Editing to Connected f-Degree Graph., , , and . STACS, volume 47 of LIPIcs, page 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Fixed-Parameter Tractability of Satisfying beyond the Number of Variables., , , , , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 355-368. Springer, (2012)Covering Vectors by Spaces: Regular Matroids., , , and . SIAM J. Discret. Math., 32 (4): 2512-2565 (2018)Packing Cycles Faster Than Erdos-Posa., , , and . SIAM J. Discret. Math., 33 (3): 1194-1215 (2019)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..A characterization of König-Egerváry graphs with extendable vertex covers., , and . Inf. Process. Lett., (2020)Faster fixed parameter tractable algorithms for finding feedback vertex sets., , and . ACM Trans. Algorithms, 2 (3): 403-415 (2006)Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems., , , , and . SIAM J. Discret. Math., 37 (4): 2626-2669 (December 2023)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)