Author of the publication

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.

, , , and . MFCS, volume 58 of LIPIcs, page 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Lossy Kernelization., , , and . CoRR, (2016)Editing to Connected f-Degree Graph., , , and . STACS, volume 47 of LIPIcs, page 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized Low-Rank Binary Matrix Approximation., , and . ICALP, volume 107 of LIPIcs, page 53:1-53:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the parameterized complexity of b-chromatic number., , and . J. Comput. Syst. Sci., (2017)Fréchet Distance Between a Line and Avatar Point Set., , , and . Algorithmica, 80 (9): 2616-2636 (2018)A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments., , , , , and . CoRR, (2018)Lossy Kernels for Connected Dominating Set on Sparse Graphs., , , , and . SIAM J. Discret. Math., 33 (3): 1743-1771 (2019)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , and . Algorithmica, 83 (2): 753-774 (2021)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , and . Algorithmica, 84 (9): 2622-2641 (2022)On the Parameterized Complexity of Edge-Linked Paths., , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 286-298. Springer, (2019)