Uli Wagner - RankMe

84 papers A* 25A 2B 1Misc 1Journal 50Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Hardness of 4-Colouring k-Colourable Graphs. STOC Sergey Avvakumov, Marek Filakovský, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2025	J	`jnl`	Hardness of 4-Colourings G-Colourable Graphs. CoRR Sergey Avvakumov, Marek Filakovský, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2025	A*	`conf`	Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers. SoCG Elizaveta Streltsova, Uli Wagner
2025	J	`jnl`	Linear relations between face numbers of levels in arrangements. CoRR Elizaveta Streltsova, Uli Wagner
2025	J	`jnl`	Sublevels in arrangements and the spherical arc crossing number of complete graphs. CoRR Elizaveta Streltsova, Uli Wagner
2024	A*	`conf`	Eight-Partitioning Points in 3D, and Efficiently Too. SoCG Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner
2024	J	`jnl`	Eight-Partitioning Points in 3D, and Efficiently Too. CoRR Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner
2024	A	`conf`	Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. STACS Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2024	J	`jnl`	The Crossing Tverberg Theorem. Discret. Comput. Geom. Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2023	J	`jnl`	Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. CoRR Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2022	J	`jnl`	Barycentric Cuts Through a Convex Body. Discret. Comput. Geom. Zuzana Patáková, Martin Tancer, Uli Wagner
2022	J	`jnl`	Connectivity of Triangulation Flip Graphs in the Plane. Discret. Comput. Geom. Uli Wagner, Emo Welzl
2020	A*	`conf`	Barycentric Cuts Through a Convex Body. SoCG Zuzana Patáková, Martin Tancer, Uli Wagner
2020	J	`jnl`	Barycentric cuts through a convex body. CoRR Zuzana Patáková, Martin Tancer, Uli Wagner
2020	A*	`conf`	Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips). SODA Uli Wagner, Emo Welzl
2020	A*	`conf`	Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). SoCG Uli Wagner, Emo Welzl
2020	J	`jnl`	Connectivity of Triangulation Flip Graphs in the Plane. CoRR Uli Wagner, Emo Welzl
2020	A*	`conf`	Embeddability of Simplicial Complexes is Undecidable. SODA Marek Filakovský, Uli Wagner, Stephan Zhechev
2019	J	`jnl`	A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. Discret. Comput. Geom. Anna Lubiw, Zuzana Masárová, Uli Wagner
2019	J	`jnl`	On the treewidth of triangulated 3-manifolds. J. Comput. Geom. Kristóf Huszár, Jonathan Spreer, Uli Wagner
2019	J	`jnl`	Shellability is NP-complete. J. ACM Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
2019	A*	`conf`	The Crossing Tverberg Theorem. SoCG Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2018	A*	`conf`	Computing Simplicial Representatives of Homotopy Group Elements. SODA Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev
2018	J	`jnl`	Computing simplicial representatives of homotopy group elements. J. Appl. Comput. Topol. Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev
2018	J	`jnl`	Embeddability in the 3-Sphere Is Decidable. J. ACM Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
2018	A*	`conf`	On the Treewidth of Triangulated 3-Manifolds. SoCG Kristóf Huszár, Jonathan Spreer, Uli Wagner
2018	A*	`conf`	Shellability is NP-Complete. SoCG Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
2018	J	`jnl`	The Crossing Tverberg Theorem. CoRR Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2017	A*	`conf`	A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. SoCG Anna Lubiw, Zuzana Masárová, Uli Wagner
2017	J	`jnl`	A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. CoRR Anna Lubiw, Zuzana Masárová, Uli Wagner
2017	J	`jnl`	Computing simplicial representatives of homotopy group element. CoRR Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev
2017	J	`jnl`	Finding Non-orientable Surfaces in 3-Manifolds. Discret. Comput. Geom. Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
2017	J	`jnl`	On the treewidth of triangulated 3-manifolds. CoRR Kristóf Huszár, Jonathan Spreer, Uli Wagner
2017	J	`jnl`	Shellability is NP-complete. CoRR Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
2016	A*	`conf`	Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range. SoCG Isaac Mabillard, Uli Wagner
2016	J	`jnl`	Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range. CoRR Isaac Mabillard, Uli Wagner
2016	A*	`conf`	Finding Non-Orientable Surfaces in 3-Manifolds. SoCG Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
2016	J	`jnl`	Finding non-orientable surfaces in 3-manifolds. CoRR Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
2016	A*	`conf`	On Expansion and Topological Overlap. SoCG Dominic Dotterrer, Tali Kaufman, Uli Wagner
2015	A*	`conf`	Bounding Helly Numbers via Betti Numbers. SoCG Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
2015	J	`jnl`	Eliminating Higher-Multiplicity Intersections, I. A Whitney Trick for Tverberg-Type Problems. CoRR Isaac Mabillard, Uli Wagner
2015	J	`jnl`	Eliminating Higher-Multiplicity Intersections, III. Codimension 2. CoRR Sergey Avvakumov, Isaac Mabillard, Arkadiy Skopenkov, Uli Wagner
2015	J	`jnl`	On Expansion and Topological Overlap. CoRR Dominic Dotterrer, Tali Kaufman, Uli Wagner
2015	A*	`conf`	On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result. SoCG Xavier Goaoc, Isaac Mabillard, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
2014	J	`jnl`	Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. CoRR Jonathan Spreer, Uli Wagner, Benjamin A. Burton, Satoshi Murai, Eric Sedgwick, Henry Segerman
2014	J	`jnl`	Computing All Maps into a Sphere. J. ACM Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
2014	A*	`conf`	Eliminating Tverberg Points, I. An Analogue of the Whitney Trick. SoCG Isaac Mabillard, Uli Wagner
2014	A*	`conf`	Embeddability in the 3-sphere is decidable. SoCG Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
2014	J	`jnl`	Embeddability in the 3-sphere is decidable. CoRR Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
2014	J	`jnl`	Extendability of Continuous Maps Is Undecidable. Discret. Comput. Geom. Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2014	J	`jnl`	On Eigenvalues of Random Complexes. CoRR Anna Gundert, Uli Wagner
2014	J	`jnl`	On Gromov's Method of Selecting Heavily Covered Points. Discret. Comput. Geom. Jirí Matousek, Uli Wagner
2014	J	`jnl`	On Topological Minors in Random Simplicial Complexes. CoRR Anna Gundert, Uli Wagner
2014	J	`jnl`	Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension. SIAM J. Comput. Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2013	J	`jnl`	Absolute approximation of Tukey depth: Theory and experiments. Comput. Geom. Dan Chen, Pat Morin, Uli Wagner
2013	J	`jnl`	Bounding Helly numbers via Betti numbers. CoRR Xavier Goaoc, Pavel Paták, Zuzana Safernová, Martin Tancer, Uli Wagner
2013	J	`jnl`	Extendability of continuous maps is undecidable CoRR Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2013	A*	`conf`	Extending continuous maps: polynomiality and undecidability. STOC Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2013	A	`conf`	Untangling Two Systems of Noncrossing Curves. GD Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
2012	J	`jnl`	A Geometric Proof of the Colored Tverberg Theorem. Discret. Comput. Geom. Jirí Matousek, Martin Tancer, Uli Wagner
2012	A*	`conf`	Computing all maps into a sphere. SODA Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
2012	—	`conf`	On laplacians of random complexes. SCG Anna Gundert, Uli Wagner
2012	J	`jnl`	Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension CoRR Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2011	J	`jnl`	Computing all maps into a sphere CoRR Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
2011	—	`conf`	Minors in random and expanding hypergraphs. SCG Uli Wagner
2011	J	`jnl`	On Gromov's Method of Selecting Heavily Covered Points CoRR Jirí Matousek, Uli Wagner
2010	—	`conf`	k-sets and continuous motion in R CCCG Marek Sulovský, Uli Wagner
2009	A*	`conf`	Hardness of embedding simplicial complexes in SODA Jirí Matousek, Martin Tancer, Uli Wagner
2009	J	`jnl`	Transforming spanning trees: A lower bound. Comput. Geom. Kevin Buchin, Andreas Razen, Takeaki Uno, Uli Wagner
2008	J	`jnl`	Hardness of embedding simplicial complexes in R CoRR Jirí Matousek, Martin Tancer, Uli Wagner
2008	Misc	`conf`	On Center Regions and Balls Containing Many Points. COCOON Shakhar Smorodinsky, Marek Sulovský, Uli Wagner
2007	J	`jnl`	Online Conflict-Free Coloring for Intervals. SIAM J. Comput. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2006	A*	`conf`	On a Geometric Generalization of the Upper Bound Theorem. FOCS Uli Wagner
2006	J	`jnl`	k-Sets in Four Dimensions. Discret. Comput. Geom. Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
2005	A*	`conf`	Online conflict-free coloring for intervals. SODA Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2005	J	`jnl`	The Clique Problem in Intersection Graphs of Ellipses and Triangles. Theory Comput. Syst. Christoph Ambühl, Uli Wagner
2004	J	`jnl`	New Constructions of Weak epsilon-Nets. Discret. Comput. Geom. Jirí Matousek, Uli Wagner
2004	J	`jnl`	Shape Dimension and Intrinsic Metric from Samples of Manifolds. Discret. Comput. Geom. Joachim Giesen, Uli Wagner
2003	A*	`conf`	On the rectilinear crossing number of complete graphs. SODA Uli Wagner
2003	—	`conf`	Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. SCG Joachim Giesen, Uli Wagner
2002	B	`conf`	On the Clique Problem in Intersection Graphs of Ellipses. ISAAC Christoph Ambühl, Uli Wagner
2002	J	`jnl`	On the number of corner cuts. Adv. Appl. Math. Uli Wagner
2001	J	`jnl`	A Continuous Analogue of the Upper Bound Theorem. Discret. Comput. Geom. Uli Wagner, Emo Welzl
2000	—	`conf`	Origin-embracing distributions or a continuous analogue of the upper bound theorem. SCG Uli Wagner, Emo Welzl