( en | de | ru )

 

Disambiguation of "Saurabh, Saket"

Author of the publication

copydeleteadd this publication to your clipboard
On the Hardness of Losing Width.

, , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)

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

Faster algorithms for feedback vertex set., , and . Electron. Notes Discret. Math., (2005)On the Hardness of Losing Width., , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)A Polynomial Kernel for Bipartite Permutation Vertex Deletion., , , , , and . Algorithmica, 84 (11): 3246-3275 (2022)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , and . Algorithmica, 83 (2): 753-774 (2021)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)A Parameterized Algorithm for Mixed-Cut., , and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 672-685. Springer, (2016)Balanced Judicious Bipartition is Fixed-Parameter Tractable., , , and . FSTTCS, volume 93 of LIPIcs, page 40:40-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems., , , , and . APPROX-RANDOM, volume 116 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Lower Bounds for Approximation Schemes for Closest String., , , , and . SWAT, volume 53 of LIPIcs, page 12:1-12:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Group Activity Selection on Graphs: Parameterized Analysis., , , and . SAGT, volume 10504 of Lecture Notes in Computer Science, page 106-118. Springer, (2017)