1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2025
A Single Exponential-Time FPT Algorithm for Cactus Contraction
R. Krithika, Pranabendu Misra, Prafullkumar Tale
For a collection of graphs, the -\textsc{Contraction} problem takes a graph and an integer as input and decides if can be modified to some gr…
cs.DS2023
Meta-theorems for Parameterized Streaming Algorithms
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan +3
The streaming model was introduced to parameterized complexity independently by Fafianie and Kratsch [MFCS14] and by Chitnis, Cormode, Hajiaghayi and Monemizadeh [SODA15]. Subseque…
cs.DS2017★ 1 cited
On finding highly connected spanning subgraphs
Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan +1
In the Survivable Network Design Problem (SNDP), the input is an edge-weighted (di)graph and an integer for every pair of vertices . The objective is to c…