( en | de | ru )

 

Disambiguation of "Misra, Pranabendu"

Author of the publication

copydeleteadd this publication to your clipboard
Interval Vertex Deletion Admits a Polynomial Kernel.

, , , and . SODA, page 1711-1730. SIAM, (2019)

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.

Manoj Misra

Sidhant Misra

Ashok Misra

Pranob Misra

Hara Prasanna Misra

 

Other publications of authors with the same name

Reducing Rank of the Adjacency Matrix by Graph Modification., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 361-373. Springer, (2015)2-Approximating Feedback Vertex Set in Tournaments., , , , , and . SODA, page 1010-1018. SIAM, (2020)Parameterized Algorithms for Survivable Network Design with Uniform Demands., , , , , , and . SODA, page 2838-2850. SIAM, (2018)FPT-approximation for FPT Problems., , , , and . SODA, page 199-218. SIAM, (2021)On the Complexity of Recovering Incidence Matrices., , , and . ESA, volume 173 of LIPIcs, page 50:1-50:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 25-36. Springer, (2017)Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems., , , , and . APPROX-RANDOM, volume 116 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Interval Vertex Deletion Admits a Polynomial Kernel., , , and . SODA, page 1711-1730. SIAM, (2019)Popular Matching in Roommates Setting is NP-hard., , , and . SODA, page 2810-2822. SIAM, (2019)Strong Connectivity Augmentation is FPT., , and . SODA, page 219-234. SIAM, (2021)