The 2-Genus of Kuratowski minors
R. Fulek, J. Kyndl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14.

Thrackles: An improved upper bound
R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.

Shellability is NP-complete
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.

On the treewidth of triangulated 3-manifolds
K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Computing simplicial representatives of homotopy group elements
M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.

Crossing minimization in perturbed drawings
R. Fulek, C.D. Tóth, in:, Springer, 2018, pp. 229–241.

Embeddability in the 3-Sphere is decidable
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, Journal of the ACM 65 (2018).

Recognizing weak embeddings of graphs
H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292.

Proving the existence of loops in robot trajectories
S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.

Any cyclic quadrilateral can be inscribed in any closed convex smooth curve
A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).

On expansion and topological overlap
D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.

Hanani-Tutte for radial planarity
R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.

Finding non-orientable surfaces in 3-Manifolds
B. Burton, A.N. de Mesmay, U. Wagner, Discrete &; Computational Geometry 58 (2017) 871–888.

Persistence of zero sets
P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.

On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result
X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866.

Embedding graphs into embedded graphs
R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Topological data analysis with Bregman divergences
H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916.

On the nonexistence of k reptile simplices in d^3 and d^4
J. Kyndl, Z. Patakova, The Electronic Journal of Combinatorics 24 (2017) 1–44.

Unified Hanani Tutte theorem
R. Fulek, J. Kyndl, D. Pálvölgyi, Electronic Journal of Combinatorics 24 (2017).

A proof of the orbit conjecture for flipping edge labelled triangulations
A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Algorithmic solvability of the lifting extension problem
M. cadek, M. Krcál, L. Vokínek, Discrete &; Computational Geometry 54 (2017) 915–965.

On the existence of ordinary triangles
R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, M. Szedlák, Computational Geometry: Theory and Applications 66 (2017) 28–31.

C-planarity of embedded cyclic c-graphs
R. Fulek, Computational Geometry: Theory and Applications 66 (2017) 1–13.

Bounding helly numbers via betti numbers
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J. Nesetil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, Springer, 2017, pp. 407–447.

Computation of cubical Steenrod squares
M. Krcál, P. Pilarczyk, in:, Springer, 2016, pp. 140–151.

On eigenvalues of random complexes
A. Gundert, U. Wagner, Israel Journal of Mathematics 216 (2016) 545–582.

Bounded embeddings of graphs in the plane
R. Fulek, in:, Springer, 2016, pp. 31–42.

Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range
I. Mabillard, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 2016, p. 51.1-51.12.

On computability and triviality of well groups
P. Franek, M. Krcál, Discrete &; Computational Geometry 56 (2016) 126–164.

The classification of certain linked 3-manifolds in 6-space
S. Avvakumov, Moscow Mathematical Journal 16 (2016) 1–25.

On topological minors in random simplicial complexes
A. Gundert, U. Wagner, Proceedings of the American Mathematical Society 144 (2016) 1815–1828.

Hanani-Tutte for radial planarity II
R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2016, pp. 468–481.

Untangling two systems of noncrossing curves
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, Israel Journal of Mathematics 212 (2016) 37–79.

Finding non-orientable surfaces in 3-manifolds
B. Burton, A.N. de Mesmay, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016, p. 24.1-24.15.

Eliminating higher-multiplicity intersections: an r-fold Whitney trick for the topological Tverberg conjecture
I. Mabillard, Eliminating Higher-Multiplicity Intersections: An r-Fold Whitney Trick for the Topological Tverberg Conjecture, Institute of Science and Technology Austria, 2016.

C-planarity of embedded cyclic c-graphs
R. Fulek, in:, Springer, 2016, pp. 94–106.

On expansion and topological overlap
D. Dotterrer, T. Kaufman, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016, p. 35.1-35.10.

On computability and triviality of well groups
P. Franek, M. Krcál, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–856.

Hanani-Tutte for radial planarity
R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2015, pp. 99–110.

Vertical visibility among parallel polygons in three dimensions
R. Fulek, R. Radoidi, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 373–379.

Clustered planarity testing revisited
R. Fulek, J. Kyndl, I. Malinovid, D. Pálvölgyi, Electronic Journal of Combinatorics 22 (2015).

A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.

Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
R. Karasev, J. Kyndl, P. Paták, Z. Patakova, M. Tancer, Discrete &; Computational Geometry 54 (2015) 610–636.

Robust satisfiability of systems of equations
P. Franek, M. Krcál, Journal of the ACM 62 (2015).

Discrete systolic inequalities and decompositions of triangulated surfaces
É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete &; Computational Geometry 53 (2015) 587–620.

On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result
X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–490.

Eliminating higher-multiplicity intersections, III. Codimension 2
S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).

Bounding Helly numbers via Betti numbers
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–521.

Clustered planarity testing revisited
R. Fulek, J. Kyndl, I. Malinovi, D. Pálvölgyi, in:, International Symposium on Graph Drawing, Springer Nature, Cham, 2014, pp. 428–436.

On the geometric ramsey number of outerplanar graphs
J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &; Computational Geometry 53 (2014) 64–79.

On Gromov's method of selecting heavily covered points
J. Matousek, U. Wagner, Discrete &; Computational Geometry 52 (2014) 1–33.

Computing all maps into a sphere
M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, U. Wagner, Journal of the ACM 61 (2014).

Playful Math - An introduction to mathematical games
K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.

Eliminating Tverberg points, I. An analogue of the Whitney trick
I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180.

Embeddability in the 3 sphere is decidable
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84.

Untangling two systems of noncrossing curves
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.

Extending continuous maps: Polynomiality and undecidability
M. cadek, M. Krcál, J. Matousek, L. Vokínek, U. Wagner, in:, 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604.