Fulek R, Kyndl J, Malinovid I, Pálvölgyi D. 2015. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 22(4), .24.
LibreCat: https://research-explorer.ista.ac.at/record/1642
DOI: 10.37236/5002
arXiv: 1305.4519

Cohen Addad V, de Mesmay AN. 2015. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. ESA: European Symposium on Algorithms, LNCS, vol. 9294, 386–398.
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. 54(3), 610–636.
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. 62(4), 26.
LibreCat: https://research-explorer.ista.ac.at/record/1682
DOI: 10.1145/2751524

Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &; Computational Geometry. 53(3), 587–620.
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. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 476–490.
LibreCat: https://research-explorer.ista.ac.at/record/1511
DOI: 10.4230/LIPIcs.SOCG.2015.476

Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv, 1511.03501.
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. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.
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. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436.
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. 53(1), 64–79.
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. 52(1), 1–33.
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. 61(3), 17.
LibreCat: https://research-explorer.ista.ac.at/record/2184
DOI: 10.1145/2597629

Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.
LibreCat: https://research-explorer.ista.ac.at/record/7038

Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 171–180.
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. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.
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. 8242, 472–483.
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. 45th Annual ACM Symposium on theory of computing. STOC: Symposium on the Theory of Computing, 595–604.
LibreCat: https://research-explorer.ista.ac.at/record/2807
DOI: 10.1145/2488608.2488683