Author of the publication

Kernelization of Counting Problems.

, , , and . ITCS, volume 287 of LIPIcs, page 77:1-77:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems., , , , and . APPROX-RANDOM, volume 116 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 25-36. Springer, (2017)Reducing Rank of the Adjacency Matrix by Graph Modification., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 361-373. Springer, (2015)FPT-approximation for FPT Problems., , , , and . SODA, page 199-218. SIAM, (2021)2-Approximating Feedback Vertex Set in Tournaments., , , , , and . SODA, page 1010-1018. SIAM, (2020)On the Complexity of Recovering Incidence Matrices., , , and . ESA, volume 173 of LIPIcs, page 50:1-50:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Parameterized Algorithms for Survivable Network Design with Uniform Demands., , , , , , and . SODA, page 2838-2850. SIAM, (2018)An Erdős-Pósa Theorem on Neighborhoods and Domination Number., , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 437-444. Springer, (2019)Finding Even Subgraphs Even Faster., , , , and . CoRR, (2014)Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number., , , and . FSTTCS, volume 122 of LIPIcs, page 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)