Gundert, A., &; Wagner, U. (2016). On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. American Mathematical Society.https://doi.org/10.1090/proc/12824 

Fulek, R., Pelsmajer, M., &; Schaefer, M. (2016). Hanani-Tutte for radial planarity II (Vol. 9801, pp. 468–481). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer.https://doi.org/10.1007/978-3-319-50106-2_36 

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 

Burton, B., de Mesmay, A. N., &; Wagner, U. (2016). Finding non-orientable surfaces in 3-manifolds (Vol. 51, p. 24.1-24.15). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.https://doi.org/10.4230/LIPIcs.SoCG.2016.24 

Mabillard, I. (2016). Eliminating higher-multiplicity intersections: an r-fold Whitney trick for the topological Tverberg conjecture. Institute of Science and Technology Austria.

Fulek, R. (2016). C-planarity of embedded cyclic c-graphs (Vol. 9801, pp. 94–106). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer.https://doi.org/10.1007/978-3-319-50106-2_8 

Dotterrer, D., Kaufman, T., &; Wagner, U. (2016). On expansion and topological overlap (Vol. 51, p. 35.1-35.10). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.https://doi.org/10.4230/LIPIcs.SoCG.2016.35 

Franek, P., &; Krcál, M. (2015). On computability and triviality of well groups (Vol. 34, pp. 842–856). 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.842 

Fulek, R., Pelsmajer, M., &; Schaefer, M. (2015). Hanani-Tutte for radial planarity (Vol. 9411, pp. 99–110). Presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA, USA: Springer.https://doi.org/10.1007/978-3-319-27261-0_9 

Fulek, R., &; Radoidi, R. (2015). Vertical visibility among parallel polygons in three dimensions. In Graph Drawing and Network Visualization (Vol. 9411, pp. 373–379). Los Angeles, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-319-27261-0_31 

Fulek, R., Kyndl, J., Malinovid, I., &; Pálvölgyi, D. (2015). Clustered planarity testing revisited. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics.https://doi.org/10.37236/5002 

Cohen Addad, V., &; de Mesmay, A. N. (2015). A fixed parameter tractable approximation scheme for the optimal cut graph of a surface (Vol. 9294, pp. 386–398). Presented at the ESA: European Symposium on Algorithms, Patras, Greece: Springer.https://doi.org/10.1007/978-3-662-48350-3_33 

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 

Franek, P., &; Krcál, M. (2015). Robust satisfiability of systems of equations. Journal of the ACM. ACM.https://doi.org/10.1145/2751524 

Colin De Verdière, É., Hubard, A., &; de Mesmay, A. N. (2015). Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-015-9679-9 

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 

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

Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2015). Bounding Helly numbers via Betti numbers (Vol. 34, pp. 507–521). 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.507 

Fulek, R., Kyndl, J., Malinovi, I., &; Pálvölgyi, D. (2014). Clustered planarity testing revisited. In International Symposium on Graph Drawing (Vol. 8871, pp. 428–436). Cham: Springer Nature.https://doi.org/10.1007/978-3-662-45803-7_36 

Cibulka, J., Gao, P., Krcál, M., Valla, T., &; Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-014-9646-x 

Matousek, J., &; Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-014-9584-7 

cadek, M., Krcál, M., Matousek, J., Sergeraert, F., Vokínek, L., &; Wagner, U. (2014). Computing all maps into a sphere. Journal of the ACM. ACM.https://doi.org/10.1145/2597629 

Huszár, K., &; Rolinek, M. (n.d.). Playful Math - An introduction to mathematical games. IST Austria.

Mabillard, I., &; Wagner, U. (2014). Eliminating Tverberg points, I. An analogue of the Whitney trick. In Proceedings of the Annual Symposium on Computational Geometry (pp. 171–180). Kyoto, Japan: ACM.https://doi.org/10.1145/2582112.2582134 

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 

cadek, M., Krcál, M., Matousek, J., Vokínek, L., &; Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. In 45th Annual ACM Symposium on theory of computing (pp. 595–604). Palo Alto, CA, United States: ACM.https://doi.org/10.1145/2488608.2488683