Author of the publication

Kernelization of Cycle Packing with Relaxed Disjointness Constraints.

, , , , and . SIAM J. Discret. Math., 32 (3): 1619-1643 (2018)

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

Valued Authorization Policy Existence Problem: Theory and Experiments., , , , and . CoRR, (2021)Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover., , , and . CoRR, (2024)FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters., and . FAW, volume 10336 of Lecture Notes in Computer Science, page 209-220. Springer, (2017)Parameterized Complexity of Deletion to Scattered Graph Classes., , and . IPEC, volume 180 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Exact and Parameterized Algorithms for (k, i)-Coloring., , , and . CALDAM, volume 10156 of Lecture Notes in Computer Science, page 281-293. Springer, (2017)Kernelization of Cycle Packing with Relaxed Disjointness Constraints., , , , and . ICALP, volume 55 of LIPIcs, page 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized Pre-coloring Extension and List Coloring Problems., , , and . CoRR, (2019)Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems., , and . CoRR, (2023)Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels., , and . CoRR, (2017)p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms., , , , and . CoRR, (2020)