Arun Kumar Das

collaborators

3 papers

math.CO2026

On the complexity of global Roman domination problem in graphs

Sangam Balchandar Reddy, Arun Kumar Das, Anjeneya Swami Kare +1

A Roman dominating function of a graph $G = (V, E)$ is a labeling $f : V \to {0, 1, 2}$ such that for each vertex $u \in V$ with $f (u) = 0$ , there exists a vertex $v \in N(…

cs.DS2025

Precoloring extension with demands on paths

Arun Kumar Das, Michal Opler, Tomáš Valla

Let $G$ be a graph with a set of precolored vertices, and let us be given an integer distance parameter $d$ and a set of integer demands $d_{1}, \dots, d_{c}$ . The Distance Precoloring E…

cs.CG2025

On Triangular Separation of Bichromatic Point Sets

Helena Bergold, Arun Kumar Das, Robert Lauff +3

We address the problem of computing the minimum number of triangles to separate a set of blue points from a set of red points in $R^{2}$ . A set of triangles is a \emph{separ…