( en | de | ru )

 

Disambiguation of "Saurabh, Saket"

Author of the publication

copydeleteadd this publication to your clipboard
Faster Exact Algorithms for Some Terminal Set Problems.

, , , , , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 150-162. Springer, (2013)

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

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)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)On the Complexity of Singly Connected Vertex Deletion., , , , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 237-250. Springer, (2020)Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Multivariate Complexity Analysis of Geometric Red Blue Set Cover., , and . Algorithmica, 79 (3): 667-697 (2017)Faster algorithms for feedback vertex set., , and . Electron. Notes Discret. Math., (2005)Well-Structured Committees., , and . IJCAI, page 189-195. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..A characterization of König-Egerváry graphs with extendable vertex covers., , and . Inf. Process. Lett., (2020)