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

A 2ℓk Kernel for ℓ-Component Order Connectivity., and . CoRR, (2016)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)Algorithmic Lower Bounds for Problems on Decomposable Graphs.. MFCS, volume 6281 of Lecture Notes in Computer Science, page 37. Springer, (2010)On the Complexity of Computing Treelength.. MFCS, volume 4708 of Lecture Notes in Computer Science, page 276-287. Springer, (2007)Even Faster Algorithm for Set Splitting!, and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 288-299. Springer, (2009)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)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)Shortest Cycles with Monotone Submodular Costs., , , , and . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (January 2024)Lower Bounds for Approximation Schemes for Closest String., , , , and . SWAT, volume 53 of LIPIcs, page 12:1-12:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Balanced Judicious Bipartition is Fixed-Parameter Tractable., , , and . FSTTCS, volume 93 of LIPIcs, page 40:40-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)