Eight-partitioning points in 3D, and efficiently too
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, Discrete and Computational Geometry (2025).

Hardness of 4-colouring G-colourable graphs
S. Avvakumov, M. Filakovský, J. Oprsal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.

Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers
E. Streltsova, U. Wagner, in:,  41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.

The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, Discrete and Computational Geometry 72 (2024) 831–848.

Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Oprsal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.

Eight-partitioning points in 3D, and efficiently too
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15.

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

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

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

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

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

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

Embeddability of simplicial complexes is undecidable
M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.

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

Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)
U. Wagner, E. Welzl, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Barycentric cuts through a convex body
Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13.

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

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

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