Avvakumov, S., Karasev, R., &; Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. arXiv. arXiv.

Akitaya, H., Fulek, R., &; Tóth, C. (2019). Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. ACM.https://doi.org/10.1145/3344549 

Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., &; Wagner, U. (2019). The crossing Tverberg theorem. In 35th International Symposium on Computational Geometry (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.SOCG.2019.38 

Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D.,  Turcotte, A. (n.d.). Token swapping on trees. arXiv.

Fulek, R., &; Kyndl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). 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.39 

Fulek, R., &; Kyndl, J. (2018). The 2-Genus of Kuratowski minors (Vol. 99, p. 40.1-40.14). 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.40 

Fulek, R., &; Pach, J. (2018). Thrackles: An improved upper bound (Vol. 10692, pp. 160–166). Presented at the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States: Springer.https://doi.org/10.1007/978-3-319-73915-1_14 

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 

Huszár, K., Spreer, J., &; Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (Vol. 99). 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.46 

Filakovský, M., Franek, P., Wagner, U., &; Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer.https://doi.org/10.1007/s41468-018-0021-5 

Fulek, R., &; Tóth, C. D. (2018). Crossing minimization in perturbed drawings (Vol. 11282, pp. 229–241). Presented at the Graph Drawing and Network Visualization, Barcelona, Spain: Springer.https://doi.org/10.1007/978-3-030-04414-5_16 

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 

Akitaya, H., Fulek, R., &; Tóth, C. (2018). Recognizing weak embeddings of graphs (pp. 274–292). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA: ACM.https://doi.org/10.1137/1.9781611975031.20 

Rohou, S., Franek, P., Aubry, C., &; Jaulin, L. (2018). Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. SAGE Publications.https://doi.org/10.1177/0278364918808367 

Akopyan, A., &; Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge University Press.https://doi.org/10.1017/fms.2018.7 

Dotterrer, D., Kaufman, T., &; Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer.https://doi.org/10.1007/s10711-017-0291-4 

Fulek, R., Pelsmajer, M., &; Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University.https://doi.org/10.7155/jgaa.00408 

Burton, B., de Mesmay, A. N., &; Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-017-9900-0 

Franek, P., &; Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press.https://doi.org/10.4310/HHA.2017.v19.n2.a16 

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 

Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ISAAC.2017.34 

Edelsbrunner, H., &; Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2017.39 

Kyndl, J., &; Patakova, Z. (2017). On the nonexistence of k reptile simplices in d^3 and d^4. The Electronic Journal of Combinatorics. International Press.

Fulek, R., Kyndl, J., &; Pálvölgyi, D. (2017). Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. International Press.https://doi.org/10.37236/6663 

Lubiw, A., Masárová, Z., &; Wagner, U. (2017). A proof of the orbit conjecture for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2017.49 

cadek, M., Krcál, M., &; Vokínek, L. (2017). Algorithmic solvability of the lifting extension problem. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-016-9855-6 

Fulek, R., Mojarrad, H., Naszódi, M., Solymosi, J., Stich, S., &; Szedlák, M. (2017). On the existence of ordinary triangles. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2017.07.002 

Fulek, R. (2017). C-planarity of embedded cyclic c-graphs. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2017.06.016 

Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2017). Bounding helly numbers via betti numbers. In M. Loebl, J. Nesetil, &; R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp. 407–447). Springer.https://doi.org/10.1007/978-3-319-44479-6_17 

Krcál, M., &; Pilarczyk, P. (2016). Computation of cubical Steenrod squares (Vol. 9667, pp. 140–151). Presented at the CTIC: Computational Topology in Image Context, Marseille, France: Springer.https://doi.org/10.1007/978-3-319-39441-1_13 

Gundert, A., &; Wagner, U. (2016). On eigenvalues of random complexes. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-016-1419-1 

Fulek, R. (2016). Bounded embeddings of graphs in the plane (Vol. 9843, pp. 31–42). Presented at the IWOCA: International Workshop on Combinatorial Algorithms, Helsinki, Finland: Springer.https://doi.org/10.1007/978-3-319-44543-4_3 

Mabillard, I., &; Wagner, U. (2016). Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range (Vol. 51, p. 51.1-51.12). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH.https://doi.org/10.4230/LIPIcs.SoCG.2016.51 

Franek, P., &; Krcál, M. (2016). On computability and triviality of well groups. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-016-9794-2 

Avvakumov, S. (2016). The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. Independent University of Moscow.https://doi.org/10.17323/1609-4514-2016-16-1-1-25 

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