Author of the publication

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs.

, , , , and . SoCG, volume 293 of LIPIcs, page 72:1-72:11. 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

On the Parameterized Complexity of Edge-Linked Paths., , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 286-298. Springer, (2019)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , and . ISAAC, volume 64 of LIPIcs, page 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized Computational Geometry via Decomposition Theorems., , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 15-27. Springer, (2019)On MAX-SAT with Cardinality Constraint., and . WALCOM, volume 14549 of Lecture Notes in Computer Science, page 118-133. Springer, (2024)Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)., , , , and . SODA, page 2005-2031. SIAM, (2022)2-Approximating Feedback Vertex Set in Tournaments., , , , , and . SODA, page 1010-1018. SIAM, (2020)Boolean and $F_p$-Matrix Factorization: From Theory to Practice., , , and . IJCNN, page 1-8. IEEE, (2022)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 25-36. Springer, (2017)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)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)