1. Who needs crossings? Hardness of plane graph rigidity;Abel,2016
2. The art gallery problem is ETR-complete;Abrahamsen,2018
3. Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm;Adsul,2011
4. 2-D Tucker is PPA complete;Aisenberg,2015
5. Splitting necklaces;Alon;Adv. Math.,1987