De Nooijer P, Terziadis S, Weinberger A, et al. Removing popular faces in curve arrangements. In: 31st International Symposium on Graph Drawing and Network Visualization. Vol 14466. Springer Nature; 2024:18-33. doi:10.1007/978-3-031-49275-4_2

Filakovský M, Nakajima TV, Oprsal J, Tasinato G, Wagner U. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In: 41st International Symposium on Theoretical Aspects of Computer Science. Vol 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.STACS.2024.34

Lopushanski M, Ivanov G. A constructive algorithm for building rectifiable curves in weakly convex sets. In: AIP Conference Proceedings. Vol 3030. AIP Publishing; 2024. doi:10.1063/5.0195908

Krokhin A, Oprsal J, Wrochna M, divný S. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 2023;52(1):38-79. doi:10.1137/20m1378223

Dymond M, Kaluza V. Highly irregular separated nets. Israel Journal of Mathematics. 2023;253:501-554. doi:10.1007/s11856-022-2448-6

Arroyo Guevara AM, Klute F, Parada I, Vogtenhuber B, Seidel R, Wiedera T. Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. 2023;69:745–770. doi:10.1007/s00454-022-00394-9

Arroyo Guevara AM, Felsner S. Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. 2023;27(6):433-457. doi:10.7155/jgaa.00629

Köse S. Exterior algebra and combinatorics. 2023. doi:10.15479/at:ista:13331

Ivanov G, Köse S. Erds-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. 2023;346(6). doi:10.1016/j.disc.2023.113363

Ivanov G, Naszódi M. Quantitative Steinitz theorem: A polynomial bound. Bulletin of the London Mathematical Society. 2023. doi:10.1112/blms.12965

Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem. Discrete and Computational Geometry. 2023. doi:10.1007/s00454-023-00532-x

Wagner U, Wild P. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 2023;256(2):675-717. doi:10.1007/s11856-023-2521-9

Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. 2023;24(2). doi:10.46298/DMTCS.8383

Ivanov G, Naszódi M. Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. 2023;2023(23):20613-20669. doi:10.1093/imrn/rnad210

Dymond M, Kaluza V. Divergence of separated nets with respect to displacement equivalence. Geometriae Dedicata. 2023. doi:10.1007/s10711-023-00862-3

Brunck FR. Iterated medial triangle subdivision in surfaces of constant curvature. Discrete and Computational Geometry. 2023;70(3):1059-1089. doi:10.1007/s00454-023-00500-5

Krokhin A, Oprsal J. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 2022;9(3):30-59. doi:10.1145/3559736.3559740

Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591

Wild P. High-dimensional expansion and crossing numbers of simplicial complexes. 2022. doi:10.15479/at:ista:11777

Kaluza V, Tancer M. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 2022;42:1317-1345. doi:10.1007/s00493-021-4443-7

Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. Discrete and Computational Geometry. 2022;68:1133-1154. doi:10.1007/s00454-021-00364-7

Ivanov G, Naszódi M. Functional John ellipsoids. Journal of Functional Analysis. 2022;282(11). doi:10.1016/j.jfa.2022.109441

Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane. Discrete &; Computational Geometry. 2022;68(4):1227-1284. doi:10.1007/s00454-022-00436-2

Fulek R, Kyndl J. The Z2-Genus of Kuratowski minors. Discrete and Computational Geometry. 2022;68:425-447. doi:10.1007/s00454-022-00412-w

Arroyo Guevara AM, Felsner S. Approximating the bundled crossing number. In: WALCOM 2022: Algorithms and Computation. Vol 13174. LNCS. Springer Nature; 2022:383-395. doi:10.1007/978-3-030-96731-4_31

Wagner U. High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others). Bulletin de la Societe Mathematique de France. 2022;438:281-294. doi:10.24033/ast.1188

Ivanov G, Naszodi M. A quantitative Helly-type theorem: Containment in a homothet. SIAM Journal on Discrete Mathematics. 2022;36(2):951-957. doi:10.1137/21M1403308

Ivanov G, Lopushanski MS. Rectifiable curves in proximally smooth sets. Set-Valued and Variational Analysis. 2022;30(2):657-675. doi:10.1007/s11228-021-00612-1

Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. In: 15th International Conference on Algorithms and Computation. Vol 12635. Springer Nature; 2021:221-233. doi:10.1007/978-3-030-68211-8_18

Ivanov G. No-dimension Tverberg’s theorem and its corollaries in Banach spaces of type p. Bulletin of the London Mathematical Society. 2021;53(2):631-641. doi:10.1112/blms.12449

Ivanov G. On the volume of projections of the cross-polytope. Discrete Mathematics. 2021;344(5). doi:10.1016/j.disc.2021.112312

Arroyo Guevara AM, Mcquillan D, Richter RB, Salazar G, Sullivan M. Drawings of complete graphs in the projective plane. Journal of Graph Theory. 2021;97(3):426-440. doi:10.1002/jgt.22665

Arroyo Guevara AM, Richter RB, Sunohara M. Extending drawings of complete graphs into arrangements of pseudocircles. SIAM Journal on Discrete Mathematics. 2021;35(2):1050-1076. doi:10.1137/20M1313234

Ivanov G, Tsiutsiurupa I. Functional Löwner ellipsoids. Journal of Geometric Analysis. 2021;31:11493-11528. doi:10.1007/s12220-021-00691-4

Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 2021;245:501–534. doi:10.1007/s11856-021-2216-z

Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 2021;9(1):1-18. doi:10.1515/agms-2020-0103

Ivanov G. Tight frames and related geometric problems. Canadian Mathematical Bulletin. 2021;64(4):942-963. doi:10.4153/s000843952000096x

Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47

Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening flow. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12

Patakova Z. Bounding radon number via Betti numbers. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61

Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62

Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9

Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.67

Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:2823-2841. doi:10.1137/1.9781611975994.172

Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943

Filakovský M, Vokínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x

Kalai G, Patakova Z. Intersection patterns of planar sets. Discrete and Computational Geometry. 2020;64:304-323. doi:10.1007/s00454-020-00205-z

Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. Inserting one edge into a simple drawing is hard. In: Graph-Theoretic Concepts in Computer Science. Vol 12301. Springer Nature; 2020:325-338. doi:10.1007/978-3-030-60440-0_26

Masárová Z. Reconfiguration problems. 2020. doi:10.15479/AT:ISTA:7944

Huszár K. Combinatorial width parameters for 3-dimensional manifolds. 2020. doi:10.15479/AT:ISTA:8032

Avvakumov S. Topological methods in geometry and discrete mathematics. 2020. doi:10.15479/AT:ISTA:8156

Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.

Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In: 35th International Symposium on Computational Geometry (SoCG 2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39

Chaplick S, Fulek R, Klavík P. Extending partial representations of circle graphs. Journal of Graph Theory. 2019;91(4):365-394. doi:10.1002/jgt.22436

Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics. 2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025

Silva A, Arroyo Guevara AM, Richter B, Lee O. Graphs with at most one crossing. Discrete Mathematics. 2019;342(11):3201-3207. doi:10.1016/j.disc.2019.06.031

Fulek R, Kyndl J. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. 2019;39(6):1267-1279. doi:10.1007/s00493-019-3905-7

Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. Journal of the ACM. 2019;66(3). doi:10.1145/3314024

Arroyo Guevara AM, Derka M, Parada I. Extending simple drawings. In: 27th International Symposium on Graph Drawing and Network Visualization. Vol 11904. Springer Nature; 2019:230-243. doi:10.1007/978-3-030-35802-0_18

Zhechev SY. Algorithmic aspects of homotopy theory and embeddability. 2019. doi:10.15479/AT:ISTA:6681

Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv.

Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv. doi:10.48550/arXiv.1907.11183

Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete &; Computational Geometry. 2019;61(4):880-898. doi:10.1007/s00454-018-0035-8

Huszár K, Spreer J. 3-manifold triangulations with small treewidth. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:44:1-44:20. doi:10.4230/LIPIcs.SoCG.2019.44

Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. 2019;10(2):70–98. doi:10.20382/JOGC.V10I2A5

Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv.

Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 2019;15(4). doi:10.1145/3344549

Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:38:1-38:13. doi:10.4230/LIPICS.SOCG.2019.38

Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv.

Fulek R, Kyndl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39

Fulek R, Kyndl J. The 2-Genus of Kuratowski minors. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:40.1-40.14. doi:10.4230/LIPIcs.SoCG.2018.40

Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer; 2018:160-166. doi:10.1007/978-3-319-73915-1_14

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16. doi:10.4230/LIPIcs.SoCG.2018.41

Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.46

Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5

Fulek R, Tóth CD. Crossing minimization in perturbed drawings. In: Vol 11282. Springer; 2018:229-241. doi:10.1007/978-3-030-04414-5_16

Matousek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3-Sphere is decidable. Journal of the ACM. 2018;65(1). doi:10.1145/3078632

Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. In: ACM; 2018:274-292. doi:10.1137/1.9781611975031.20

Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516. doi:10.1177/0278364918808367

Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 2018;6. doi:10.1017/fms.2018.7

Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4

Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408

Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. Discrete &; Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0

Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications. 2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16

Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 2017;222(2):841-866. doi:10.1007/s11856-017-1607-7

Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ISAAC.2017.34

Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916. doi:10.4230/LIPIcs.SoCG.2017.39

Kyndl J, Patakova Z. On the nonexistence of k reptile simplices in d^3 and d^4. The Electronic Journal of Combinatorics. 2017;24(3):1-44.

Fulek R, Kyndl J, Pálvölgyi D. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 2017;24(3). doi:10.37236/6663

Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.SoCG.2017.49

cadek M, Krcál M, Vokínek L. Algorithmic solvability of the lifting extension problem. Discrete &; Computational Geometry. 2017;54(4):915-965. doi:10.1007/s00454-016-9855-6

Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. On the existence of ordinary triangles. Computational Geometry: Theory and Applications. 2017;66:28-31. doi:10.1016/j.comgeo.2017.07.002

Fulek R. C-planarity of embedded cyclic c-graphs. Computational Geometry: Theory and Applications. 2017;66:1-13. doi:10.1016/j.comgeo.2017.06.016

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via betti numbers. In: Loebl M, Nesetil J, Thomas R, eds. A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. A Journey Through Discrete Mathematics. Springer; 2017:407-447. doi:10.1007/978-3-319-44479-6_17

Krcál M, Pilarczyk P. Computation of cubical Steenrod squares. In: Vol 9667. Springer; 2016:140-151. doi:10.1007/978-3-319-39441-1_13

Gundert A, Wagner U. On eigenvalues of random complexes. Israel Journal of Mathematics. 2016;216(2):545-582. doi:10.1007/s11856-016-1419-1

Fulek R. Bounded embeddings of graphs in the plane. In: Vol 9843. Springer; 2016:31-42. doi:10.1007/978-3-319-44543-4_3

Mabillard I, Wagner U. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. In: Vol 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH; 2016:51.1-51.12. doi:10.4230/LIPIcs.SoCG.2016.51

Franek P, Krcál M. On computability and triviality of well groups. Discrete &; Computational Geometry. 2016;56(1):126-164. doi:10.1007/s00454-016-9794-2

Avvakumov S. The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. 2016;16(1):1-25. doi:10.17323/1609-4514-2016-16-1-1-25

Gundert A, Wagner U. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 2016;144(4):1815-1828. doi:10.1090/proc/12824

Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity II. In: Vol 9801. Springer; 2016:468-481. doi:10.1007/978-3-319-50106-2_36

Matousek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. Israel Journal of Mathematics. 2016;212(1):37-79. doi:10.1007/s11856-016-1294-9

Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-manifolds. In: Vol 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing; 2016:24.1-24.15. doi:10.4230/LIPIcs.SoCG.2016.24

Mabillard I. Eliminating higher-multiplicity intersections: an r-fold Whitney trick for the topological Tverberg conjecture. 2016.

Fulek R. C-planarity of embedded cyclic c-graphs. In: Vol 9801. Springer; 2016:94-106. doi:10.1007/978-3-319-50106-2_8

Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. In: Vol 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing; 2016:35.1-35.10. doi:10.4230/LIPIcs.SoCG.2016.35

Franek P, Krcál M. On computability and triviality of well groups. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:842-856. doi:10.4230/LIPIcs.SOCG.2015.842

Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. In: Vol 9411. Springer; 2015:99-110. doi:10.1007/978-3-319-27261-0_9

Fulek R, Radoidi R. Vertical visibility among parallel polygons in three dimensions. In: Graph Drawing and Network Visualization. Vol 9411. Springer Nature; 2015:373-379. doi:10.1007/978-3-319-27261-0_31

Fulek R, Kyndl J, Malinovid I, Pálvölgyi D. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 2015;22(4). doi:10.37236/5002

Cohen Addad V, de Mesmay AN. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. In: Vol 9294. Springer; 2015:386-398. doi:10.1007/978-3-662-48350-3_33

Karasev R, Kyndl J, Paták P, Patakova Z, Tancer M. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete &; Computational Geometry. 2015;54(3):610-636. doi:10.1007/s00454-015-9720-z

Franek P, Krcál M. Robust satisfiability of systems of equations. Journal of the ACM. 2015;62(4). doi:10.1145/2751524

Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &; Computational Geometry. 2015;53(3):587-620. doi:10.1007/s00454-015-9679-9

Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:476-490. doi:10.4230/LIPIcs.SOCG.2015.476

Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv.

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding Helly numbers via Betti numbers. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:507-521. doi:10.4230/LIPIcs.SOCG.2015.507

Fulek R, Kyndl J, Malinovi I, Pálvölgyi D. Clustered planarity testing revisited. In: International Symposium on Graph Drawing. Vol 8871. Cham: Springer Nature; 2014:428-436. doi:10.1007/978-3-662-45803-7_36

Cibulka J, Gao P, Krcál M, Valla T, Valtr P. On the geometric ramsey number of outerplanar graphs. Discrete &; Computational Geometry. 2014;53(1):64-79. doi:10.1007/s00454-014-9646-x

Matousek J, Wagner U. On Gromov’s method of selecting heavily covered points. Discrete &; Computational Geometry. 2014;52(1):1-33. doi:10.1007/s00454-014-9584-7

cadek M, Krcál M, Matousek J, Sergeraert F, Vokínek L, Wagner U. Computing all maps into a sphere. Journal of the ACM. 2014;61(3). doi:10.1145/2597629

Huszár K, Rolinek M. Playful Math - An Introduction to Mathematical Games. IST Austria

Mabillard I, Wagner U. Eliminating Tverberg points, I. An analogue of the Whitney trick. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:171-180. doi:10.1145/2582112.2582134

Matousek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere is decidable. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:78-84. doi:10.1145/2582112.2582137

Matousek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. 2013;8242:472-483. doi:10.1007/978-3-319-03841-4_41

cadek M, Krcál M, Matousek J, Vokínek L, Wagner U. Extending continuous maps: Polynomiality and undecidability. In: 45th Annual ACM Symposium on Theory of Computing. ACM; 2013:595-604. doi:10.1145/2488608.2488683