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.