Pranabendu Misra

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 63

Top Topics

Approximation Algorithms

Highly Connected

Top Venues

ACM Trans. Algorithms

Publications

Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Kernelization of Counting Problems. ITCS (2024)
Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh
Parameterized Approximation Algorithms for Weighted Vertex Cover. LATIN (2) (2024)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms‡. SODA (2024)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19 (2) (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS (2023)
Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ESA (2023)
R. Krithika, Pranabendu Misra, Prafullkumar Tale
A single exponential-time FPT algorithm for cactus contraction. Theor. Comput. Sci. 954 (2023)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory 102 (4) (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms. CoRR (2023)
Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85 (7) (2023)
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Kernelization of Counting Problems. CoRR (2023)
Andreas Karrenbauer, Leonie Krull, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek
Improving Order with Queues. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84 (8) (2022)
Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 84 (9) (2022)
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA (2022)
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR (2021)
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra
Improving EFX Guarantees through Rainbow Cycle Number. EC (2021)
Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR (2021)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13 (2) (2021)
Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
Strong Connectivity Augmentation is FPT. SODA (2021)
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra
Improving EFX Guarantees through Rainbow Cycle Number. CoRR (2021)
Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
FPT-approximation for FPT Problems. SODA (2021)
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17 (2) (2021)
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2-Approximating Feedback Vertex Set in Tournaments. SODA (2020)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms 16 (4) (2020)
Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Faster Graph bipartization. J. Comput. Syst. Sci. 109 (2020)
Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
An exponential time parameterized algorithm for planar disjoint paths. STOC (2020)
William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS (2020)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting is NP-hard. Bull. EATCS 130 (2020)
Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma
Quick Separation in Chordal and Split Graphs. MFCS (2020)
Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan
On the Complexity of Recovering Incidence Matrices. ESA (2020)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP (2020)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. IPEC (2020)
Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. Theory Comput. Syst. 64 (6) (2020)
Pranabendu Misra
On Fault Tolerant Feedback Vertex Set. CoRR (2020)
Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. 818 (2020)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms 15 (1) (2019)
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
A Brief Note on Single Source Fault Tolerant Reachability. CoRR (2019)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting is NP-hard. SODA (2019)
Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Interval Vertex Deletion Admits a Polynomial Kernel. SODA (2019)
Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh
An Erdős-Pósa Theorem on Neighborhoods and Domination Number. COCOON (2019)
Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA (2018)
Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. CSR (2018)
Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Finding even subgraphs even faster. J. Comput. Syst. Sci. 97 (2018)
R. Krithika, Pranabendu Misra, Prafullkumar Tale
An FPT Algorithm for Contraction to Cactus. COCOON (2018)
Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. FSTTCS (2018)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM (2018)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting is NP-hard. CoRR (2018)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS (2018)
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh
Exploring the Kernelization Borders for Hitting Cycles. IPEC (2018)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms 14 (2) (2018)
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR (2018)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Erdös-Pósa Property of Obstructions to Interval Graphs. STACS (2018)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA (2017)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR (2017)
Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON (2017)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR (2017)
Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
On finding highly connected spanning subgraphs. CoRR (2017)
Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. 88 (2017)
Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS (2017)
Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. 31 (3) (2017)
Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh
Reducing rank of the adjacency matrix by graph modification. Theor. Comput. Sci. 654 (2016)
R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale
Lossy Kernels for Graph Contraction Problems. FSTTCS (2016)
Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Finding Even Subgraphs Even Faster. FSTTCS (2015)
Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh
Reducing Rank of the Adjacency Matrix by Graph Modification. COCOON (2015)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
Deterministic Truncation of Linear Matroids. ICALP (1) (2015)
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71 (4) (2015)
Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) (2014)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
Deterministic Truncation of Linear Matroids. CoRR (2014)
Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Parameterized Algorithms to Preserve Connectivity. ICALP (1) (2014)
Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Finding Even Subgraphs Even Faster. CoRR (2014)
Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Faster Exact Algorithms for Some Terminal Set Problems. IPEC (2013)
Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. Theory Comput. Syst. 53 (4) (2013)
Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
Parameterized Algorithms for Even Cycle Transversal. WG (2012)
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT (2012)
Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. ISAAC (2011)