Author of the publication

A Polynomial Kernel for Line Graph Deletion.

, and . ESA, volume 173 of LIPIcs, page 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

Exploiting Dense Structures in Parameterized Complexity., , , and . STACS, volume 187 of LIPIcs, page 50:1-50:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours., and . Comb. Probab. Comput., 26 (6): 886-910 (2017)Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number., , , , , and . Electron. J. Comb., 26 (3): 3 (2019)A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem.. SODA, page 169-178. SIAM, (2021)Powers of paths in tournaments., , , , , , , , , and . Comb. Probab. Comput., 30 (6): 894-898 (2021)The shortest disjoint paths problem.. CoRR, (2019)Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable., , , , and . SODA, page 699-711. SIAM, (2024)A Polynomial Kernel for Paw-Free Editing., , and . IPEC, volume 180 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Polynomial Kernel for Line Graph Deletion., and . ESA, volume 173 of LIPIcs, page 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)How to Find a Good Explanation for Clustering?, , , , , and . AAAI, page 3904-3912. AAAI Press, (2022)