Matousek, Jií, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.”https://doi.org/10.1007/s00454-014-9584-7__Discrete &; Computational Geometry. Springer, 2014.https://doi.org/10.1007/s00454-014-9584-7 .

cadek, Martin, Marek Krcál, Jií Matousek, Francis Sergeraert, Lukás Vokínek, and Uli Wagner. “Computing All Maps into a Sphere.”https://doi.org/10.1145/2597629__Journal of the ACM. ACM, 2014.https://doi.org/10.1145/2597629 .

Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria, n.d.

Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.”https://doi.org/10.1145/2582112.2582134__In Proceedings of the Annual Symposium on Computational Geometry, 171–80. ACM, 2014.https://doi.org/10.1145/2582112.2582134 .

Matousek, Jií, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.”https://doi.org/10.1145/2582112.2582137__In Proceedings of the Annual Symposium on Computational Geometry, 78–84. ACM, 2014.https://doi.org/10.1145/2582112.2582137 .

Matousek, Jií, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.”https://doi.org/10.1007/978-3-319-03841-4_41__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-319-03841-4_41 .

cadek, Martin, Marek Krcál, Jií Matousek, Lukás Vokínek, and Uli Wagner. “Extending Continuous Maps: Polynomiality and Undecidability.”https://doi.org/10.1145/2488608.2488683__In 45th Annual ACM Symposium on Theory of Computing, 595–604. ACM, 2013.https://doi.org/10.1145/2488608.2488683 .