Author of the publication

Saving Critical Nodes with Firefighters is FPT.

, , , and . ICALP, volume 80 of LIPIcs, page 135:1-135:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

On the Approximate Compressibility of Connected Vertex Cover., , and . Algorithmica, 82 (10): 2902-2926 (2020)Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent., , , , , , and . SODA, page 1976-2004. SIAM, (2022)Distance from Triviality 2.0: Hybrid Parameterizations., and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 3-20. Springer, (2022)Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts., and . ACM Trans. Algorithms, 13 (4): 46:1-46:25 (2017)Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting., , and . CoRR, (2015)Partially Polynomial Kernels for Set Cover and Test Cover., , , and . SIAM J. Discret. Math., 30 (3): 1401-1423 (2016)Fine-grained complexity of integer programming: The case of bounded branch-width and rank., , , and . CoRR, (2016)Faster Exact Algorithms for Some Terminal Set Problems., , , , , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 150-162. Springer, (2013)Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS., , , , and . ICALP, volume 107 of LIPIcs, page 110:1-110:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS., , , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 523-537. Springer, (2019)