The degenerate crossing number of a graph is the minimum number of trans...
Knots are commonly represented and manipulated via diagrams, which are
d...
A matroid M is an ordered pair (E,I), where E is a finite set called
the...
Given x ∈ (ℝ_≥ 0)^[n]2 recording pairwise
distances, the METRIC VIOLATIO...
In this article, we investigate short topological decompositions of
non-...
A closed quasigeodesic on a convex polyhedron is a closed curve that is
...
An approximation algorithm for a Constraint Satisfaction Problem is call...
Coloring unit-disk graphs efficiently is an important problem in the glo...
In this paper we prove that the problem of deciding contractibility of a...
We prove the first polynomial bound on the number of monotonic homotopy ...
It is well-known that both the pathwidth and the outer-planarity of a gr...
We show that determining the crossing number of a link is NP-hard. For s...
We prove essentially tight lower bounds, conditionally to the Exponentia...
In this paper, we give a conditional lower bound of n^Ω(k) on
running ti...
In this article, we provide new structural results and algorithms for th...
We prove that the problem of deciding whether a 2- or 3-dimensional
simp...