Sudeshna Kolay

activity

20152020

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

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

collaborators

4 papers

cs.CG2020

Parameterized Study of Steiner Tree on Unit Disk Graphs

Sujoy Bhore, Paz Carmi, Sudeshna Kolay +1

We study the Steiner Tree problem on unit disk graphs. Given a $n$ vertex unit disk graph $G$ , a subset $R \subseteq V (G)$ of $t$ vertices and a positive integer $k$ , the objective…

cs.CC2019

Structural Parameterization for Graph Deletion Problems over Data Streams

Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay +2

The study of parameterized streaming complexity on graph problems was initiated by Fafianie et al. (MFCS'14) and Chitnis et al. (SODA'15 and SODA'16). Simply put, the main goal is…

cs.CC2019

Parameterized Complexity of Conflict-free Graph Coloring

Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse

Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring $c : V (G) \to {1, 2, \dots, q}$ such that for each vertex $v \in V (G)$ t…

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…