De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.”10.1007/978-3-031-49275-4_2__31st International Symposium on Graph Drawing and Network Visualization, vol. 14466, Springer Nature, 2024, pp. 18–33, doi:10.1007/978-3-031-49275-4_2.

Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.”10.4230/LIPIcs.STACS.2024.34__41st International Symposium on Theoretical Aspects of Computer Science, vol. 289, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.STACS.2024.34.

Lopushanski, Mariana, and Grigory Ivanov. “A Constructive Algorithm for Building Rectifiable Curves in Weakly Convex Sets.”10.1063/5.0195908__AIP Conference Proceedings, vol. 3030, no. 1, 080002, AIP Publishing, 2024, doi:10.1063/5.0195908.

Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.”10.1137/20m1378223__SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial &; Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.

Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.”10.1007/s11856-022-2448-6__Israel Journal of Mathematics, vol. 253, Springer Nature, 2023, pp. 501–54, doi:10.1007/s11856-022-2448-6.

Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.”10.1007/s00454-022-00394-9__Discrete and Computational Geometry, vol. 69, Springer Nature, 2023, pp. 745–770, doi:10.1007/s00454-022-00394-9.

Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.”10.7155/jgaa.00629__Journal of Graph Algorithms and Applications, vol. 27, no. 6, Brown University, 2023, pp. 433–57, doi:10.7155/jgaa.00629.

Köse, Seyda. Exterior Algebra and Combinatorics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13331.

Ivanov, Grigory, and Seyda Köse. “Erds-Ko-Rado and Hilton-Milner Theorems for Two-Forms.”10.1016/j.disc.2023.113363__Discrete Mathematics, vol. 346, no. 6, 113363, Elsevier, 2023, doi:10.1016/j.disc.2023.113363.

Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A Polynomial Bound.”10.1112/blms.12965__Bulletin of the London Mathematical Society, London Mathematical Society, 2023, doi:10.1112/blms.12965.

Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.”10.1007/s00454-023-00532-x__Discrete and Computational Geometry, Springer Nature, 2023, doi:10.1007/s00454-023-00532-x.

Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.”10.1007/s11856-023-2521-9__Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 675–717, doi:10.1007/s11856-023-2521-9.

Biniaz, Ahmad, et al. “Token Swapping on Trees.”10.46298/DMTCS.8383__Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2, 9, EPI Sciences, 2023, doi:10.46298/DMTCS.8383.

Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.”10.1093/imrn/rnad210__International Mathematics Research Notices, vol. 2023, no. 23, Oxford University Press, 2023, pp. 20613–69, doi:10.1093/imrn/rnad210.

Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.”10.1007/s10711-023-00862-3__Geometriae Dedicata, 15, Springer Nature, 2023, doi:10.1007/s10711-023-00862-3.

Brunck, Florestan R. “Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature.”10.1007/s00454-023-00500-5__Discrete and Computational Geometry, vol. 70, no. 3, Springer Nature, 2023, pp. 1059–89, doi:10.1007/s00454-023-00500-5.

Krokhin, Andrei, and Jakub Oprsal. “An Invitation to the Promise Constraint Satisfaction Problem.”10.1145/3559736.3559740__ACM SIGLOG News, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.7155/jgaa.00591__Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.

Wild, Pascal. High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes. Institute of Science and Technology, 2022, doi:10.15479/at:ista:11777.

Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.”10.1007/s00493-021-4443-7__Combinatorica, vol. 42, Springer Nature, 2022, pp. 1317–45, doi:10.1007/s00493-021-4443-7.

Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.”10.1007/s00454-021-00364-7__Discrete and Computational Geometry, vol. 68, Springer Nature, 2022, pp. 1133–54, doi:10.1007/s00454-021-00364-7.

Ivanov, Grigory, and Márton Naszódi. “Functional John Ellipsoids.”10.1016/j.jfa.2022.109441__Journal of Functional Analysis, vol. 282, no. 11, 109441, Elsevier, 2022, doi:10.1016/j.jfa.2022.109441.

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.”10.1007/s00454-022-00436-2__Discrete &; Computational Geometry, vol. 68, no. 4, Springer Nature, 2022, pp. 1227–84, doi:10.1007/s00454-022-00436-2.

Fulek, Radoslav, and Jan Kyndl. “The Z2-Genus of Kuratowski Minors.”10.1007/s00454-022-00412-w__Discrete and Computational Geometry, vol. 68, Springer Nature, 2022, pp. 425–47, doi:10.1007/s00454-022-00412-w.

Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.”10.1007/978-3-030-96731-4_31__WALCOM 2022: Algorithms and Computation, vol. 13174, Springer Nature, 2022, pp. 383–95, doi:10.1007/978-3-030-96731-4_31.

Wagner, Uli. “High-Dimensional Expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and Others).”10.24033/ast.1188__Bulletin de La Societe Mathematique de France, vol. 438, Societe Mathematique de France, 2022, pp. 281–94, doi:10.24033/ast.1188.

Ivanov, Grigory, and Marton Naszodi. “A Quantitative Helly-Type Theorem: Containment in a Homothet.”10.1137/21M1403308__SIAM Journal on Discrete Mathematics, vol. 36, no. 2, Society for Industrial and Applied Mathematics, 2022, pp. 951–57, doi:10.1137/21M1403308.

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.1007/978-3-030-68211-8_18__15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.

Ivanov, Grigory. “No-Dimension Tverberg’s Theorem and Its Corollaries in Banach Spaces of Type P.”10.1112/blms.12449__Bulletin of the London Mathematical Society, vol. 53, no. 2, London Mathematical Society, 2021, pp. 631–41, doi:10.1112/blms.12449.

Ivanov, Grigory. “On the Volume of Projections of the Cross-Polytope.”10.1016/j.disc.2021.112312__Discrete Mathematics, vol. 344, no. 5, 112312, Elsevier, 2021, doi:10.1016/j.disc.2021.112312.

Arroyo Guevara, Alan M., et al. “Drawings of Complete Graphs in the Projective Plane.”10.1002/jgt.22665__Journal of Graph Theory, vol. 97, no. 3, Wiley, 2021, pp. 426–40, doi:10.1002/jgt.22665.

Arroyo Guevara, Alan M., et al. “Extending Drawings of Complete Graphs into Arrangements of Pseudocircles.”10.1137/20M1313234__SIAM Journal on Discrete Mathematics, vol. 35, no. 2, Society for Industrial and Applied Mathematics, 2021, pp. 1050–76, doi:10.1137/20M1313234.

Ivanov, Grigory, and Igor Tsiutsiurupa. “Functional Löwner Ellipsoids.”10.1007/s12220-021-00691-4__Journal of Geometric Analysis, vol. 31, Springer, 2021, pp. 11493–528, doi:10.1007/s12220-021-00691-4.

Ivanov, Grigory, and Mariana S. Lopushanski. “Rectifiable Curves in Proximally Smooth Sets.”10.1007/s11228-021-00612-1__Set-Valued and Variational Analysis, Springer Nature, 2021, doi:10.1007/s11228-021-00612-1.

Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections. III. Codimension 2.”10.1007/s11856-021-2216-z__Israel Journal of Mathematics, vol. 245, Springer Nature, 2021, pp. 501–534, doi:10.1007/s11856-021-2216-z.

Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.”10.1515/agms-2020-0103__Analysis and Geometry in Metric Spaces, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:10.1515/agms-2020-0103.

Ivanov, Grigory. “Tight Frames and Related Geometric Problems.”10.4153/s000843952000096x__Canadian Mathematical Bulletin, vol. 64, no. 4, Canadian Mathematical Society, 2021, pp. 942–63, doi:10.4153/s000843952000096x.

Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.”10.1137/1.9781611975994.47__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.

Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.”10.4230/LIPIcs.SoCG.2020.12__36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.

Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.”10.4230/LIPIcs.SoCG.2020.61__36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.

Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.”10.4230/LIPIcs.SoCG.2020.62__36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.

Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.”10.4230/LIPIcs.SoCG.2020.9__36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).”10.4230/LIPIcs.SoCG.2020.67__36th International Symposium on Computational Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.67.

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).”10.1137/1.9781611975994.172__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 2823–41, doi:10.1137/1.9781611975994.172.

Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.”10.1070/RM9943__Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.

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

Kalai, Gil, and Zuzana Patakova. “Intersection Patterns of Planar Sets.”10.1007/s00454-020-00205-z__Discrete and Computational Geometry, vol. 64, Springer Nature, 2020, pp. 304–23, doi:10.1007/s00454-020-00205-z.

Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.”10.1007/978-3-030-60440-0_26__Graph-Theoretic Concepts in Computer Science, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:10.1007/978-3-030-60440-0_26.

Masárová, Zuzana. Reconfiguration Problems. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7944.

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

Avvakumov, Sergey. Topological Methods in Geometry and Discrete Mathematics. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8156.

Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.

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

Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.”10.1002/jgt.22436__Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”10.1016/j.dam.2018.12.025__Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.

Silva, André, et al. “Graphs with at Most One Crossing.”10.1016/j.disc.2019.06.031__Discrete Mathematics, vol. 342, no. 11, Elsevier, 2019, pp. 3201–07, doi: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.”10.1007/s00493-019-3905-7__Combinatorica, vol. 39, no. 6, Springer Nature, 2019, pp. 1267–79, doi:10.1007/s00493-019-3905-7.

Goaoc, Xavier, et al. “Shellability Is NP-Complete.”10.1145/3314024__Journal of the ACM, vol. 66, no. 3, 21, ACM, 2019, doi:10.1145/3314024.

Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.”10.1007/978-3-030-35802-0_18__27th International Symposium on Graph Drawing and Network Visualization, vol. 11904, Springer Nature, 2019, pp. 230–43, doi:10.1007/978-3-030-35802-0_18.

Zhechev, Stephan Y. Algorithmic Aspects of Homotopy Theory and Embeddability. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6681.

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

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

Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.”10.1007/s00454-018-0035-8__Discrete &; Computational Geometry, vol. 61, no. 4, Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8.

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

Huszár, Kristóf, et al. “On the Treewidth of Triangulated 3-Manifolds.”10.20382/JOGC.V10I2A5__Journal of Computational Geometry, vol. 10, no. 2, Computational Geometry Laborartoy, 2019, pp. 70–98, doi:10.20382/JOGC.V10I2A5.

Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, 1908.08731, arXiv.

Akitaya, Hugo, et al. “Recognizing Weak Embeddings of Graphs.”10.1145/3344549__ACM Transactions on Algorithms, vol. 15, no. 4, 50, ACM, 2019, doi:10.1145/3344549.

Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.”10.4230/LIPICS.SOCG.2019.38__35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38.

Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.

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

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

Fulek, Radoslav, and János Pach. Thrackles: An Improved Upper Bound. Vol. 10692, Springer, 2018, pp. 160–66, doi:10.1007/978-3-319-73915-1_14.

Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41.

Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds. Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.46.

Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.”10.1007/s41468-018-0021-5__Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.

Fulek, Radoslav, and Csaba D. Tóth. Crossing Minimization in Perturbed Drawings. Vol. 11282, Springer, 2018, pp. 229–41, doi:10.1007/978-3-030-04414-5_16.

Matousek, Jií, et al. “Embeddability in the 3-Sphere Is Decidable.”10.1145/3078632__Journal of the ACM, vol. 65, no. 1, 5, ACM, 2018, doi:10.1145/3078632.

Akitaya, Hugo, et al. Recognizing Weak Embeddings of Graphs. ACM, 2018, pp. 274–92, doi:10.1137/1.9781611975031.20.

Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.”10.1177/0278364918808367__The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications, 2018, pp. 1500–16, doi:10.1177/0278364918808367.

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

Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.”10.1007/s10711-017-0291-4__Geometriae Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4.

Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.”10.7155/jgaa.00408__Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408.

Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.”10.1007/s00454-017-9900-0__Discrete &; Computational Geometry, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:10.1007/s00454-017-9900-0.

Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.”10.4310/HHA.2017.v19.n2.a16__Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.

Goaoc, Xavier, et al. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.”10.1007/s11856-017-1607-7__Israel Journal of Mathematics, vol. 222, no. 2, Springer, 2017, pp. 841–66, doi:10.1007/s11856-017-1607-7.

Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34.

Edelsbrunner, Herbert, and Hubert Wagner. Topological Data Analysis with Bregman Divergences. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi: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, vol. 24, no. 3, International Press, 2017, pp. 1–44.

Fulek, Radoslav, et al. “Unified Hanani Tutte Theorem.”10.37236/6663__Electronic Journal of Combinatorics, vol. 24, no. 3, .18, International Press, 2017, doi:10.37236/6663.

Lubiw, Anna, et al. A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.SoCG.2017.49.

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.