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 2019Show all

2 papers · 1 filter

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 such that for each vertex t…