( en | de | ru )

 

Disambiguation of "Saurabh, Saket"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.

, , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 25-36. Springer, (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

Saurabh Srivastava

Saket Sathe

Saurabh Bhavsar

Saket Navlakha

 

Other publications of authors with the same name

Parameterized Algorithms for Boxicity., , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 366-377. Springer, (2010)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)On the Parameterized Complexity of Edge-Linked Paths., , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 286-298. Springer, (2019)Representative Families of Product Families., , , and . ACM Trans. Algorithms, 13 (3): 36:1-36:29 (2017)Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms., , , and . J. ACM, 63 (4): 29:1-29:60 (2016)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)FPT algorithms for Connected Feedback Vertex Set., , , , and . J. Comb. Optim., 24 (2): 131-146 (2012)On the parameterized complexity of b-chromatic number., , and . J. Comput. Syst. Sci., (2017)