activity
20072020
most citedPolynomial-time computation of homotopy groups and Postnikov systems in fixed dimension

31 citations · 127 across the 16 of their papers we have counts for

collaborators

26 papers

math.CO2020

Barycentric cuts through a convex body

Zuzana Patáková, Martin Tancer, Uli Wagner

Let be a convex body in (i.e., a compact convex set with nonempty interior). Given a point in the interior of , a hyperplane passing through is ca…

cs.CG2020★ 1 cited

Connectivity of Triangulation Flip Graphs in the Plane

Uli Wagner, Emo Welzl

Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulat…

cs.CG2018

The Crossing Tverberg Theorem

Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii +2

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set of at least points in , one can find a partition $X=…

math.GT2017

On the treewidth of triangulated 3-manifolds

Kristóf Huszár, Jonathan Spreer, Uli Wagner

In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, s…

math.CO2017

Shellability is NP-complete

Xavier Goaoc, Pavel Paták, Zuzana Patáková +2

We prove that for every , deciding if a pure, -dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Dan…

cs.CG2017

A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations

Anna Lubiw, Zuzana Masárová, Uli Wagner

Given a triangulation of a point set in the plane, a \emph{flip} deletes an edge whose removal leaves a convex quadrilateral, and replaces by the opposite diagonal of the q…