Clustered planarity testing revisited
R. Fulek, J. Kyndl, I. Malinovid, D. Pálvölgyi, Electronic Journal of Combinatorics 22 (2015).

A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.

Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
R. Karasev, J. Kyndl, P. Paták, Z. Patakova, M. Tancer, Discrete &; Computational Geometry 54 (2015) 610–636.

Robust satisfiability of systems of equations
P. Franek, M. Krcál, Journal of the ACM 62 (2015).

Discrete systolic inequalities and decompositions of triangulated surfaces
É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete &; Computational Geometry 53 (2015) 587–620.

On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result
X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–490.

Eliminating higher-multiplicity intersections, III. Codimension 2
S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).

Bounding Helly numbers via Betti numbers
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–521.

Clustered planarity testing revisited
R. Fulek, J. Kyndl, I. Malinovi, D. Pálvölgyi, in:, International Symposium on Graph Drawing, Springer Nature, Cham, 2014, pp. 428–436.

On the geometric ramsey number of outerplanar graphs
J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &; Computational Geometry 53 (2014) 64–79.

On Gromov's method of selecting heavily covered points
J. Matousek, U. Wagner, Discrete &; Computational Geometry 52 (2014) 1–33.

Computing all maps into a sphere
M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, U. Wagner, Journal of the ACM 61 (2014).

Playful Math - An introduction to mathematical games
K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.

Eliminating Tverberg points, I. An analogue of the Whitney trick
I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180.

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

Untangling two systems of noncrossing curves
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.

Extending continuous maps: Polynomiality and undecidability
M. cadek, M. Krcál, J. Matousek, L. Vokínek, U. Wagner, in:, 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604.