53 citations · 53 across the 5 of their papers we have counts for
6 papers
From a -Theorem to a Tight -Theorem
Chaya Keller, Shakhar Smorodinsky
A family of sets is said to satisfy the -property if among any sets of some intersect. The celebrated -theorem of Alon and Kleitman asserts that any f…
Hypergraphical Clustering Games of Mis-Coordination
Rann Smorodinsky, Shakhar Smorodinsky
We introduce and motivate the study of hypergraphical clustering games of mis-coordination. For two specific variants we prove the existence of a pure Nash equilibrium and provide…
On Piercing Numbers of Families Satisfying the Property
Chaya Keller, Shakhar Smorodinsky
The Hadwiger-Debrunner number is the minimal size of a piercing set that can always be guaranteed for a family of compact convex sets in that satisfies t…
On the union complexity of families of axis-parallel rectangles with a low packing number
Chaya Keller, Shakhar Smorodinsky
Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the u…
Hitting Sets Online and Unique-Max Coloring
Guy Even, Shakhar Smorodinsky
We consider the problem of hitting sets online. The hypergraph (i.e., range-space consisting of points and ranges) is known in advance, and the ranges to be stabbed are input one-b…
Compatible Geometric Matchings
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu +10
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing.…