The following pages link to Splitting necklaces (Q1097280):
Displaying 21 items.
- On a method of obtaining exact fair divisions (Q5135651) (← links)
- SPLITTING LOOPS AND NECKLACES: VARIANTS OF THE SQUARE PEG PROBLEM (Q5210688) (← links)
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications (Q5234532) (← 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)
- Equipartitions of measures in $\mathbb{R}^4$ (Q5423902) (← links)
- Reconstructing Odd Necklaces (Q5437230) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Fair Cake Division Under Monotone Likelihood Ratios (Q5868939) (← links)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- (Q5881546) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
- Fairly allocating contiguous blocks of indivisible items (Q5894699) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
- Envy-free division via configuration spaces (Q6044500) (← links)
- Colorful Matchings (Q6098465) (← links)
- Approximately EFX allocations for indivisible chores (Q6152663) (← links)
- Improved bounds for the binary paint shop problem (Q6591633) (← links)
- Online Nash welfare maximization without predictions (Q6609160) (← links)
