Sudeshna Kolay

activity

20152026

most citedParameterized Algorithms for Deletion to (r,l)-graphs

3 citations · 4 across the 15 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

cs.DS2015

Parameterized Algorithms on Perfect Graphs for deletion to $(r, ℓ)$ -graphs

Sudeshna Kolay, Fahad Panolan, Venkatesh Raman +1

For fixed integers $r, ℓ \geq 0$ , a graph $G$ is called an {\em $(r, ℓ)$ -graph} if the vertex set $V (G)$ can be partitioned into $r$ independent sets and $ℓ$ cliques. The cl…

cs.DS2015

Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}

Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh

We investigate the parameterized complexity of GENERALIZED RED BLUE SET COVER (Gen-RBSC), a generalization of the classic SET COVER problem and the more recently studied RED BLUE S…

cs.DS2015

A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion

Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov +1

A graph $G$ is called a \emph{block graph} if each maximal $2$ -connected component of $G$ is a clique. In this paper we study the Block Graph Vertex Deletion from the perspective o…

cs.CC2015★ 3 cited

Parameterized Algorithms for Deletion to (r,l)-graphs

Sudeshna Kolay, Fahad Panolan

For fixed integers $r, ℓ \geq 0$ , a graph $G$ is called an {\em $(r, ℓ)$ -graph} if the vertex set $V (G)$ can be partitioned into $r$ independent sets and $ℓ$ cliques. This b…

Parameterized Algorithms on Perfect Graphs for deletion to (r,ℓ)-graphs

Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}

A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion

Parameterized Algorithms for Deletion to (r,l)-graphs

Parameterized Algorithms on Perfect Graphs for deletion to $(r, ℓ)$ -graphs