( en | de | ru )

 

Disambiguation of "Saurabh, Saket"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Complexity of Superstring Problems.

, , , , , and . Algorithmica, 79 (3): 798-813 (2017)

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)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)Reducing Rank of the Adjacency Matrix by Graph Modification., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 361-373. Springer, (2015)Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms., , , and . J. ACM, 63 (4): 29:1-29:60 (2016)Representative Families of Product Families., , , and . ACM Trans. Algorithms, 13 (3): 36:1-36:29 (2017)Parameterized Complexity of Superstring Problems., , , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 89-99. Springer, (2015)Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments., , and . Algorithmica, 76 (2): 320-343 (2016)Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes., , and . J. ACM, 65 (2): 10:1-10:44 (2018)Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors., , , and . ACM Trans. Algorithms, 14 (1): 6:1-6:31 (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)