Shakhar Smorodinsky

Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks

Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem that we call minimum conflict-free coloring (min-CF-coloring). In its general form, the input of the min-CF-coloring problem is a set system

Conflict-Free Coloring of Points and Simple Regions in the Plane

(X,{\cal S})

Lenses in arrangements of pseudo-circles and their applications

, where each

Online Conflict-Free Coloring for Intervals

S \in {\cal S}

On The Chromatic Number of Geometric Hypergraphs

is a subset of X. The output is a coloring

Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks

\chi

Conflict-Free Coloring and its Applications

of the sets in

Conflict-free coloring for intervals: from offline to online

{\cal S}

Conflict-free colorings of shallow discs

that satisfies the following constraint: for every

Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd.

x \in X