1 citations · 1 across the 2 of their papers we have counts for
4 papers
Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements
Michaela Borzechowski, Sebastian Haslebacher, Hung P. Hoang +2
The famous Ham-Sandwich theorem states that any point sets in can be simultaneously bisected by a single hyperplane. The -Ham-Sandwich theorem gives a suffici…
Unfairly Splitting Separable Necklaces
Patrick Schnider, Linus Stalder, Simon Weber
The Necklace Splitting problem is a classical problem in combinatorics that has been intensively studied both from a combinatorial and a computational point of view. It is well-kno…
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
Michaela Borzechowski, John Fearnley, Spencer Gordon +3
We provide polynomial-time reductions between three search problems from three distinct areas: the P-matrix linear complementarity problem (P-LCP), finding the sink of a unique sin…
On Phases of Unique Sink Orientations
Michaela Borzechowski, Simon Weber
A unique sink orientation (USO) is an orientation of the -dimensional hypercube graph such that every non-empty face contains a unique sink. Schurr showed that given any -dim…