( en | de | ru )

 

Disambiguation of "Kolay, Sudeshna"

Author of the publication

copydeleteadd this publication to your clipboard
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion.

, , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Sudeshna Dey

 

Other publications of authors with the same name

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