Parameterized Algorithms for Even Cycle Transversal. - Pranabendu Misra; Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (WG, 2012)

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. - Pranabendu Misra; Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (Theory Comput. Syst., 2013)

Parameterized Algorithms to Preserve Connectivity. - Manu Basavaraju; Fedor V. Fomin; Petr A. Golovach; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001 (ICALP (1), 2014)

Parameterized Approximations via d-Skew-Symmetric Multicut. - Sudeshna Kolay; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001 (MFCS (2), 2014)

Faster Parameterized Algorithms for Deletion to Split Graphs. - Esha Ghosh; Sudeshna Kolay; Mrinal Kumar 001; Pranabendu Misra; Fahad Panolan; Ashutosh Rai 001; M. S. Ramanujan 001 (Algorithmica, 2015)

Lossy Kernels for Graph Contraction Problems. - R. Krithika 001; Pranabendu Misra; Ashutosh Rai 001; Prafullkumar Tale (FSTTCS, 2016)

Reducing rank of the adjacency matrix by graph modification. - Syed Mohammad Meesum; Pranabendu Misra; Saket Saurabh 001 (Theor. Comput. Sci., 2016)

Polylogarithmic Approximation Algorithms for Weighted-$ mathcal{F}$-Deletion Problems. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (CoRR, 2017)

On finding highly connected spanning subgraphs. - Manu Basavaraju; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001 (CoRR, 2017)

Faster exact algorithms for some terminal set problems. - Rajesh Chitnis; Fedor V. Fomin; Daniel Lokshtanov; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001 (J. Comput. Syst. Sci., 2017)

Hitting Selected (Odd) Cycles. - Daniel Lokshtanov; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2017)

An FPT Algorithm for Contraction to Cactus. - R. Krithika 001; Pranabendu Misra; Prafullkumar Tale (COCOON, 2018)

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ITCS, 2018)

Exploring the Kernelization Borders for Hitting Cycles. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Pranabendu Misra; Saket Saurabh 001 (IPEC, 2018)

Parameterized Algorithms for Survivable Network Design with Uniform Demands. - Jørgen Bang-Jensen; Manu Basavaraju; Kristine Vitting Klinkby; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2018)

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. - Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee; Geevarghese Philip; Fahad Panolan; Saket Saurabh 001 (CoRR, 2018)

Finding even subgraphs even faster. - Prachi Goyal; Pranabendu Misra; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (J. Comput. Syst. Sci., 2018)

Deterministic Truncation of Linear Matroids. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001 (ACM Trans. Algorithms, 2018)

An Erdős-Pósa Theorem on Neighborhoods and Domination Number. - Jayakrishnan Madathil; Pranabendu Misra; Saket Saurabh 001 (COCOON, 2019)

Interval Vertex Deletion Admits a Polynomial Kernel. - Akanksha Agrawal 001; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (SODA, 2019)

A Brief Note on Single Source Fault Tolerant Reachability. - Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (CoRR, 2019)

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2019)

On the Complexity of Recovering Incidence Matrices. - Fedor V. Fomin; Petr A. Golovach; Pranabendu Misra; M. S. Ramanujan 001 (ESA, 2020)

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (ICALP, 2020)

Fault Tolerant Subgraphs with Applications in Kernelization. - William Lochet; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ITCS, 2020)

Quick Separation in Chordal and Split Graphs. - Pranabendu Misra; Fahad Panolan; Ashutosh Rai 001; Saket Saurabh 001; Roohani Sharma (MFCS, 2020)

On Fault Tolerant Feedback Vertex Set. - Pranabendu Misra (CoRR, 2020)

Popular Matching in Roommates Setting is NP-hard. - Sushmita Gupta; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (Bull. EATCS, 2020)

Faster Graph bipartization. - Sudeshna Kolay; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001 (J. Comput. Syst. Sci., 2020)

Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. - Pallavi Jain 001; Lawqueen Kanesh; Pranabendu Misra (Theory Comput. Syst., 2020)

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2020)

Linear representation of transversal matroids and gammoids parameterized by rank. - Pranabendu Misra; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (Theor. Comput. Sci., 2020)

Improving EFX Guarantees through Rainbow Cycle Number. - Bhaskar Ray Chaudhury; Jugal Garg; Kurt Mehlhorn; Ruta Mehta; Pranabendu Misra (EC, 2021)

Strong Connectivity Augmentation is FPT. - Kristine Vitting Klinkby; Pranabendu Misra; Saket Saurabh 001 (SODA, 2021)

FPT-approximation for FPT Problems. - Daniel Lokshtanov; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2021)

2-Approximating Feedback Vertex Set in Tournaments. - Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (ACM Trans. Algorithms, 2021)

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. - Dániel Marx; Pranabendu Misra; Daniel Neuen; Prafullkumar Tale (SODA, 2022)

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. - Akanksha Agrawal 001; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001 (Algorithmica, 2022)

Parameterized Complexity of Directed Spanner Problems. - Fedor V. Fomin; Petr A. Golovach; William Lochet; Pranabendu Misra; Saket Saurabh 001; Roohani Sharma (Algorithmica, 2022)

Improving Order with Queues. - Andreas Karrenbauer; Leonie Krull; Kurt Mehlhorn; Pranabendu Misra; Paolo Luigi Rinaldi; Anna Twelsiek (CoRR, 2022)

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. - Jørgen Bang-Jensen; Kristine Vitting Klinkby; Pranabendu Misra; Saket Saurabh 001 (ESA, 2023)

An ETH-Tight Algorithm for Bidirected Steiner Connectivity. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (WADS, 2023)

A single exponential-time FPT algorithm for cactus contraction. - R. Krithika 001; Pranabendu Misra; Prafullkumar Tale (Theor. Comput. Sci., 2023)

Erdős-Pósa property of obstructions to interval graphs. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (J. Graph Theory, 2023)

Polynomial Kernel for Interval Vertex Deletion. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2023)

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. - Pranabendu Misra; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (Algorithmica, 2023)

Kernelization of Counting Problems. - Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ITCS, 2024)

Meta-theorems for Parameterized Streaming Algorithms‡. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 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)

Parameterized approximation algorithms for weighted vertex cover. - Soumen Mandal 001; Pranabendu Misra; Ashutosh Rai 001; Saket Saurabh 001 (Theor. Comput. Sci., 2024)

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set. - Sheikh Shakil Akhtar; Jayakrishnan Madathil; Pranabendu Misra; Geevarghese Philip (CALDAM, 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 001; Prafullkumar Tale; Jie Xue 003 (ICALP, 2025)

Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. - Rohit Gurjar; Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (MFCS, 2025)

An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. - Daniel Lokshtanov; Pranabendu Misra; Michal Pilipczuk; Saket Saurabh 001; Meirav Zehavi (SIAM J. Comput., 2025)