( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Hardness of Losing Width.

, , , , и . 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.

Saurabh Sanatani

Saket Sathe

Saurabh Srivastava

Saurabh Bhavsar

Saket Navlakha

 

Другие публикации лиц с тем же именем

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