X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 476–490.

S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections, III. Codimension 2,” arXiv. .

X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly numbers via Betti numbers,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521.

R. Fulek, J. Kyndl, I. Malinovi, and D. Pálvölgyi, “Clustered planarity testing revisited,” in International Symposium on Graph Drawing, 2014, vol. 8871, pp. 428–436.

J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” Discrete &; Computational Geometry, vol. 53, no. 1. Springer, pp. 64–79, 2014.

J. Matousek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” Discrete &; Computational Geometry, vol. 52, no. 1. Springer, pp. 1–33, 2014.

M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.

K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical games. IST Austria.

I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 171–180.

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 78–84.

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.

M. cadek, M. Krcál, J. Matousek, L. Vokínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.