6 citations · 8 across the 9 of their papers we have counts for
11 papers
From One Solution to Many: An Oracle-Based FPT Framework for Diverse Solutions under Generalized Diversity Measures
Pradeesha Ashok, Sobyasachi Chatterjee, Soumi Nandi +2
The problem of computing \emph{diverse} solutions has recently emerged as an important area of study, motivated by applications in fairness, robustness, and security. Instead of re…
(Independent) Roman Domination Parameterized by Distance to Cluster
Pradeesha Ashok, Gautam K. Das, Arti Pandey +2
Given a graph , a function is said to be a \emph{Roman Dominating function} (RDF) if for every with , there exists a vertex …
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 refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colour…
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…
Red Blue Set Cover Problem on Axis-Parallel Hyperplanes and Other Objects
V P Abidha, Pradeesha Ashok
Given a universe of a finite set of red elements , and a finite set of blue elements and a family of subsets of , the \RBSC…
Geometric Separability using Orthogonal Objects
Abidha V P, Pradeesha Ashok
Given a bichromatic point set of red and blue points, a separator is an object of a certain type that separates and . We stu…