( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.

, , , , и . SODA, стр. 699-711. SIAM, (2024)

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

 

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

Parameterized Algorithms for Partial Cover Problems, , и . CoRR, (2008)Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs., , , , и . Algorithmica, 81 (1): 26-46 (2019)Distortion is Fixed Parameter Tractable., , , , , и . TOCT, 5 (4): 16:1-16:20 (2013)Fixed-parameter tractable algorithms for Tracking Shortest Paths., , , и . Theor. Comput. Sci., (2020)Partially Polynomial Kernels for Set Cover and Test Cover., , , и . SIAM J. Discret. Math., 30 (3): 1401-1423 (2016)On the Kernelization Complexity of String Problems., , , , и . COCOON, том 8591 из Lecture Notes in Computer Science, стр. 141-153. Springer, (2014)Fine-grained complexity of integer programming: The case of bounded branch-width and rank., , , и . CoRR, (2016)Faster Exact Algorithms for Some Terminal Set Problems., , , , , и . IPEC, том 8246 из Lecture Notes in Computer Science, стр. 150-162. Springer, (2013)Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS., , , , и . ICALP, том 107 из LIPIcs, стр. 110:1-110:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS., , , , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 523-537. Springer, (2019)