( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs.

, , , , и . SoCG, том 293 из LIPIcs, стр. 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.

Saurabh Sanatani

Saurabh Srivastava

Saket Sathe

Saurabh Bhavsar

Saket Navlakha

 

Другие публикации лиц с тем же именем

Exact Algorithms for Terrain Guarding., , , , и . SoCG, том 77 из LIPIcs, стр. 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , и . ISAAC, том 64 из LIPIcs, стр. 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Kernels for Deletion to Classes of Acyclic Digraphs., , , и . ISAAC, том 64 из LIPIcs, стр. 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized Computational Geometry via Decomposition Theorems., , и . WALCOM, том 11355 из Lecture Notes in Computer Science, стр. 15-27. Springer, (2019)Algorithmic Lower Bounds for Problems Parameterized with Clique-Width., , , и . SODA, стр. 493-502. SIAM, (2010)FPT-approximation for FPT Problems., , , , и . SODA, стр. 199-218. SIAM, (2021)Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version)., , и . SODA, стр. 179-198. SIAM, (2021)Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)., , , , и . SODA, стр. 2005-2031. SIAM, (2022)Parameterized Algorithms for Directed Maximum Leaf Problems., , , , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 352-362. Springer, (2007)Even Faster Algorithm for Set Splitting!, и . IWPEC, том 5917 из Lecture Notes in Computer Science, стр. 288-299. Springer, (2009)