Pradeesha Ashok

activity

20122026

most citedSmall Strong Epsilon Nets

6 citations · 8 across the 6 of their papers we have counts for

collaborators

Showing cs.CCShow all

3 papers · 1 filter

cs.CC2024

(Independent) Roman Domination Parameterized by Distance to Cluster

Pradeesha Ashok, Gautam K. Das, Arti Pandey +2

Given a graph $G = (V, E)$ , a function $f : V \to {0, 1, 2}$ is said to be a \emph{Roman Dominating function} (RDF) if for every $v \in V$ with $f (v) = 0$ , there exists a vertex $u \in N (v)$ …

cs.CC2023★ 1 cited

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring

V P Abidha, Pradeesha Ashok, Avi Tomar +1

The \emph{Square Colouring} of a graph $G$ refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colour…

cs.CC2022★ 1 cited

Polynomial Kernels for Generalized Domination Problems

Pradeesha Ashok, Rajath Rao, Avi Tomar

In this paper, we study the parameterized complexity of a generalized domination problem called the [ $σ, ρ$ ] Dominating Set problem. This problem generalizes a large number of prob…