Sandip Das

collaborators

4 papers

cs.DS2026

Algorithms and complexity for geodetic sets on interval and chordal graphs

Dibyayan Chakraborty, Sandip Das, Florent Foucaud +2

We study the computational complexity of finding the geodetic number of a graph on chordal graphs and interval graphs. A set $S$ of vertices of a graph $G$ is a \textit{geodetic se…

cs.CC2026

On the complexity of Multipacking

Sandip Das, Sk Samim Islam, Daniel Lokshtanov

A multipacking in an undirected graph $G = (V, E)$ is a set $M \subseteq V$ such that for every vertex $v \in V$ and for every integer $r \geq 1$ , the ball of radius $r$ around $v$ conta…

cs.DM2026

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs

Sandip Das, Florent Foucaud, Sk Samim Islam +1

For a graph $G = (V, E)$ with a vertex set $V$ and an edge set $E$ , a function $f : V \to {0, 1, 2, ..., d iam (G)}$ is called a \emph{broadcast} on $G$ . For e…

cs.CG2025

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 $n$ points $P$ and define $N_{s} [v]$ as the subset of…