( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion.

, , , и . CoRR, (2015)

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.

Sudeshna Dey

 

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

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting., , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 408-419. Springer, (2012)Parameterized Algorithms for Deletion to (r, ell)-Graphs., и . FSTTCS, том 45 из LIPIcs, стр. 420-433. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Approximation algorithms for maximum independent set of a unit disk graph., , , , и . Inf. Process. Lett., 115 (3): 439-446 (2015)Parameterized Approximations via d-Skew-Symmetric Multicut., , , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 457-468. Springer, (2014)Faster Parameterized Algorithms for Deletion to Split Graphs., , , , , , и . SWAT, том 7357 из Lecture Notes in Computer Science, стр. 107-118. Springer, (2012)An ETH-Tight Exact Algorithm for Euclidean TSP., , , и . SIAM J. Comput., 52 (3): 740-760 (июня 2023)Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets., , и . ISAAC, том 283 из LIPIcs, стр. 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Parameterized Complexity of Red Blue Set Cover for Lines., , и . LATIN, том 9644 из Lecture Notes in Computer Science, стр. 96-109. Springer, (2016)Harmonious Coloring: Parameterized Algorithms and Upper Bounds., , , , и . WG, том 9941 из Lecture Notes in Computer Science, стр. 245-256. (2016)Multivariate Complexity Analysis of Geometric Red Blue Set Cover., , и . Algorithmica, 79 (3): 667-697 (2017)