Filakovský M, Nakajima TV, Oprsal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34.

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

Wagner U, Wild P. 2023. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 256(2), 675–717.

Patakova Z, Tancer M, Wagner U. 2022. Barycentric cuts through a convex body. Discrete and Computational Geometry. 68, 1133–1154.

Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the plane. Discrete &; Computational Geometry. 68(4), 1227–1284.

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

Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. 2021. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 245, 501–534.

Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.

Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 62:1-62:16.

Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 67:1-67:16.

Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 2823–2841.

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

Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. 2019. Shellability is NP-complete. Journal of the ACM. 66(3), 21.

Lubiw A, Masárová Z, Wagner U. 2019. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete &; Computational Geometry. 61(4), 880–898.

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

Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2019. The crossing Tverberg theorem. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 38:1-38:13.

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16.

Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.

Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.

Matousek J, Sedgwick E, Tancer M, Wagner U. 2018. Embeddability in the 3-Sphere is decidable. Journal of the ACM. 65(1), 5.

Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.

Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete &; Computational Geometry. 58(4), 871–888.

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

Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 77, 49.

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. , 407–447.

Gundert A, Wagner U. 2016. On eigenvalues of random complexes. Israel Journal of Mathematics. 216(2), 545–582.

Mabillard I, Wagner U. 2016. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 51.1-51.12.

Gundert A, Wagner U. 2016. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 144(4), 1815–1828.

Matousek J, Sedgwick E, Tancer M, Wagner U. 2016. Untangling two systems of noncrossing curves. Israel Journal of Mathematics. 212(1), 37–79.

Burton B, de Mesmay AN, Wagner U. 2016. Finding non-orientable surfaces in 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 24.1-24.15.

Dotterrer D, Kaufman T, Wagner U. 2016. On expansion and topological overlap. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 35.1-35.10.

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

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

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.

Matousek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete &; Computational Geometry. 52(1), 1–33.

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

Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 171–180.

Matousek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.

Matousek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.

cadek M, Krcál M, Matousek J, Vokínek L, Wagner U. 2013. Extending continuous maps: Polynomiality and undecidability. 45th Annual ACM Symposium on theory of computing. STOC: Symposium on the Theory of Computing, 595–604.

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

Matousek J, Tancer M, Wagner U. 2012. A geometric proof of the colored Tverberg theorem. Discrete &; Computational Geometry. 47(2), 245–265.

Chen D, Morin P, Wagner U. 2012. Absolute approximation of Tukey depth: Theory and experiments. Computational Geometry: Theory and Applications. 46(5), 566–573.

Gundert A, Wagner U. 2012. On Laplacians of random complexes. SGC: Symposuim on Computational Geometry, 151–160.

Matousek J, Tancer M, Wagner U. 2011. Hardness of embedding simplicial complexes in Rd. Journal of the European Mathematical Society. 13(2), 259–295.

Wagner U. 2011. Minors in random and expanding hypergraphs. SGC: Symposuim on Computational Geometry, 351–360.

Nevo E, Wagner U. 2010. On the embeddability of skeleta of spheres. Israel Journal of Mathematics. 174(1), 381–402.

Buchin K, Razen A, Uno T, Wagner U. 2009. Transforming spanning trees: A lower bound. Computational Geometry: Theory and Applications. 42(8), 724–730.

Matousek J, Tancer M, Wagner U. 2009. Hardness of embedding simplicial complexes in dd. SODA: Symposium on Discrete Algorithms, 855–864.

Wagner U. 2008.k-Sets and k-facets. In: Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, vol. 453, 443–514.

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

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

Chent K, Fiat A, Kaplan H, Levy M, Matousek J, Mossel E, Pach J, Sharir M, Smorodinsky S, Wagner U, Welzl E. 2006. Online conflict-free coloring for intervals. SIAM Journal on Computing. 36(5), 1342–1359.

Wagner U. 2006. On a geometric generalization of the Upper Bound Theorem. FOCS: Foundations of Computer Science, IEEE Conference Proceedings, , 635–645.

Matousek J, Sharir M, Smorodinsky S, Wagner U. 2006. K-sets in four dimensions. Discrete &; Computational Geometry. 35(2), 177–191.

Fiat A, Levy M, Matousek J, Pach E, Sharir M, Smorodinsky S, Wagner U, Welzl E. 2005. Online conflict-free coloring for intervals. SODA: Symposium on Discrete Algorithms, 545–554.

Ambühl C, Wagner U. 2005. The Clique problem in intersection graphs of ellipses and triangles. Theory of Computing Systems. 38(3), 279–292.

Lovász L, Vesztergombi K, Wagner U, Welzl E. 2004.Convex quadrilaterals and k-sets . In: Towards a Theory of Geometric Graphs. Contemporary Mathematics , vol. 342, 139–148.

Giesen J, Wagner U. 2004. Shape dimension and intrinsic metric from samples of manifolds. Discrete &; Computational Geometry. 32(2), 245–267.

Matousek J, Wagner U. 2004. New constructions of weak ;5-nets. Discrete &; Computational Geometry. 32(2), 195–206.

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

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

Matousek J, Wagner U. 2003. New constructions of weak epsilon-nets. SoCG: Symposium on Computational Geometry, 129–135.

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

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

Wagner U. 2002. On the number of corner cuts. Advances in Applied Mathematics. 29(2), 152–161.

Wagner U, Welzl E. 2001. A continuous analogue of the Upper Bound Theorem. Discrete &; Computational Geometry. 26(2), 205–219.

Wagner U, Welzl E. 2000. Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem. Proceedings of the 16th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 50–56.