Fulek, Radoslav, Jan Kyndl, Igor Malinovid, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.”https://doi.org/10.37236/5002__Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2015.https://doi.org/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,”https://doi.org/10.1007/978-3-662-48350-3_33__9294:386–98. Springer, 2015.https://doi.org/10.1007/978-3-662-48350-3_33 .

Karasev, Roman, Jan Kyndl, Pavel Paták, Zuzana Patakova, and Martin Tancer. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.”https://doi.org/10.1007/s00454-015-9720-z__Discrete &; Computational Geometry. Springer, 2015.https://doi.org/10.1007/s00454-015-9720-z .

Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.”https://doi.org/10.1145/2751524__Journal of the ACM. ACM, 2015.https://doi.org/10.1145/2751524 .

Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.”https://doi.org/10.1007/s00454-015-9679-9__Discrete &; Computational Geometry. Springer, 2015.https://doi.org/10.1007/s00454-015-9679-9 .

Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type Nonembeddability Result,”https://doi.org/10.4230/LIPIcs.SOCG.2015.476__34:476–90. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.https://doi.org/10.4230/LIPIcs.SOCG.2015.476 .

Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, n.d.

Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers,”https://doi.org/10.4230/LIPIcs.SOCG.2015.507__34:507–21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.https://doi.org/10.4230/LIPIcs.SOCG.2015.507 .

Fulek, Radoslav, Jan Kyndl, Igor Malinovi, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.”https://doi.org/10.1007/978-3-662-45803-7_36__In International Symposium on Graph Drawing, 8871:428–36. Cham: Springer Nature, 2014.https://doi.org/10.1007/978-3-662-45803-7_36 .

Cibulka, Josef, Pu Gao, Marek Krcál, Tomás Valla, and Pavel Valtr. “On the Geometric Ramsey Number of Outerplanar Graphs.”https://doi.org/10.1007/s00454-014-9646-x__Discrete &; Computational Geometry. Springer, 2014.https://doi.org/10.1007/s00454-014-9646-x .

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

cadek, Martin, Marek Krcál, Jií Matousek, Francis Sergeraert, Lukás Vokínek, and Uli Wagner. “Computing All Maps into a Sphere.”https://doi.org/10.1145/2597629__Journal of the ACM. ACM, 2014.https://doi.org/10.1145/2597629 .

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

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

Matousek, Jií, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.”https://doi.org/10.1145/2582112.2582137__In Proceedings of the Annual Symposium on Computational Geometry, 78–84. ACM, 2014.https://doi.org/10.1145/2582112.2582137 .

Matousek, Jií, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.”https://doi.org/10.1007/978-3-319-03841-4_41__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-319-03841-4_41 .

cadek, Martin, Marek Krcál, Jií Matousek, Lukás Vokínek, and Uli Wagner. “Extending Continuous Maps: Polynomiality and Undecidability.”https://doi.org/10.1145/2488608.2488683__In 45th Annual ACM Symposium on Theory of Computing, 595–604. ACM, 2013.https://doi.org/10.1145/2488608.2488683 .