research
∙
11/15/2022
Shellability is hard even for balls
The main goal of this paper is to show that shellability is NP-hard for ...
share
research
∙
04/29/2022
NP-hardness of computing PL geometric category in dimension 2
The PL geometric category of a polyhedron P, denoted plgcat(P), provides...
research
∙
11/09/2021
Parameterized complexity of untangling knots
Deciding whether a diagram of a knot can be untangled with a given numbe...
research
∙
03/27/2020
Barycentric cuts through a convex body
Let K be a convex body in ℝ^n (i.e., a compact convex set with nonempty ...
research
∙
04/04/2019
Embeddings of k-complexes into 2k-manifolds
If K is a simplicial k-complex, the standard van Kampen obstructions tel...
research
∙
11/22/2017
Shellability is NP-complete
We prove that for every d≥ 2, deciding if a pure, d-dimensional, simplic...
research
∙
08/25/2017
