( en | de | ru )

 

Disambiguation of "Saurabh, Saket"

Author of the publication

copydeleteadd this publication to your clipboard
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.

, , , , and . SODA, page 699-711. SIAM, (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 Parameterized Complexity of Edge-Linked Paths., , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 286-298. Springer, (2019)Reducing Rank of the Adjacency Matrix by Graph Modification., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 361-373. Springer, (2015)Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs., , , , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 349-360. Springer, (2015)Even Faster Algorithm for Set Splitting!, and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 288-299. Springer, (2009)Parameterized Algorithms for Directed Maximum Leaf Problems., , , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 352-362. Springer, (2007)Parameterized Algorithms for Boxicity., , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 366-377. Springer, (2010)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)Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments., , and . Algorithmica, 76 (2): 320-343 (2016)Parameterized Complexity of Superstring Problems., , , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 89-99. Springer, (2015)Fixed-Parameter Tractability of Satisfying beyond the Number of Variables., , , , , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 355-368. Springer, (2012)