Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
From MaRDI portal
Publication:2373932
Recommendations
- Dynamic ham-sandwich cuts in the plane
- Algorithms for ham-sandwich cuts
- Orthogonal ham-sandwich theorem in \(\mathbb{R}^3\)
- Generalizing ham sandwich cuts to equitable subdivisions
- Weighted Ham-Sandwich Cuts
- Computing balanced convex partitions of lines
- Computing a ham-sandwich cut in two dimensions
- Computing balanced convex partitions of lines
- Equitable subdivisions within polygonal regions
- Generalized ham-sandwich cuts
Cites work
- Algorithms for ham-sandwich cuts
- An equipartition of planar sets
- An improved bound for \(k\)-sets in three dimensions
- An Optimal-Time Algorithm for Slope Selection
- Balanced convex partitions of measures in \(\mathbb R^{2}\)
- Balanced partitions of two sets of points in the plane
- Bisection of Circle Colorings
- Equipartition of two measures by a 4-fan
- Equipartitions of measures by 2-fans
- Generalizing ham sandwich cuts to equitable subdivisions
- Geodesic ham-sandwich cuts
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 1962801 (Why is no real title available?)
- scientific article; zbMATH DE number 1507295 (Why is no real title available?)
- Improved bounds for planar k-sets and related problems
- On k-Hulls and Related Problems
- Partitioning Space for Range Queries
- Partitioning with two lines in the plane
- Polygon Retrieval
- Simultaneous partitions of measures by \(k\)-fans
- Splitting necklaces
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- Weighted Ham-Sandwich Cuts
Cited in
(27)- Points with large \(\alpha \)-depth
- Computing a ham-sandwich cut in two dimensions
- Generalizing ham sandwich cuts to equitable subdivisions
- Fault-tolerant spanners in networks with symmetric directional antennas
- Computing balanced islands in two colored point sets in the plane
- Computing balanced convex partitions of lines
- Bisecting envelopes of convex polygons
- Ham-sandwich cuts and center transversals in subspaces
- Algorithms for finding connected separators between antipodal points
- The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
- scientific article; zbMATH DE number 431992 (Why is no real title available?)
- Computing generalized ham-sandwich cuts
- Ham Sandwich is equivalent to Borsuk-Ulam
- A survey of mass partitions
- The Borsuk-Ulam theorem and combinatorics
- Orthogonal ham-sandwich theorem in \(\mathbb{R}^3\)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
- Generalized ham-sandwich cuts
- An application of Borsuk-Ulam's theorem to parametric optimization
- Computing balanced convex partitions of lines
- On the enumeration of subcells within hypercubes and its application to the Borsuk-Ulam theorem
- Bisections of mass assignments using flags of affine spaces
- Acute tours in the plane
- An FPT algorithm for splitting a necklace among two thieves
- An FPT algorithm for splitting a necklace among two thieves
- On the orthogonal Grünbaum partition problem in dimension three
- Title not available (Why is no real title available?)
This page was built for publication: Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373932)
