The following pages link to Splitting necklaces (Q1097280):
Displaying 50 items.
- Stiefel manifolds and coloring the pentagon (Q392810) (← links)
- Illumination complexes, \(\varDelta\)-zonotopes, and the polyhedral curtain theorem (Q482345) (← links)
- Extensions of cut-and-choose fair division (Q677613) (← links)
- On existence theorems (Q686508) (← links)
- Topology and combinatorics of partitions of masses by hyperplanes (Q855777) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- A probabilistic spatial distribution model for wire faults in parallel network-on-chip links (Q1665614) (← links)
- Resource-monotonicity and population-monotonicity in connected cake-cutting (Q1737122) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- Note on a conjecture of Sierksma (Q1802219) (← links)
- Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715) (← links)
- Approximating fair division with a limited number of cuts (Q1903017) (← links)
- On the computability of equitable divisions (Q1926490) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Vanishing of all equivariant obstructions and the mapping degree (Q2230928) (← links)
- Fair division of mixed divisible and indivisible goods (Q2238609) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- Fair cake-cutting among families (Q2296036) (← links)
- Dold's theorem from viewpoint of strong compatibility graphs (Q2297921) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem (Q2373932) (← links)
- Fair splitting of colored paths (Q2401427) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- Splitting multidimensional necklaces (Q2427574) (← links)
- On the Lazarev-Lieb extension of the Hobby-Rice theorem (Q2437403) (← links)
- Simplotopal maps and necklace splitting (Q2439120) (← links)
- Convex equipartitions: the spicy chicken theorem (Q2452181) (← links)
- The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics (Q2497969) (← links)
- Measure partitions using hyperplanes with fixed directions (Q2630134) (← links)
- Discrete geometry on colored point sets in the plane -- a survey (Q2657063) (← links)
- Obstacles for splitting multidimensional necklaces (Q2944841) (← links)
- Witt vectors. Part 1 (Q3053864) (← links)
- Thieves can make sandwiches (Q4604599) (← links)
- (Q5005124) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Dynamic Fair Resource Division (Q5085123) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- (Q5092469) (← links)
- On a method of obtaining exact fair divisions (Q5135651) (← links)
- SPLITTING LOOPS AND NECKLACES: VARIANTS OF THE SQUARE PEG PROBLEM (Q5210688) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Polytopal complexes: maps, chain complexes and… necklaces (Q5301004) (← links)
- Fair Cake Division Under Monotone Likelihood Ratios (Q5868939) (← links)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- (Q5881546) (← links)
- Envy-free division via configuration spaces (Q6044500) (← links)
- Colorful Matchings (Q6098465) (← links)
- Approximately EFX allocations for indivisible chores (Q6152663) (← links)
