5 papers
Parameterized complexity of -Hop, -Step, and -Hop Roman Domination
Sandip Das, Sweta Das, Sk Samim Islam
The \textsc{Dominating Set} problem is a classical and extensively studied topic in graph theory and theoretical computer science. In this paper, we examine the algorithmic complex…
On the complexity of Multipacking
Sandip Das, Sk Samim Islam, Daniel Lokshtanov
A multipacking in an undirected graph is a set such that for every vertex and for every integer , the ball of radius around conta…
Multipacking on graphs and Euclidean metric space
Sk Samim Islam
A \emph{multipacking} in an undirected graph is a set such that for every vertex and for every integer , the ball of radius around…
On the Number of Almost Empty Monochromatic Triangles
Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam +3
In this paper, we consider the problem of counting almost empty monochromatic triangles in colored planar point sets, that is, triangles whose vertices are all assigned the same co…
Multipacking in Euclidean Metric Space
Arun Kumar Das, Sandip Das, Sk Samim Islam +2
Here we study the multipacking problems for geometric point sets with respect to their Euclidean distances. We consider a set of points and define as the subset of…