Even maps, the Colin de Verdière number and representations of graphs
V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345.

Barycentric cuts through a convex body

Shellability is NP-complete
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.

Embeddability in the 3-Sphere is decidable
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, Journal of the ACM 65 (2018).

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, Israel Journal of Mathematics 222 (2017) 841–866.

Untangling two systems of noncrossing curves
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, Israel Journal of Mathematics 212 (2016) 37–79.

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.

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.

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.

A geometric proof of the colored Tverberg theorem
J. Matousek, M. Tancer, U. Wagner, Discrete &; Computational Geometry 47 (2012) 245–265.

Hardness of embedding simplicial complexes in Rd
J. Matousek, M. Tancer, U. Wagner, Journal of the European Mathematical Society 13 (2011) 259–295.

Hardness of embedding simplicial complexes in dd
J. Matousek, M. Tancer, U. Wagner, in:, SIAM, 2009, pp. 855–864.