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 
LibreCat: https://research-explorer.ista.ac.at/record/1073
DOI: 10.1007/s00454-016-9855-6
WoS: 000400072700008

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 
LibreCat: https://research-explorer.ista.ac.at/record/793
DOI: 10.1016/j.comgeo.2017.07.002
WoS: 000412039700003

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 
LibreCat: https://research-explorer.ista.ac.at/record/794
DOI: 10.1016/j.comgeo.2017.06.016
WoS: 000412039700001

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 
LibreCat: https://research-explorer.ista.ac.at/record/424
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1237
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1282
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1348
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1381
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1408
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1522
DOI: 10.17323/1609-4514-2016-16-1-1-25
arXiv: 1408.3918

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 
LibreCat: https://research-explorer.ista.ac.at/record/1523
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1164
DOI: 10.1007/978-3-319-50106-2_36
arXiv: 1608.08662

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 
LibreCat: https://research-explorer.ista.ac.at/record/1411
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1379
DOI: 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.
LibreCat: https://research-explorer.ista.ac.at/record/1123

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 
LibreCat: https://research-explorer.ista.ac.at/record/1165
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1378
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1510
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1595
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1596
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1642
DOI: 10.37236/5002
arXiv: 1305.4519

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 
LibreCat: https://research-explorer.ista.ac.at/record/1685
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1688
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1682
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1730
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1511
DOI: 10.4230/LIPIcs.SOCG.2015.476

Avvakumov, S., Mabillard, I., Skopenkov, A., &; Wagner, U. (n.d.). Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/8183
arXiv: 1511.03501

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 
LibreCat: https://research-explorer.ista.ac.at/record/1512
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/10793
DOI: 10.1007/978-3-662-45803-7_36
arXiv: 1305.4519

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 
LibreCat: https://research-explorer.ista.ac.at/record/1842
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2154
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2184
DOI: 10.1145/2597629

Huszár, K., &; Rolinek, M. (n.d.). Playful Math - An introduction to mathematical games. IST Austria.
LibreCat: https://research-explorer.ista.ac.at/record/7038

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 
LibreCat: https://research-explorer.ista.ac.at/record/2159
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2157
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2244
DOI: 10.1007/978-3-319-03841-4_41
arXiv: 1302.6475

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 
LibreCat: https://research-explorer.ista.ac.at/record/2807
DOI: 10.1145/2488608.2488683