cadek, Martin, et al. “Algorithmic Solvability of the Lifting Extension Problem.”10.1007/s00454-016-9855-6__Discrete &; Computational Geometry, vol. 54, no. 4, Springer, 2017, pp. 915–65, doi:10.1007/s00454-016-9855-6.

Fulek, Radoslav, et al. “On the Existence of Ordinary Triangles.”10.1016/j.comgeo.2017.07.002__Computational Geometry: Theory and Applications, vol. 66, Elsevier, 2017, pp. 28–31, doi:10.1016/j.comgeo.2017.07.002.

Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.”10.1016/j.comgeo.2017.06.016__Computational Geometry: Theory and Applications, vol. 66, Elsevier, 2017, pp. 1–13, doi:10.1016/j.comgeo.2017.06.016.

Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.”10.1007/978-3-319-44479-6_17__A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, edited by Martin Loebl et al., Springer, 2017, pp. 407–47, doi:10.1007/978-3-319-44479-6_17.

Krcál, Marek, and Pawel Pilarczyk. Computation of Cubical Steenrod Squares. Vol. 9667, Springer, 2016, pp. 140–51, doi:10.1007/978-3-319-39441-1_13.

Gundert, Anna, and Uli Wagner. “On Eigenvalues of Random Complexes.”10.1007/s11856-016-1419-1__Israel Journal of Mathematics, vol. 216, no. 2, Springer, 2016, pp. 545–82, doi:10.1007/s11856-016-1419-1.

Fulek, Radoslav. Bounded Embeddings of Graphs in the Plane. Vol. 9843, Springer, 2016, pp. 31–42, doi:10.1007/978-3-319-44543-4_3.

Mabillard, Isaac, and Uli Wagner. Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range. Vol. 51, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 2016, p. 51.1-51.12, doi:10.4230/LIPIcs.SoCG.2016.51.

Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.”10.1007/s00454-016-9794-2__Discrete &; Computational Geometry, vol. 56, no. 1, Springer, 2016, pp. 126–64, doi:10.1007/s00454-016-9794-2.

Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.”10.17323/1609-4514-2016-16-1-1-25__Moscow Mathematical Journal, vol. 16, no. 1, Independent University of Moscow, 2016, pp. 1–25, doi:10.17323/1609-4514-2016-16-1-1-25.

Gundert, Anna, and Uli Wagner. “On Topological Minors in Random Simplicial Complexes.”10.1090/proc/12824__Proceedings of the American Mathematical Society, vol. 144, no. 4, American Mathematical Society, 2016, pp. 1815–28, doi:10.1090/proc/12824.

Fulek, Radoslav, et al. Hanani-Tutte for Radial Planarity II. Vol. 9801, Springer, 2016, pp. 468–81, doi:10.1007/978-3-319-50106-2_36.

Matousek, Jií, et al. “Untangling Two Systems of Noncrossing Curves.”10.1007/s11856-016-1294-9__Israel Journal of Mathematics, vol. 212, no. 1, Springer, 2016, pp. 37–79, doi:10.1007/s11856-016-1294-9.

Burton, Benjamin, et al. Finding Non-Orientable Surfaces in 3-Manifolds. Vol. 51, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016, p. 24.1-24.15, doi:10.4230/LIPIcs.SoCG.2016.24.

Mabillard, Isaac. Eliminating Higher-Multiplicity Intersections: An r-Fold Whitney Trick for the Topological Tverberg Conjecture. Institute of Science and Technology Austria, 2016.

Fulek, Radoslav. C-Planarity of Embedded Cyclic c-Graphs. Vol. 9801, Springer, 2016, pp. 94–106, doi:10.1007/978-3-319-50106-2_8.

Dotterrer, Dominic, et al. On Expansion and Topological Overlap. Vol. 51, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016, p. 35.1-35.10, doi:10.4230/LIPIcs.SoCG.2016.35.

Franek, Peter, and Marek Krcál. On Computability and Triviality of Well Groups. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–56, doi:10.4230/LIPIcs.SOCG.2015.842.

Fulek, Radoslav, et al. Hanani-Tutte for Radial Planarity. Vol. 9411, Springer, 2015, pp. 99–110, doi:10.1007/978-3-319-27261-0_9.

Fulek, Radoslav, and Rados Radoidi. “Vertical Visibility among Parallel Polygons in Three Dimensions.”10.1007/978-3-319-27261-0_31__Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015, pp. 373–79, doi:10.1007/978-3-319-27261-0_31.

Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.”10.37236/5002__Electronic Journal of Combinatorics, vol. 22, no. 4, .24, Electronic Journal of Combinatorics, 2015, doi:10.37236/5002.

Cohen Addad, Vincent, and Arnaud N. de Mesmay. A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. Vol. 9294, Springer, 2015, pp. 386–98, doi:10.1007/978-3-662-48350-3_33.

Karasev, Roman, et al. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.”10.1007/s00454-015-9720-z__Discrete &; Computational Geometry, vol. 54, no. 3, Springer, 2015, pp. 610–36, doi:10.1007/s00454-015-9720-z.

Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.”10.1145/2751524__Journal of the ACM, vol. 62, no. 4, 26, ACM, 2015, doi:10.1145/2751524.

Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.”10.1007/s00454-015-9679-9__Discrete &; Computational Geometry, vol. 53, no. 3, Springer, 2015, pp. 587–620, doi:10.1007/s00454-015-9679-9.

Goaoc, Xavier, et al. On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type Nonembeddability Result. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–90, doi:10.4230/LIPIcs.SOCG.2015.476.

Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, 1511.03501.

Goaoc, Xavier, et al. Bounding Helly Numbers via Betti Numbers. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–21, doi:10.4230/LIPIcs.SOCG.2015.507.

Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.”10.1007/978-3-662-45803-7_36__International Symposium on Graph Drawing, vol. 8871, Springer Nature, 2014, pp. 428–36, doi:10.1007/978-3-662-45803-7_36.

Cibulka, Josef, et al. “On the Geometric Ramsey Number of Outerplanar Graphs.”10.1007/s00454-014-9646-x__Discrete &; Computational Geometry, vol. 53, no. 1, Springer, 2014, pp. 64–79, doi:10.1007/s00454-014-9646-x.

Matousek, Jií, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.”10.1007/s00454-014-9584-7__Discrete &; Computational Geometry, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:10.1007/s00454-014-9584-7.

cadek, Martin, et al. “Computing All Maps into a Sphere.”10.1145/2597629__Journal of the ACM, vol. 61, no. 3, 17, ACM, 2014, doi:10.1145/2597629.

Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria.

Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.”10.1145/2582112.2582134__Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–80, doi:10.1145/2582112.2582134.

Matousek, Jií, et al. “Embeddability in the 3 Sphere Is Decidable.”10.1145/2582112.2582137__Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84, doi:10.1145/2582112.2582137.

Matousek, Jií, et al. Untangling Two Systems of Noncrossing Curves. Vol. 8242, Springer, 2013, pp. 472–83, doi:10.1007/978-3-319-03841-4_41.

cadek, Martin, et al. “Extending Continuous Maps: Polynomiality and Undecidability.”10.1145/2488608.2488683__45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604, doi:10.1145/2488608.2488683.