( en | de | ru )

 

Disambiguation of "Saurabh, Saket"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Saurabh Sanatani

Saket Sathe

Saurabh Srivastava

Saurabh Bhavsar

Saket Navlakha

 

Other publications of authors with the same name

On the Complexity of Mixed Dominating Set., , , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 262-274. Springer, (2019)Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel., , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 517-528. Springer, (2015)Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?, , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 679-690. Springer, (2013)New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041)., , , and . Dagstuhl Reports, 9 (1): 67-87 (2019)A Linear Vertex Kernel for Maximum Internal Spanning Tree., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 275-282. Springer, (2009)Fully Dynamic Arboricity Maintenance., , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 1-12. Springer, (2019)Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem., , and . IWPEC, volume 5018 of Lecture Notes in Computer Science, page 13-29. Springer, (2008)Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs., , , , and . WG, volume 8165 of Lecture Notes in Computer Science, page 370-381. Springer, (2013)Incompressibility through Colors and IDs., , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 378-389. Springer, (2009)Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs., , and . Algorithmica, 76 (1): 279-296 (2016)