( 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

 

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

Reducing CMSO Model Checking to Highly Connected Graphs., , , и . ICALP, том 107 из LIPIcs, стр. 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Multivariate Complexity Analysis of Geometric Red Blue Set Cover., , и . Algorithmica, 79 (3): 667-697 (2017)A characterization of König-Egerváry graphs with extendable vertex covers., , и . Inf. Process. Lett., (2020)Local search: Is brute-force avoidable?, , , , , и . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)On the Hardness of Losing Width., , , , и . Theory Comput. Syst., 54 (1): 73-82 (2014)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , и . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems., , , , и . SIAM J. Discret. Math., 37 (4): 2626-2669 (декабря 2023)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , и . Algorithmica, 83 (2): 753-774 (2021)A Polynomial Kernel for Bipartite Permutation Vertex Deletion., , , , , и . Algorithmica, 84 (11): 3246-3275 (2022)Faster algorithms for feedback vertex set., , и . Electron. Notes Discret. Math., (2005)