10 citations · 25 across the 10 of their papers we have counts for
5 papers · 1 filter
An FPT Algorithm for Splitting a Necklace Among Two Thieves
Michaela Borzechowski, Patrick Schnider, Simon Weber
It is well-known that the 2-Thief-Necklace-Splitting problem reduces to the discrete Ham Sandwich problem. In fact, this reduction was crucial in the proof of the PPA-completeness…
On Connectivity in Random Graph Models with Limited Dependencies
Johannes Lengler, Anders Martinsson, Kalina Petrova +4
For any positive edge density , a random graph in the Erdős-Renyi model is connected with non-zero probability, since all edges are mutually independent. We consider r…
On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
Michaela Borzechowski, Simon Weber
Klaus showed that the Oriented Matroid Complementarity Problem (OMCP) can be solved by a reduction to the problem of sink-finding in a unique sink orientation (USO) if the input is…
A Universal Construction for Unique Sink Orientations
Michaela Borzechowski, Joseph Doolittle, Simon Weber
Unique Sink Orientations (USOs) of cubes can be used to capture the combinatorial structure of many essential algebraic and geometric problems. For various structural and algorithm…
A Characterization of the Realizable Matoušek Unique Sink Orientations
Simon Weber, Bernd Gärtner
The Matoušek LP-type problems were used by Matoušek to show that the Sharir-Welzl algorithm may require at least subexponential time. Later, Gärtner translated this result into the…