The main goal of this paper is to show that shellability is NP-hard for
...
The PL geometric category of a polyhedron P, denoted plgcat(P),
provides...
Deciding whether a diagram of a knot can be untangled with a given numbe...
Let K be a convex body in ℝ^n (i.e., a compact convex set with
nonempty ...
If K is a simplicial k-complex, the standard van Kampen obstructions
tel...
We prove that for every d≥ 2, deciding if a pure, d-dimensional,
simplic...
We prove that the problem of deciding whether a 2- or 3-dimensional
simp...