Kaluza, V., &; Tancer, M. (2022). Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. Springer Nature.https://doi.org/10.1007/s00493-021-4443-7 

Patakova, Z., Tancer, M., &; Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.62 

Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.41 

Matousek, J., Sedgwick, E., Tancer, M., &; Wagner, U. (2018). Embeddability in the 3-Sphere is decidable. Journal of the ACM. ACM.https://doi.org/10.1145/3078632 

Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2017). On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-017-1607-7 

Matousek, J., Sedgwick, E., Tancer, M., &; Wagner, U. (2016). Untangling two systems of noncrossing curves. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-016-1294-9 

Karasev, R., Kyndl, J., Paták, P., Patakova, Z., &; Tancer, M. (2015). Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-015-9720-z 

Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2015). On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result (Vol. 34, pp. 476–490). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SOCG.2015.476 

Matousek, J., Sedgwick, E., Tancer, M., &; Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In Proceedings of the Annual Symposium on Computational Geometry (pp. 78–84). Kyoto, Japan: ACM.https://doi.org/10.1145/2582112.2582137 

Matousek, J., Sedgwick, E., Tancer, M., &; Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer.https://doi.org/10.1007/978-3-319-03841-4_41 

Matousek, J., Tancer, M., &; Wagner, U. (2012). A geometric proof of the colored Tverberg theorem. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-011-9368-2 

Matousek, J., Tancer, M., &; Wagner, U. (2011). Hardness of embedding simplicial complexes in Rd. Journal of the European Mathematical Society. European Mathematical Society.https://doi.org/10.4171/JEMS/252 

Matousek, J., Tancer, M., &; Wagner, U. (2009). Hardness of embedding simplicial complexes in dd (pp. 855–864). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.