Pradeesha Ashok

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

collaborators

2 papers

cs.DS2019

FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding

Akanksha Agrawal, Pradeesha Ashok, Meghana M Reddy +2

We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph $G = (V, E)$ , \emph{conflict-free coloring} of $G$ refers to coloring a…

cs.CG2012★ 6 cited

Small Strong Epsilon Nets

Pradeesha Ashok, Umair Azmi, Sathish Govindarajan

Let P be a set of n points in $R^{d}$ . A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than $\frac{d n}{d + 1}$ points of P.…