Fulek R. C-planarity of embedded cyclic c-graphs. In: Vol 9801. Springer; 2016:94-106. doi: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. On expansion and topological overlap. In: Vol 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing; 2016:35.1-35.10. doi: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. On computability and triviality of well groups. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:842-856. doi: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. Hanani-Tutte for radial planarity. In: Vol 9411. Springer; 2015:99-110. doi: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. Vertical visibility among parallel polygons in three dimensions. In: Graph Drawing and Network Visualization. Vol 9411. Springer Nature; 2015:373-379. doi: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. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 2015;22(4). doi:10.37236/5002
LibreCat: https://research-explorer.ista.ac.at/record/1642
DOI: 10.37236/5002
arXiv: 1305.4519

Cohen Addad V, de Mesmay AN. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. In: Vol 9294. Springer; 2015:386-398. doi: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. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete &; Computational Geometry. 2015;54(3):610-636. doi: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. Robust satisfiability of systems of equations. Journal of the ACM. 2015;62(4). doi:10.1145/2751524
LibreCat: https://research-explorer.ista.ac.at/record/1682
DOI: 10.1145/2751524

Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &; Computational Geometry. 2015;53(3):587-620. doi: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. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:476-490. doi: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. 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. Bounding Helly numbers via Betti numbers. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:507-521. doi: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. Clustered planarity testing revisited. In: International Symposium on Graph Drawing. Vol 8871. Cham: Springer Nature; 2014:428-436. doi: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. On the geometric ramsey number of outerplanar graphs. Discrete &; Computational Geometry. 2014;53(1):64-79. doi: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. On Gromov’s method of selecting heavily covered points. Discrete &; Computational Geometry. 2014;52(1):1-33. doi: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. Computing all maps into a sphere. Journal of the ACM. 2014;61(3). doi:10.1145/2597629
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
LibreCat: https://research-explorer.ista.ac.at/record/7038

Mabillard I, Wagner U. Eliminating Tverberg points, I. An analogue of the Whitney trick. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:171-180. doi: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. Embeddability in the 3 sphere is decidable. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:78-84. doi:10.1145/2582112.2582137
LibreCat: https://research-explorer.ista.ac.at/record/2157
DOI: 10.1145/2582112.2582137