Sweta Das

collaborators

4 papers

math.CO2026

Exact-Distance Domination in Grid Graphs

Sandip Das, Sweta Das, Arpan Sadhukhan

Let $G_{n}$ be the $n \times n$ square grid, and let $k \geq 2$ . A set $D \subseteq V (G_{n})$ is an \emph{exact-distance $k$ -dominating set} if every vertex $v \in V (G_{n}) ∖ D$ has a…

cs.DM2026

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes

Sandip Das, Sweta Das, Sk Samim Islam

The domination problem is a well-studied problem in graph theory. In this paper, we study two natural variants: the hop domination problem and the $2$ -step domination problem. Let…

math.CO2026

Parameterized complexity of $r$ -Hop, $r$ -Step, and $r$ -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…

cs.DS2025

Exact Algorithms for Resource Reallocation Under Budgetary Constraints

Arun Kumar Das, Sandip Das, Sweta Das +2

Efficient resource (re-)allocation is a critical challenge in optimizing productivity and sustainability within multi-party supply networks. In this work, we introduce the \textsc{…

Exact-Distance Domination in Grid Graphs

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes

Parameterized complexity of r-Hop, r-Step, and r-Hop Roman Domination

Exact Algorithms for Resource Reallocation Under Budgetary Constraints

Parameterized complexity of $r$ -Hop, $r$ -Step, and $r$ -Hop Roman Domination