Pranabendu Misra

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