The following pages link to Algorithms for ham-sandwich cuts (Q1329191):
Displaying 39 items.
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- Generalized ham-sandwich cuts (Q603848) (← links)
- A stronger conclusion to the classical ham sandwich theorem (Q641540) (← links)
- Separating collections of points in Euclidean spaces (Q674178) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- On the expected number of \(k\)-sets (Q1327450) (← links)
- Illumination by floodlights (Q1388133) (← links)
- An optimal algorithm for plane matchings in multipartite geometric graphs (Q1616235) (← links)
- Linear transformation distance for bichromatic matchings (Q1699281) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- New challenges in dynamic load balancing (Q1765341) (← links)
- Equipartition of mass distributions by hyperplanes (Q1911766) (← links)
- Bisecting envelopes of convex polygons (Q2122767) (← links)
- Geometric systems of unbiased representatives (Q2122784) (← links)
- Bisecting three classes of lines (Q2230403) (← links)
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem (Q2373932) (← links)
- Extreme point and halving edge search in abstract order types (Q2391543) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
- Equitable subdivisions within polygonal regions (Q2489545) (← links)
- A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)
- A semi-algebraic version of Zarankiewicz's problem (Q2628329) (← links)
- Discrete geometry on colored point sets in the plane -- a survey (Q2657063) (← links)
- On geometric graphs on point sets in the plane (Q2695466) (← links)
- Few cuts meet many point sets (Q2696278) (← links)
- An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs (Q3449806) (← links)
- On the Complexity of the Pancake Problem (Q4921438) (← links)
- (Q5009629) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Packing 1-plane Hamiltonian cycles in complete geometric graphs (Q5080782) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- (Q5881546) (← links)
- Cubic plane graphs on a given point set (Q5891915) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
- Some geometric lower bounds (Q6487948) (← links)
