P. Misra

activity

20142026

most citedA 2-Approximation Algorithm for Feedback Vertex Set in Tournaments

2 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.DS2017

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra +2

Given a graph $G$ and a parameter $k$ , the Chordal Vertex Deletion (CVD) problem asks whether there exists a subset $U \subseteq V (G)$ of size at most $k$ that hits all induced cycl…

cs.DS2017

Polylogarithmic Approximation Algorithms for Weighted- $F$ -Deletion Problems

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra +2

For a family of graphs $F$ , the canonical Weighted $F$ Vertex Deletion problem is defined as follows: given an $n$ -vertex undirected graph $G$ and a weight function $w: V…

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 $G$ and an integer $r_{uv}$ for every pair of vertices $u, v \in V (G)$ . The objective is to c…

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems

On finding highly connected spanning subgraphs

Polylogarithmic Approximation Algorithms for Weighted- $F$ -Deletion Problems