R. Fulek, “C-planarity of embedded cyclic c-graphs,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 94–106.
LibreCat: https://research-explorer.ista.ac.at/record/1165
DOI: 10.1007/978-3-319-50106-2_8

D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 35.1-35.10.
LibreCat: https://research-explorer.ista.ac.at/record/1378
DOI: 10.4230/LIPIcs.SoCG.2016.35

P. Franek and M. Krcál, “On computability and triviality of well groups,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 842–856.
LibreCat: https://research-explorer.ista.ac.at/record/1510
DOI: 10.4230/LIPIcs.SOCG.2015.842

R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA, USA, 2015, vol. 9411, pp. 99–110.
LibreCat: https://research-explorer.ista.ac.at/record/1595
DOI: 10.1007/978-3-319-27261-0_9

R. Fulek and R. Radoidi, “Vertical visibility among parallel polygons in three dimensions,” in Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015, pp. 373–379.
LibreCat: https://research-explorer.ista.ac.at/record/1596
DOI: 10.1007/978-3-319-27261-0_31

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

V. Cohen Addad and A. N. de Mesmay, “A fixed parameter tractable approximation scheme for the optimal cut graph of a surface,” presented at the ESA: European Symposium on Algorithms, Patras, Greece, 2015, vol. 9294, pp. 386–398.
LibreCat: https://research-explorer.ista.ac.at/record/1685
DOI: 10.1007/978-3-662-48350-3_33

R. Karasev, J. Kyndl, P. Paták, Z. Patakova, and M. Tancer, “Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex,” Discrete &; Computational Geometry, vol. 54, no. 3. Springer, pp. 610–636, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1688
DOI: 10.1007/s00454-015-9720-z

P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” Journal of the ACM, vol. 62, no. 4. ACM, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1682
DOI: 10.1145/2751524

É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities and decompositions of triangulated surfaces,” Discrete &; Computational Geometry, vol. 53, no. 3. Springer, pp. 587–620, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1730
DOI: 10.1007/s00454-015-9679-9

X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 476–490.
LibreCat: https://research-explorer.ista.ac.at/record/1511
DOI: 10.4230/LIPIcs.SOCG.2015.476

S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections, III. Codimension 2,” arXiv. .
LibreCat: https://research-explorer.ista.ac.at/record/8183
arXiv: 1511.03501

X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly numbers via Betti numbers,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521.
LibreCat: https://research-explorer.ista.ac.at/record/1512
DOI: 10.4230/LIPIcs.SOCG.2015.507

R. Fulek, J. Kyndl, I. Malinovi, and D. Pálvölgyi, “Clustered planarity testing revisited,” in International Symposium on Graph Drawing, 2014, vol. 8871, pp. 428–436.
LibreCat: https://research-explorer.ista.ac.at/record/10793
DOI: 10.1007/978-3-662-45803-7_36
arXiv: 1305.4519

J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” Discrete &; Computational Geometry, vol. 53, no. 1. Springer, pp. 64–79, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/1842
DOI: 10.1007/s00454-014-9646-x

J. Matousek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” Discrete &; Computational Geometry, vol. 52, no. 1. Springer, pp. 1–33, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2154
DOI: 10.1007/s00454-014-9584-7

M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2184
DOI: 10.1145/2597629

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

I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 171–180.
LibreCat: https://research-explorer.ista.ac.at/record/2159
DOI: 10.1145/2582112.2582134

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 78–84.
LibreCat: https://research-explorer.ista.ac.at/record/2157
DOI: 10.1145/2582112.2582137