Pranabendu Misra

According to our database, Pranabendu Misra authored at least 54 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation.

Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications.

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set.

Sheikh Shakil Akhtar, Jayakrishnan Madathil, Pranabendu Misra, Geevarghese Philip

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number.

Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra

Math. Oper. Res., 2024

Meta-theorems for Parameterized Streaming Algorithms‡.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Parameterized Approximation Algorithms for Weighted Vertex Cover.

Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Kernelization of Counting Problems.

Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Polynomial Kernel for Interval Vertex Deletion.

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

ACM Trans. Algorithms, April, 2023

A single exponential-time FPT algorithm for cactus contraction.

R. Krithika, Pranabendu Misra, Prafullkumar Tale

Theor. Comput. Sci., 2023

An ETH-Tight Algorithm for Bidirected Steiner Connectivity.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands.

Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Improving Order with Queues.

Andreas Karrenbauer, Leonie Krull, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek

CoRR, 2022

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.

Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

FPT-approximation for FPT Problems.

Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Strong Connectivity Augmentation is FPT.

Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Improving EFX Guarantees through Rainbow Cycle Number.

Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Faster Graph bipartization.

Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

J. Comput. Syst. Sci., 2020

On Fault Tolerant Feedback Vertex Set.

Pranabendu Misra

CoRR, 2020

An exponential time parameterized algorithm for planar disjoint paths.

Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2-Approximating Feedback Vertex Set in Tournaments.

Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Quick Separation in Chordal and Split Graphs.

Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Parameterized Complexity of Directed Spanner Problems.

Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Fault Tolerant Subgraphs with Applications in Kernelization.

William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the Complexity of Recovering Incidence Matrices.

Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

A Brief Note on Single Source Fault Tolerant Reachability.

Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

CoRR, 2019

Popular Matching in Roommates Setting is NP-hard.

Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Interval Vertex Deletion Admits a Polynomial Kernel.

Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

An Erdős-Pósa Theorem on Neighborhoods and Domination Number.

Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments.

Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh

CoRR, 2018

Erdös-Pósa Property of Obstructions to Interval Graphs.

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.

Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Exploring the Kernelization Borders for Hitting Cycles.

Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.

Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.

Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra

Proceedings of the Computer Science - Theory and Applications, 2018

An FPT Algorithm for Contraction to Cactus.

R. Krithika, Pranabendu Misra, Prafullkumar Tale

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems.

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

Proceedings of the Approximation, 2018

2017

Hitting Selected (Odd) Cycles.

Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

SIAM J. Discret. Math., 2017

On finding highly connected spanning subgraphs.

Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

CoRR, 2017

Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems.

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

CoRR, 2017

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.

Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank.

Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Lossy Kernels for Graph Contraction Problems.

R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Deterministic Truncation of Linear Matroids.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Finding Even Subgraphs Even Faster.

Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Reducing Rank of the Adjacency Matrix by Graph Modification.

Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Parameterized Approximations via d-Skew-Symmetric Multicut.

Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Parameterized Algorithms to Preserve Connectivity.

Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Faster Exact Algorithms for Some Terminal Set Problems.

Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Parameterized Algorithms for Even Cycle Transversal.

Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Faster Parameterized Algorithms for Deletion to Split Graphs.

Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.

Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011