1 paper
Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Deciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized…