( en | de | ru )

 

Disambiguation of "Saurabh, Saket"

Author of the publication

copydeleteadd this publication to your clipboard
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal.

, , and . ACM Trans. Algorithms, 14 (2): 13:1-13:30 (2018)

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

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)Parameterized Low-distortion Embeddings - Graph metrics into lines and trees, , , , , and . CoRR, (2008)Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs, , , and . CoRR, (2012)Below all subsets for Minimal Connected Dominating Set., , and . CoRR, (2016)Bidimensionality and EPTAS, , , and . CoRR, (2010)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)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)Fixed-Parameter Tractability of Satisfying beyond the Number of Variables., , , , , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 355-368. Springer, (2012)