Pranabendu Misra
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
32
Venues
13
Active years
2011–2026
Best venue rank
A*
Where they publish
Papers
32 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | MFCS | Connectivity Augmentation of Plane Graphs. | Krishnan Dehaleesan, Asif Khan, Pranabendu Misra |
| 2026 | WALCOM | Space Efficient Algorithms for Parameterised Problems. | Sheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip |
| 2025 | ICALP | Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dniel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue |
| 2025 | MFCS | Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. | Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2024 | LATIN | Parameterized Approximation Algorithms for Weighted Vertex Cover. | Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh |
| 2024 | SODA | Meta-theorems for Parameterized Streaming Algorithms‡. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2023 | ESA | A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. | Jrgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh |
| 2023 | WADS | An ETH-Tight Algorithm for Bidirected Steiner Connectivity. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2022 | SODA | A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. | Dniel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale |
| 2021 | SODA | Strong Connectivity Augmentation is FPT. | Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh |
| 2021 | SODA | FPT-approximation for FPT Problems. | Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2020 | ESA | On the Complexity of Recovering Incidence Matrices. | Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan |
| 2020 | ICALP | A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | MFCS | Quick Separation in Chordal and Split Graphs. | Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma |
| 2020 | SODA | 2-Approximating Feedback Vertex Set in Tournaments. | Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | STOC | An exponential time parameterized algorithm for planar disjoint paths. | Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi |
| 2019 | COCOON | An Erdős-Psa Theorem on Neighborhoods and Domination Number. | Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh |
| 2019 | SODA | Interval Vertex Deletion Admits a Polynomial Kernel. | Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2019 | SODA | Popular Matching in Roommates Setting is NP-hard. | Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2018 | COCOON | An FPT Algorithm for Contraction to Cactus. | R. Krithika, Pranabendu Misra, Prafullkumar Tale |
| 2018 | CSR | Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. | Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra |
| 2018 | SODA | Parameterized Algorithms for Survivable Network Design with Uniform Demands. | Jrgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | STACS | Erds-Psa Property of Obstructions to Interval Graphs. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | COCOON | Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. | Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | SODA | Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | WADS | Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. | Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh |
| 2015 | COCOON | Reducing Rank of the Adjacency Matrix by Graph Modification. | Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh |
| 2015 | ICALP | Deterministic Truncation of Linear Matroids. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh |
| 2014 | ICALP | Parameterized Algorithms to Preserve Connectivity. | Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | MFCS | Parameterized Approximations via d-Skew-Symmetric Multicut. | Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2012 | WG | Parameterized Algorithms for Even Cycle Transversal. | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | ISAAC | A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |