default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUli Wagner 0001
Person information
- affiliation: IST Austria, Klosterneuburg, Austria
- affiliation: ETH Zurich, Institute of Theoretical Computer Science, Switzerland
- affiliation: Hebrew University of Jerusalem, Einstein Institute for Mathematics, Israel
Other persons with the same name
- Uli Wagner 0002 — University of California at San Diego, Ludwig Institute for Cancer Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Radoslav Fulek
, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. Discret. Comput. Geom. 72(2): 831-848 (2024)- [c32]Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. SoCG 2024: 8:1-8:15 - [c31]Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner:
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. STACS 2024: 34:1-34:19 - [i24]Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. CoRR abs/2403.02627 (2024) - 2023
- [i23]Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner:
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. CoRR abs/2312.12981 (2023) - 2022
- [j22]Zuzana Patáková, Martin Tancer, Uli Wagner:
Barycentric Cuts Through a Convex Body. Discret. Comput. Geom. 68(4): 1133-1154 (2022) - [j21]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane. Discret. Comput. Geom. 68(4): 1227-1284 (2022) - 2020
- [c30]Zuzana Patáková, Martin Tancer, Uli Wagner:
Barycentric Cuts Through a Convex Body. SoCG 2020: 62:1-62:16 - [c29]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). SoCG 2020: 67:1-67:16 - [c28]Marek Filakovský, Uli Wagner, Stephan Zhechev:
Embeddability of Simplicial Complexes is Undecidable. SODA 2020: 767-785 - [c27]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips). SODA 2020: 2823-2841 - [i22]Zuzana Patáková, Martin Tancer, Uli Wagner:
Barycentric cuts through a convex body. CoRR abs/2003.13536 (2020) - [i21]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane. CoRR abs/2003.13557 (2020)
2010 – 2019
- 2019
- [j20]Anna Lubiw, Zuzana Masárová, Uli Wagner:
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. Discret. Comput. Geom. 61(4): 880-898 (2019) - [j19]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-complete. J. ACM 66(3): 21:1-21:18 (2019) - [j18]Kristóf Huszár, Jonathan Spreer, Uli Wagner:
On the treewidth of triangulated 3-manifolds. J. Comput. Geom. 10(2): 70-98 (2019) - [c26]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. SoCG 2019: 38:1-38:13 - 2018
- [j17]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-Sphere Is Decidable. J. ACM 65(1): 5:1-5:49 (2018) - [j16]Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev:
Computing simplicial representatives of homotopy group elements. J. Appl. Comput. Topol. 2(3-4): 177-231 (2018) - [c25]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-Complete. SoCG 2018: 41:1-41:15 - [c24]Kristóf Huszár, Jonathan Spreer, Uli Wagner:
On the Treewidth of Triangulated 3-Manifolds. SoCG 2018: 46:1-46:15 - [c23]Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev:
Computing Simplicial Representatives of Homotopy Group Elements. SODA 2018: 1135-1151 - [i20]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. CoRR abs/1812.04911 (2018) - 2017
- [j15]Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding Non-orientable Surfaces in 3-Manifolds. Discret. Comput. Geom. 58(4): 871-888 (2017) - [c22]Anna Lubiw, Zuzana Masárová, Uli Wagner:
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. SoCG 2017: 49:1-49:15 - [i19]Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev:
Computing simplicial representatives of homotopy group element. CoRR abs/1706.00380 (2017) - [i18]Anna Lubiw, Zuzana Masárová, Uli Wagner:
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. CoRR abs/1710.02741 (2017) - [i17]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-complete. CoRR abs/1711.08436 (2017) - [i16]Kristóf Huszár, Jonathan Spreer, Uli Wagner:
On the treewidth of triangulated 3-manifolds. CoRR abs/1712.00434 (2017) - 2016
- [c21]Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding Non-Orientable Surfaces in 3-Manifolds. SoCG 2016: 24:1-24:15 - [c20]Dominic Dotterrer, Tali Kaufman, Uli Wagner:
On Expansion and Topological Overlap. SoCG 2016: 35:1-35:10 - [c19]Isaac Mabillard, Uli Wagner:
Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range. SoCG 2016: 51:1-51:12 - [i15]Isaac Mabillard, Uli Wagner:
Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range. CoRR abs/1601.00876 (2016) - [i14]Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding non-orientable surfaces in 3-manifolds. CoRR abs/1602.07907 (2016) - 2015
- [c18]Xavier Goaoc, Isaac Mabillard, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result. SoCG 2015: 476-490 - [c17]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Bounding Helly Numbers via Betti Numbers. SoCG 2015: 507-521 - [i13]Dominic Dotterrer, Tali Kaufman, Uli Wagner:
On Expansion and Topological Overlap. CoRR abs/1506.04558 (2015) - [i12]Isaac Mabillard, Uli Wagner:
Eliminating Higher-Multiplicity Intersections, I. A Whitney Trick for Tverberg-Type Problems. CoRR abs/1508.02349 (2015) - [i11]Sergey Avvakumov, Isaac Mabillard, Arkadiy Skopenkov, Uli Wagner:
Eliminating Higher-Multiplicity Intersections, III. Codimension 2. CoRR abs/1511.03501 (2015) - 2014
- [j14]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extendability of Continuous Maps Is Undecidable. Discret. Comput. Geom. 51(1): 24-66 (2014) - [j13]Jirí Matousek, Uli Wagner:
On Gromov's Method of Selecting Heavily Covered Points. Discret. Comput. Geom. 52(1): 1-33 (2014) - [j12]Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
Computing All Maps into a Sphere. J. ACM 61(3): 17:1-17:44 (2014) - [j11]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension. SIAM J. Comput. 43(5): 1728-1780 (2014) - [c16]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. SoCG 2014: 78 - [c15]Isaac Mabillard, Uli Wagner:
Eliminating Tverberg Points, I. An Analogue of the Whitney Trick. SoCG 2014: 171 - [i10]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. CoRR abs/1402.0815 (2014) - [i9]Anna Gundert, Uli Wagner:
On Topological Minors in Random Simplicial Complexes. CoRR abs/1404.2106 (2014) - [i8]Jonathan Spreer, Uli Wagner, Benjamin A. Burton, Satoshi Murai, Eric Sedgwick, Henry Segerman:
Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. CoRR abs/1406.0333 (2014) - [i7]Anna Gundert, Uli Wagner:
On Eigenvalues of Random Complexes. CoRR abs/1411.4906 (2014) - 2013
- [j10]Dan Chen, Pat Morin, Uli Wagner:
Absolute approximation of Tukey depth: Theory and experiments. Comput. Geom. 46(5): 566-573 (2013) - [c14]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Untangling Two Systems of Noncrossing Curves. GD 2013: 472-483 - [c13]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extending continuous maps: polynomiality and undecidability. STOC 2013: 595-604 - [i6]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extendability of continuous maps is undecidable. CoRR abs/1302.2370 (2013) - [i5]Xavier Goaoc, Pavel Paták, Zuzana Safernová, Martin Tancer, Uli Wagner:
Bounding Helly numbers via Betti numbers. CoRR abs/1310.4613 (2013) - 2012
- [j9]Jirí Matousek, Martin Tancer, Uli Wagner:
A Geometric Proof of the Colored Tverberg Theorem. Discret. Comput. Geom. 47(2): 245-265 (2012) - [c12]Anna Gundert, Uli Wagner:
On laplacians of random complexes. SCG 2012: 151-160 - [c11]Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
Computing all maps into a sphere. SODA 2012: 1-10 - [i4]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension. CoRR abs/1211.3093 (2012) - 2011
- [c10]Uli Wagner:
Minors in random and expanding hypergraphs. SCG 2011: 351-360 - [i3]Jirí Matousek, Uli Wagner:
On Gromov's Method of Selecting Heavily Covered Points. CoRR abs/1102.3515 (2011) - [i2]Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
Computing all maps into a sphere. CoRR abs/1105.6257 (2011) - 2010
- [c9]Marek Sulovský, Uli Wagner:
k-sets and continuous motion in R3. CCCG 2010: 47-50
2000 – 2009
- 2009
- [j8]Kevin Buchin, Andreas Razen, Takeaki Uno, Uli Wagner:
Transforming spanning trees: A lower bound. Comput. Geom. 42(8): 724-730 (2009) - [c8]Jirí Matousek, Martin Tancer, Uli Wagner:
Hardness of embedding simplicial complexes in Rd. SODA 2009: 855-864 - 2008
- [c7]Shakhar Smorodinsky, Marek Sulovský, Uli Wagner:
On Center Regions and Balls Containing Many Points. COCOON 2008: 363-373 - [i1]Jirí Matousek, Martin Tancer, Uli Wagner:
Hardness of embedding simplicial complexes in Rd. CoRR abs/0807.0336 (2008) - 2007
- [j7]Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl:
Online Conflict-Free Coloring for Intervals. SIAM J. Comput. 36(5): 1342-1359 (2007) - 2006
- [j6]Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner:
k-Sets in Four Dimensions. Discret. Comput. Geom. 35(2): 177-191 (2006) - [c6]Uli Wagner:
On a Geometric Generalization of the Upper Bound Theorem. FOCS 2006: 635-645 - 2005
- [j5]Christoph Ambühl, Uli Wagner:
The Clique Problem in Intersection Graphs of Ellipses and Triangles. Theory Comput. Syst. 38(3): 279-292 (2005) - [c5]Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl:
Online conflict-free coloring for intervals. SODA 2005: 545-554 - 2004
- [j4]Jirí Matousek, Uli Wagner:
New Constructions of Weak epsilon-Nets. Discret. Comput. Geom. 32(2): 195-206 (2004) - [j3]Joachim Giesen, Uli Wagner:
Shape Dimension and Intrinsic Metric from Samples of Manifolds. Discret. Comput. Geom. 32(2): 245-267 (2004) - 2003
- [c4]Joachim Giesen, Uli Wagner:
Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. SCG 2003: 329-337 - [c3]Uli Wagner:
On the rectilinear crossing number of complete graphs. SODA 2003: 583-588 - 2002
- [j2]Uli Wagner:
On the number of corner cuts. Adv. Appl. Math. 29(2): 152-161 (2002) - [c2]Christoph Ambühl, Uli Wagner:
On the Clique Problem in Intersection Graphs of Ellipses. ISAAC 2002: 489-500 - 2001
- [j1]Uli Wagner, Emo Welzl:
A Continuous Analogue of the Upper Bound Theorem. Discret. Comput. Geom. 26(2): 205-219 (2001) - 2000
- [c1]Uli Wagner, Emo Welzl:
Origin-embracing distributions or a continuous analogue of the upper bound theorem. SCG 2000: 50-56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
