53 citations · 92 across the 32 of their papers we have counts for
4 papers · 1 filter
Polychromatic Coloring for Half-Planes
Shakhar Smorodinsky, Yelena Yuditsky
We prove that for every integer , every finite set of points in the plane can be -colored so that every half-plane that contains at least points, also contains at leas…
Conflict-Free Coloring Made Stronger
Elad Horev, Roi Krakovski, Shakhar Smorodinsky
In FOCS 2002, Even et al. showed that any set of discs in the plane can be Conflict-Free colored with a total of at most colors. That is, it can be colored with $O(…
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský
Given a geometric hypergraph (or a range-space) , a coloring of its vertices is said to be conflict-free if for every hyperedge there is at least one v…
Conflict-Free Coloring and its Applications
Shakhar Smorodinsky
Let be a hypergraph. A {\em conflict-free} coloring of is an assignment of colors to such that in each hyperedge there is at least one uniquely-colored…