81 citations · 403 across the 47 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CG2019
On the hardness of finding normal surfaces
Benjamin A. Burton, Alexander He
For many fundamental problems in computational topology, such as unknot recognition and -sphere recognition, the existence of a polynomial-time solution remains unknown. A major…
cs.DS2019
Knot Diagrams of Treewidth Two
Hans L. Bodlaender, Benjamin Burton, Fedor V. Fomin +1
In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth…