( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

, , , , и . ICALP, том 80 из LIPIcs, стр. 65:1-65:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Saurabh Sanatani

Saket Sathe

Saurabh Srivastava

Saurabh Bhavsar

Saket Navlakha

 

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

On the Parameterized Complexity of Edge-Linked Paths., , и . CSR, том 11532 из Lecture Notes in Computer Science, стр. 286-298. Springer, (2019)Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments., , и . Algorithmica, 76 (2): 320-343 (2016)Parameterized Complexity of Superstring Problems., , , , , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 89-99. Springer, (2015)Even Faster Algorithm for Set Splitting!, и . IWPEC, том 5917 из Lecture Notes in Computer Science, стр. 288-299. Springer, (2009)Parameterized Algorithms for Directed Maximum Leaf Problems., , , , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 352-362. Springer, (2007)Reducing Rank of the Adjacency Matrix by Graph Modification., , и . COCOON, том 9198 из Lecture Notes in Computer Science, стр. 361-373. Springer, (2015)Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs., , , , и . COCOON, том 9198 из Lecture Notes in Computer Science, стр. 349-360. Springer, (2015)Editing to Connected f-Degree Graph., , , и . STACS, том 47 из LIPIcs, стр. 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Fixed-Parameter Tractability of Satisfying beyond the Number of Variables., , , , , и . SAT, том 7317 из Lecture Notes in Computer Science, стр. 355-368. Springer, (2012)Parameterized Algorithms for Boxicity., , и . ISAAC (1), том 6506 из Lecture Notes in Computer Science, стр. 366-377. Springer, (2010)