41 citations · 148 across the 19 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2019
Link Crossing Number is NP-hard
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
cs.CG2014
Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto
Jonathan Spreer, Uli Wagner, Benjamin A. Burton +3
This workshop about triangulations of manifolds in computational geometry and topology was held at the 2014 CG-Week in Kyoto, Japan. It focussed on computational and combinatorial…
cs.CG1999★ 40 cited
Emerging Challenges in Computational Topology
Marshall Bern, David Eppstein, Pankaj K. Agarwal +19
Here we present the results of the NSF-funded Workshop on Computational Topology, which met on June 11 and 12 in Miami Beach, Florida. This report identifies important problems inv…