Filakovský, Marek, and Lukas Vokínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.”https://doi.org/10.1007/s10208-019-09419-x__Foundations of Computational Mathematics. Springer Nature, 2020.https://doi.org/10.1007/s10208-019-09419-x .

Kalai, Gil, and Zuzana Patakova. “Intersection Patterns of Planar Sets.”https://doi.org/10.1007/s00454-020-00205-z__Discrete and Computational Geometry. Springer Nature, 2020.https://doi.org/10.1007/s00454-020-00205-z .

Arroyo Guevara, Alan M, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, and Tilo Wiedera. “Inserting One Edge into a Simple Drawing Is Hard.”https://doi.org/10.1007/978-3-030-60440-0_26__In Graph-Theoretic Concepts in Computer Science, 12301:325–38. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-60440-0_26 .

Masárová, Zuzana. “Reconfiguration Problems.”https://doi.org/10.15479/AT:ISTA:7944__Institute of Science and Technology Austria, 2020.https://doi.org/10.15479/AT:ISTA:7944 .

Huszár, Kristóf. “Combinatorial Width Parameters for 3-Dimensional Manifolds.”https://doi.org/10.15479/AT:ISTA:8032__Institute of Science and Technology Austria, 2020.https://doi.org/10.15479/AT:ISTA:8032 .

Avvakumov, Sergey. “Topological Methods in Geometry and Discrete Mathematics.”https://doi.org/10.15479/AT:ISTA:8156__Institute of Science and Technology Austria, 2020.https://doi.org/10.15479/AT:ISTA:8156 .

Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020.

Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.”https://doi.org/10.4230/LIPICS.SOCG.2019.39__In 35th International Symposium on Computational Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.SOCG.2019.39 .

Chaplick, Steven, Radoslav Fulek, and Pavel Klavík. “Extending Partial Representations of Circle Graphs.”https://doi.org/10.1002/jgt.22436__Journal of Graph Theory. Wiley, 2019.https://doi.org/10.1002/jgt.22436 .

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”https://doi.org/10.1016/j.dam.2018.12.025__Discrete Applied Mathematics. Elsevier, 2019.https://doi.org/10.1016/j.dam.2018.12.025 .

Silva, André , Alan M Arroyo Guevara, Bruce Richter, and Orlando Lee. “Graphs with at Most One Crossing.”https://doi.org/10.1016/j.disc.2019.06.031__Discrete Mathematics. Elsevier, 2019.https://doi.org/10.1016/j.disc.2019.06.031 .

Fulek, Radoslav, and Jan Kyndl. “Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.”https://doi.org/10.1007/s00493-019-3905-7__Combinatorica. Springer Nature, 2019.https://doi.org/10.1007/s00493-019-3905-7 .

Goaoc, Xavier, Pavel Patak, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete.”https://doi.org/10.1145/3314024__Journal of the ACM. ACM, 2019.https://doi.org/10.1145/3314024 .

Arroyo Guevara, Alan M, Martin Derka, and Irene Parada. “Extending Simple Drawings.”https://doi.org/10.1007/978-3-030-35802-0_18__In 27th International Symposium on Graph Drawing and Network Visualization, 11904:230–43. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-35802-0_18 .

Zhechev, Stephan Y. “Algorithmic Aspects of Homotopy Theory and Embeddability.”https://doi.org/10.15479/AT:ISTA:6681__Institute of Science and Technology Austria, 2019.https://doi.org/10.15479/AT:ISTA:6681 .

Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv. arXiv, n.d.

Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.”https://doi.org/10.48550/arXiv.1907.11183__ArXiv, n.d.https://doi.org/10.48550/arXiv.1907.11183 .

Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.”https://doi.org/10.1007/s00454-018-0035-8__Discrete &; Computational Geometry. Springer Nature, 2019.https://doi.org/10.1007/s00454-018-0035-8 .

Huszár, Kristóf, and Jonathan Spreer. “-Manifold Triangulations with Small Treewidth.”https://doi.org/10.4230/LIPIcs.SoCG.2019.44__In 35th International Symposium on Computational Geometry, 129:44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPIcs.SoCG.2019.44 .

Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of Triangulated 3-Manifolds.”https://doi.org/10.20382/JOGC.V10I2A5__Journal of Computational Geometry. Computational Geometry Laborartoy, 2019.https://doi.org/10.20382/JOGC.V10I2A5 .

Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv. arXiv, n.d.

Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs.”https://doi.org/10.1145/3344549__ACM Transactions on Algorithms. ACM, 2019.https://doi.org/10.1145/3344549 .

Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.”https://doi.org/10.4230/LIPICS.SOCG.2019.38__In 35th International Symposium on Computational Geometry, 129:38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.SOCG.2019.38 .

Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” ArXiv, n.d.

Fulek, Radoslav, and Jan Kyndl. “Hanani-Tutte for Approximating Maps of Graphs,”https://doi.org/10.4230/LIPIcs.SoCG.2018.39__Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.SoCG.2018.39 .

Fulek, Radoslav, and Jan Kyndl. “The 2-Genus of Kuratowski Minors,”https://doi.org/10.4230/LIPIcs.SoCG.2018.40__99:40.1-40.14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.SoCG.2018.40 .

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,”https://doi.org/10.1007/978-3-319-73915-1_14__10692:160–66. Springer, 2018.https://doi.org/10.1007/978-3-319-73915-1_14 .

Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete,”https://doi.org/10.4230/LIPIcs.SoCG.2018.41__99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.SoCG.2018.41 .

Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of Triangulated 3-Manifolds,”https://doi.org/10.4230/LIPIcs.SoCG.2018.46__Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.SoCG.2018.46 .

Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.”https://doi.org/10.1007/s41468-018-0021-5__Journal of Applied and Computational Topology. Springer, 2018.https://doi.org/10.1007/s41468-018-0021-5 .

Fulek, Radoslav, and Csaba D. Tóth. “Crossing Minimization in Perturbed Drawings,”https://doi.org/10.1007/978-3-030-04414-5_16__11282:229–41. Springer, 2018.https://doi.org/10.1007/978-3-030-04414-5_16 .

Matousek, Jií, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3-Sphere Is Decidable.”https://doi.org/10.1145/3078632__Journal of the ACM. ACM, 2018.https://doi.org/10.1145/3078632 .

Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs,”https://doi.org/10.1137/1.9781611975031.20__274–92. ACM, 2018.https://doi.org/10.1137/1.9781611975031.20 .

Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the Existence of Loops in Robot Trajectories.”https://doi.org/10.1177/0278364918808367__The International Journal of Robotics Research. SAGE Publications, 2018.https://doi.org/10.1177/0278364918808367 .

Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.”https://doi.org/10.1017/fms.2018.7__Forum of Mathematics, Sigma. Cambridge University Press, 2018.https://doi.org/10.1017/fms.2018.7 .

Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap.”https://doi.org/10.1007/s10711-017-0291-4__Geometriae Dedicata. Springer, 2018.https://doi.org/10.1007/s10711-017-0291-4 .

Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.”https://doi.org/10.7155/jgaa.00408__Journal of Graph Algorithms and Applications. Brown University, 2017.https://doi.org/10.7155/jgaa.00408 .

Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.”https://doi.org/10.1007/s00454-017-9900-0__Discrete &; Computational Geometry. Springer, 2017.https://doi.org/10.1007/s00454-017-9900-0 .

Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.”https://doi.org/10.4310/HHA.2017.v19.n2.a16__Homology, Homotopy and Applications. International Press, 2017.https://doi.org/10.4310/HHA.2017.v19.n2.a16 .

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.1007/s11856-017-1607-7__Israel Journal of Mathematics. Springer, 2017.https://doi.org/10.1007/s11856-017-1607-7 .

Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,”https://doi.org/10.4230/LIPICS.ISAAC.2017.34__Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPICS.ISAAC.2017.34 .

Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,”https://doi.org/10.4230/LIPIcs.SoCG.2017.39__77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.SoCG.2017.39 .

Kyndl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices in d^3 and d^4.” The Electronic Journal of Combinatorics. International Press, 2017.

Fulek, Radoslav, Jan Kyndl, and Dömötör Pálvölgyi. “Unified Hanani Tutte Theorem.”https://doi.org/10.37236/6663__Electronic Journal of Combinatorics. International Press, 2017.https://doi.org/10.37236/6663 .

Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations,”https://doi.org/10.4230/LIPIcs.SoCG.2017.49__Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.SoCG.2017.49 .

cadek, Martin, Marek Krcál, and Lukás Vokínek. “Algorithmic Solvability of the Lifting Extension Problem.”https://doi.org/10.1007/s00454-016-9855-6__Discrete &; Computational Geometry. Springer, 2017.https://doi.org/10.1007/s00454-016-9855-6 .

Fulek, Radoslav, Hossein Mojarrad, Márton Naszódi, József Solymosi, Sebastian Stich, and May Szedlák. “On the Existence of Ordinary Triangles.”https://doi.org/10.1016/j.comgeo.2017.07.002__Computational Geometry: Theory and Applications. Elsevier, 2017.https://doi.org/10.1016/j.comgeo.2017.07.002 .

Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.”https://doi.org/10.1016/j.comgeo.2017.06.016__Computational Geometry: Theory and Applications. Elsevier, 2017.https://doi.org/10.1016/j.comgeo.2017.06.016 .

Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers.”https://doi.org/10.1007/978-3-319-44479-6_17__In A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, edited by Martin Loebl, Jaroslav Nesetil, and Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017.https://doi.org/10.1007/978-3-319-44479-6_17 .

Krcál, Marek, and Pawel Pilarczyk. “Computation of Cubical Steenrod Squares,”https://doi.org/10.1007/978-3-319-39441-1_13__9667:140–51. Springer, 2016.https://doi.org/10.1007/978-3-319-39441-1_13 .

Gundert, Anna, and Uli Wagner. “On Eigenvalues of Random Complexes.”https://doi.org/10.1007/s11856-016-1419-1__Israel Journal of Mathematics. Springer, 2016.https://doi.org/10.1007/s11856-016-1419-1 .

Fulek, Radoslav. “Bounded Embeddings of Graphs in the Plane,”https://doi.org/10.1007/978-3-319-44543-4_3__9843:31–42. Springer, 2016.https://doi.org/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,”https://doi.org/10.4230/LIPIcs.SoCG.2016.51__51:51.1-51.12. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 2016.https://doi.org/10.4230/LIPIcs.SoCG.2016.51 .

Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.”https://doi.org/10.1007/s00454-016-9794-2__Discrete &; Computational Geometry. Springer, 2016.https://doi.org/10.1007/s00454-016-9794-2 .

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

Gundert, Anna, and Uli Wagner. “On Topological Minors in Random Simplicial Complexes.”https://doi.org/10.1090/proc/12824__Proceedings of the American Mathematical Society. American Mathematical Society, 2016.https://doi.org/10.1090/proc/12824 .

Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity II,”https://doi.org/10.1007/978-3-319-50106-2_36__9801:468–81. Springer, 2016.https://doi.org/10.1007/978-3-319-50106-2_36 .

Matousek, Jií, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.”https://doi.org/10.1007/s11856-016-1294-9__Israel Journal of Mathematics. Springer, 2016.https://doi.org/10.1007/s11856-016-1294-9 .

Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds,”https://doi.org/10.4230/LIPIcs.SoCG.2016.24__51:24.1-24.15. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016.https://doi.org/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,”https://doi.org/10.1007/978-3-319-50106-2_8__9801:94–106. Springer, 2016.https://doi.org/10.1007/978-3-319-50106-2_8 .

Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap,”https://doi.org/10.4230/LIPIcs.SoCG.2016.35__51:35.1-35.10. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016.https://doi.org/10.4230/LIPIcs.SoCG.2016.35 .

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

Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity,”https://doi.org/10.1007/978-3-319-27261-0_9__9411:99–110. Springer, 2015.https://doi.org/10.1007/978-3-319-27261-0_9 .

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

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 .