M. Filakovský, T. V. Nakajima, J. Oprsal, G. Tasinato, and U. Wagner, “Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs,” in 41st International Symposium on Theoretical Aspects of Computer Science, Clermont-Ferrand, France, 2024, vol. 289.

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” Discrete and Computational Geometry. Springer Nature, 2023.

U. Wagner and P. Wild, “Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 675–717, 2023.

Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” Discrete and Computational Geometry, vol. 68. Springer Nature, pp. 1133–1154, 2022.

U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane,” Discrete &; Computational Geometry, vol. 68, no. 4. Springer Nature, pp. 1227–1284, 2022.

U. Wagner, “High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others),” Bulletin de la Societe Mathematique de France, vol. 438. Societe Mathematique de France, pp. 281–294, 2022.

S. Avvakumov, I. Mabillard, A. B. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections. III. Codimension 2,” Israel Journal of Mathematics, vol. 245. Springer Nature, pp. 501–534, 2021.

M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 767–785.

Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.

U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips),” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.

U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part I: Edge flips),” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 2823–2841.

S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020.

X. Goaoc, P. Patak, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” Journal of the ACM, vol. 66, no. 3. ACM, 2019.

A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge-labelled triangulations,” Discrete &; Computational Geometry, vol. 61, no. 4. Springer Nature, pp. 880–898, 2019.

K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,” Journal of Computational Geometry, vol. 10, no. 2. Computational Geometry Laborartoy, pp. 70–98, 2019.

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 38:1-38:13.

X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 41:1-41:16.

K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.

M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” Journal of Applied and Computational Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3-Sphere is decidable,” Journal of the ACM, vol. 65, no. 1. ACM, 2018.

D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.

B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete &; Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.

X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result,” Israel Journal of Mathematics, vol. 222, no. 2. Springer, pp. 841–866, 2017.

A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia, 2017, vol. 77.

X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly numbers via betti numbers,” in A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, M. Loebl, J. Nesetil, and R. Thomas, Eds. Springer, 2017, pp. 407–447.

A. Gundert and U. Wagner, “On eigenvalues of random complexes,” Israel Journal of Mathematics, vol. 216, no. 2. Springer, pp. 545–582, 2016.

I. Mabillard and U. Wagner, “Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 51.1-51.12.

A. Gundert and U. Wagner, “On topological minors in random simplicial complexes,” Proceedings of the American Mathematical Society, vol. 144, no. 4. American Mathematical Society, pp. 1815–1828, 2016.

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” Israel Journal of Mathematics, vol. 212, no. 1. Springer, pp. 37–79, 2016.

B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 24.1-24.15.

D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 35.1-35.10.

X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 476–490.

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

X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly numbers via Betti numbers,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521.

J. Matousek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” Discrete &; Computational Geometry, vol. 52, no. 1. Springer, pp. 1–33, 2014.

M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.

I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 171–180.

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 78–84.

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.

M. cadek, M. Krcál, J. Matousek, L. Vokínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.

M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, and U. Wagner, “Computing all maps into a sphere,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 1–10.

J. Matousek, M. Tancer, and U. Wagner, “A geometric proof of the colored Tverberg theorem,” Discrete &; Computational Geometry, vol. 47, no. 2. Springer, pp. 245–265, 2012.

D. Chen, P. Morin, and U. Wagner, “Absolute approximation of Tukey depth: Theory and experiments,” Computational Geometry: Theory and Applications, vol. 46, no. 5. Elsevier, pp. 566–573, 2012.

A. Gundert and U. Wagner, “On Laplacians of random complexes,” presented at the SGC: Symposuim on Computational Geometry, 2012, pp. 151–160.

J. Matousek, M. Tancer, and U. Wagner, “Hardness of embedding simplicial complexes in Rd,” Journal of the European Mathematical Society, vol. 13, no. 2. European Mathematical Society, pp. 259–295, 2011.

U. Wagner, “Minors in random and expanding hypergraphs,” presented at the SGC: Symposuim on Computational Geometry, 2011, pp. 351–360.

E. Nevo and U. Wagner, “On the embeddability of skeleta of spheres,” Israel Journal of Mathematics, vol. 174, no. 1. Springer, pp. 381–402, 2010.

K. Buchin, A. Razen, T. Uno, and U. Wagner, “Transforming spanning trees: A lower bound,” Computational Geometry: Theory and Applications, vol. 42, no. 8. Elsevier, pp. 724–730, 2009.

J. Matousek, M. Tancer, and U. Wagner, “Hardness of embedding simplicial complexes in dd,” presented at the SODA: Symposium on Discrete Algorithms, 2009, pp. 855–864.

U. Wagner, “k-Sets and k-facets,” in Surveys on Discrete and Computational Geometry: Twenty Years Later, vol. 453, J. Goodman, J. Pach, and R. Pollack, Eds. American Mathematical Society, 2008, pp. 443–514.

S. Smorodinsky, M. Sulovský, and U. Wagner, “On center regions and balls containing many points,” presented at the COCOON: Conference on Computing and Combinatorics, 2008, vol. 5092, pp. 363–373.

J. Bang Jensen, B. Reed, B. Schacht, R. Sámal, B. Toft, and U. Wagner, “On six problems posed by Jarik Nesetil,” in Topics in Discrete Mathematics, vol. 26, Springer, 2006, pp. 613–627.

K. Chent et al., “Online conflict-free coloring for intervals,” SIAM Journal on Computing, vol. 36, no. 5. SIAM, pp. 1342–1359, 2006.

U. Wagner, “On a geometric generalization of the Upper Bound Theorem,” presented at the FOCS: Foundations of Computer Science, 2006, pp. 635–645.

J. Matousek, M. Sharir, S. Smorodinsky, and U. Wagner, “K-sets in four dimensions,” Discrete &; Computational Geometry, vol. 35, no. 2. Springer, pp. 177–191, 2006.

A. Fiat et al., “Online conflict-free coloring for intervals,” presented at the SODA: Symposium on Discrete Algorithms, 2005, pp. 545–554.

C. Ambühl and U. Wagner, “The Clique problem in intersection graphs of ellipses and triangles,” Theory of Computing Systems, vol. 38, no. 3. Springer, pp. 279–292, 2005.

L. Lovász, K. Vesztergombi, U. Wagner, and E. Welzl, “Convex quadrilaterals and k-sets ,” in Towards a Theory of Geometric Graphs, vol. 342, J. Pach, Ed. American Mathematical Society, 2004, pp. 139–148.

J. Giesen and U. Wagner, “Shape dimension and intrinsic metric from samples of manifolds,” Discrete &; Computational Geometry, vol. 32, no. 2. Springer, pp. 245–267, 2004.

J. Matousek and U. Wagner, “New constructions of weak ;5-nets,” Discrete &; Computational Geometry, vol. 32, no. 2. Springer, pp. 195–206, 2004.

U. Wagner, “On k-Sets and Their Applications,” ETH Zurich, 2003.

J. Giesen and U. Wagner, “Shape dimension and intrinsic metric from samples of manifolds with high co-dimension,” presented at the SoCG: Symposium on Computational Geometry, 2003, pp. 329–337.

J. Matousek and U. Wagner, “New constructions of weak epsilon-nets,” presented at the SoCG: Symposium on Computational Geometry, 2003, pp. 129–135.

U. Wagner, “On the rectilinear crossing number of complete graphs,” presented at the SODA: Symposium on Discrete Algorithms, 2003, pp. 583–588.

C. Ambühl and U. Wagner, “On the Clique problem in intersection graphs of ellipses,” in Proceedings of the 13th International Symposium on Algorithms and Computation, Vancouver, Canada, 2002, vol. 2518, pp. 489–500.

U. Wagner, “On the number of corner cuts,” Advances in Applied Mathematics, vol. 29, no. 2. ACM, pp. 152–161, 2002.

U. Wagner and E. Welzl, “A continuous analogue of the Upper Bound Theorem,” Discrete &; Computational Geometry, vol. 26, no. 2. Springer, pp. 205–219, 2001.

U. Wagner and E. Welzl, “Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem,” in Proceedings of the 16th annual symposium on Computational geometry, Clear Water Bay Kowloon, Hong Kong, 2000, pp. 50–56.