In 2002, Even et al. introduced and studied the notion of conflict-free colorings of
geometrically defined hypergraphs. They motivated it by frequency assignment problems in …

In an undirected graph G, a conflict-free coloring with respect to open neighborhoods
(denoted by CFON coloring) is an assignment of colors to the vertices such that every vertex …

We prove that the intersection hypergraph of a family of n pseudo-disks with respect to
another family of pseudo-disks admits a proper coloring with four colors and a conflict-free …

A conflict-free coloring of a graph G is a (partial) coloring of its vertices such that every vertex
u has a neighbor whose assigned color is unique in the neighborhood of u. There are two …

Abstract A Conflict-Free Open Neighborhood coloring, abbreviated CFON^* coloring, of a
graph G=(V, E) using k colors is an assignment of colors from a set of k colors to a subset of …

In an undirected graph G, a conflict-free coloring with respect to open neighborhoods
(denoted by CFON coloring) is an assignment of colors to the vertices such that every vertex …

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 …

In this paper, we study a wireless network-inspired set cover problem with color constraints,
called Minimum 3-Colorable Discrete Unit Disk Cover. In this problem, given a point set P …

Conflict-free coloring (in short, CF-coloring) of a graph G=(V, E) G=(V, E) is a coloring of V
such that the punctured neighborhood of each vertex contains a vertex whose color differs …

This thesis focuses on two concepts which are widely studied in the field of computational
geometry. Namely, visibility and unit disk graphs. In the field of visibility, we have studied the …