Origin-embracing distributions or a continuous analogue of the upper bound theorem. - Uli Wagner 001; Emo Welzl (SCG, 2000)

A Continuous Analogue of the Upper Bound Theorem. - Uli Wagner 001; Emo Welzl (Discret. Comput. Geom., 2001)

On the Clique Problem in Intersection Graphs of Ellipses. - Christoph Ambühl; Uli Wagner 001 (ISAAC, 2002)

On the number of corner cuts. - Uli Wagner 001 (Adv. Appl. Math., 2002)

Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. - Joachim Giesen; Uli Wagner 001 (SCG, 2003)

On the rectilinear crossing number of complete graphs. - Uli Wagner 001 (SODA, 2003)

Shape Dimension and Intrinsic Metric from Samples of Manifolds. - Joachim Giesen; Uli Wagner 001 (Discret. Comput. Geom., 2004)

New Constructions of Weak epsilon-Nets. - Jirí Matousek 001; Uli Wagner 001 (Discret. Comput. Geom., 2004)

Online conflict-free coloring for intervals. - Amos Fiat; Meital Levy; Jirí Matousek 001; Elchanan Mossel; János Pach; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001; Emo Welzl (SODA, 2005)

The Clique Problem in Intersection Graphs of Ellipses and Triangles. - Christoph Ambühl; Uli Wagner 001 (Theory Comput. Syst., 2005)

On a Geometric Generalization of the Upper Bound Theorem. - Uli Wagner 001 (FOCS, 2006)

k-Sets in Four Dimensions. - Jirí Matousek 001; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001 (Discret. Comput. Geom., 2006)

Online Conflict-Free Coloring for Intervals. - Ke Chen 006; Amos Fiat; Haim Kaplan; Meital Levy; Jirí Matousek 001; Elchanan Mossel; János Pach; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001; Emo Welzl (SIAM J. Comput., 2007)

On Center Regions and Balls Containing Many Points. - Shakhar Smorodinsky; Marek Sulovský; Uli Wagner 001 (COCOON, 2008)

Hardness of embedding simplicial complexes in Rd - Jirí Matousek 001; Martin Tancer; Uli Wagner 001 (CoRR, 2008)

Hardness of embedding simplicial complexes in Rd. - Jirí Matousek 001; Martin Tancer; Uli Wagner 001 (SODA, 2009)

Transforming spanning trees: A lower bound. - Kevin Buchin; Andreas Razen; Takeaki Uno; Uli Wagner 001 (Comput. Geom., 2009)

k-sets and continuous motion in R3. - Marek Sulovský; Uli Wagner 001 (CCCG, 2010)

Minors in random and expanding hypergraphs. - Uli Wagner 001 (SCG, 2011)

On laplacians of random complexes. - Anna Gundert; Uli Wagner 001 (SCG, 2012)

A Geometric Proof of the Colored Tverberg Theorem. - Jirí Matousek 001; Martin Tancer; Uli Wagner 001 (Discret. Comput. Geom., 2012)

Untangling Two Systems of Noncrossing Curves. - Jirí Matousek 001; Eric Sedgwick; Martin Tancer; Uli Wagner 001 (GD, 2013)

Extending continuous maps: polynomiality and undecidability. - Martin Cadek; Marek Krcál; Jirí Matousek 001; Lukás Vokrínek; Uli Wagner 001 (STOC, 2013)

Absolute approximation of Tukey depth: Theory and experiments. - Dan Chen 003; Pat Morin; Uli Wagner 001 (Comput. Geom., 2013)

Eliminating Tverberg Points, I. An Analogue of the Whitney Trick. - Isaac Mabillard; Uli Wagner 001 (SoCG, 2014)

On Topological Minors in Random Simplicial Complexes. - Anna Gundert; Uli Wagner 001 (CoRR, 2014)

On Eigenvalues of Random Complexes. - Anna Gundert; Uli Wagner 001 (CoRR, 2014)

Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. - Jonathan Spreer; Uli Wagner 001; Benjamin A. Burton; Satoshi Murai; Eric Sedgwick; Henry Segerman (CoRR, 2014)

Extendability of Continuous Maps Is Undecidable. - Martin Cadek; Marek Krcál; Jirí Matousek 001; Lukás Vokrínek; Uli Wagner 001 (Discret. Comput. Geom., 2014)

On Gromov's Method of Selecting Heavily Covered Points. - Jirí Matousek 001; Uli Wagner 001 (Discret. Comput. Geom., 2014)

Computing All Maps into a Sphere. - Martin Cadek; Marek Krcál; Jirí Matousek 001; Francis Sergeraert; Lukás Vokrínek; Uli Wagner 001 (J. ACM, 2014)

Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension. - Martin Cadek; Marek Krcál; Jirí Matousek 001; Lukás Vokrínek; Uli Wagner 001 (SIAM J. Comput., 2014)

On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result. - Xavier Goaoc; Isaac Mabillard; Pavel Paták; Zuzana Patáková; Martin Tancer; Uli Wagner 001 (SoCG, 2015)

Bounding Helly Numbers via Betti Numbers. - Xavier Goaoc; Pavel Paták; Zuzana Patáková; Martin Tancer; Uli Wagner 001 (SoCG, 2015)

Eliminating Higher-Multiplicity Intersections, III. Codimension 2. - Sergey Avvakumov; Isaac Mabillard; Arkadiy Skopenkov; Uli Wagner 001 (CoRR, 2015)

Eliminating Higher-Multiplicity Intersections, I. A Whitney Trick for Tverberg-Type Problems. - Isaac Mabillard; Uli Wagner 001 (CoRR, 2015)

On Expansion and Topological Overlap. - Dominic Dotterrer; Tali Kaufman; Uli Wagner 001 (SoCG, 2016)

Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range. - Isaac Mabillard; Uli Wagner 001 (SoCG, 2016)

Computing simplicial representatives of homotopy group element. - Marek Filakovský; Peter Franek; Uli Wagner 001; Stephan Zhechev (CoRR, 2017)

Finding Non-orientable Surfaces in 3-Manifolds. - Benjamin A. Burton; Arnaud de Mesmay; Uli Wagner 001 (Discret. Comput. Geom., 2017)

Embeddability in the 3-Sphere Is Decidable. - Jirí Matousek 001; Eric Sedgwick; Martin Tancer; Uli Wagner 001 (J. ACM, 2018)

Computing simplicial representatives of homotopy group elements. - Marek Filakovský; Peter Franek; Uli Wagner 001; Stephan Zhechev (J. Appl. Comput. Topol., 2018)

A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. - Anna Lubiw; Zuzana Masárová; Uli Wagner 001 (Discret. Comput. Geom., 2019)

Shellability is NP-complete. - Xavier Goaoc; Pavel Paták; Zuzana Patáková; Martin Tancer; Uli Wagner 001 (J. ACM, 2019)

On the treewidth of triangulated 3-manifolds. - Kristóf Huszár; Jonathan Spreer; Uli Wagner 001 (J. Comput. Geom., 2019)

Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). - Uli Wagner 001; Emo Welzl (SoCG, 2020)

Embeddability of Simplicial Complexes is Undecidable. - Marek Filakovský; Uli Wagner 001; Stephan Zhechev (SODA, 2020)

Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips). - Uli Wagner 001; Emo Welzl (SODA, 2020)

Barycentric Cuts Through a Convex Body. - Zuzana Patáková; Martin Tancer; Uli Wagner 001 (Discret. Comput. Geom., 2022)

Connectivity of Triangulation Flip Graphs in the Plane. - Uli Wagner 001; Emo Welzl (Discret. Comput. Geom., 2022)

Eight-Partitioning Points in 3D, and Efficiently Too. - Boris Aronov; Abdul Basit 001; Indu Ramesh; Gianluca Tasinato; Uli Wagner 001 (SoCG, 2024)

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. - Marek Filakovský; Tamio-Vesa Nakajima; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (STACS, 2024)

The Crossing Tverberg Theorem. - Radoslav Fulek; Bernd Gärtner; Andrey Kupavskii; Pavel Valtr 001; Uli Wagner 001 (Discret. Comput. Geom., 2024)

Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers. - Elizaveta Streltsova; Uli Wagner 001 (SoCG, 2025)

Hardness of 4-Colouring k-Colourable Graphs. - Sergey Avvakumov; Marek Filakovský; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (STOC, 2025)

Hardness of 4-Colourings G-Colourable Graphs. - Sergey Avvakumov; Marek Filakovský; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (CoRR, 2025)

Linear relations between face numbers of levels in arrangements. - Elizaveta Streltsova; Uli Wagner 001 (CoRR, 2025)

Sublevels in arrangements and the spherical arc crossing number of complete graphs. - Elizaveta Streltsova; Uli Wagner 001 (CoRR, 2025)