NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (22)

math.GT2013

Heegaard structure respects complicated JSJ decompositions

David Bachman, Ryan Derby-Talbot, Eric Sedgwick

math.GT2001

Genus two 3-manifolds are built from handle number one pieces

Eric Sedgwick

math.GT2013

Almost normal surfaces with boundary

David Bachman, Ryan Derby-Talbot, Eric Sedgwick

cs.CG1999

Emerging Challenges in Computational Topology

Marshall Bern, David Eppstein, Pankaj K. Agarwal +19

math.GT2016

Computing Heegaard genus is NP-hard

David Bachman, Ryan Derby-Talbot, Eric Sedgwick

math.GT2008

Heegaard Splittings of Twisted Torus Knots

Yoav Moriah, Eric Sedgwick

math.GT2019

On the tree-width of knot diagrams

Arnaud de Mesmay, Jessica Purcell, Saul Schleimer +1

math.GT2002

Thin position for a connected sum of small knots

Yo'av Rieck, Eric Sedgwick

math.CO2014

Untangling two systems of noncrossing curves

Jiří Matoušek, Eric Sedgwick, Martin Tancer +1

math.GT2009

Sweepouts of amalgamated 3-manifolds

David Bachman, Saul Schleimer, Eric Sedgwick

math.GT2018

The unbearable hardness of unknotting

Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick +1

math.GT2018

Embeddability in $\mathbb{R}^3$ is NP-hard

Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick +1

math.GT2015

Locally Helical Surfaces have bounded twisting

David Bachman, Ryan Derby-Talbot, Eric Sedgwick

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

math.GT2006

Finding planar surfaces in knot- and link-manifolds

William Jaco, J. Hyam Rubinstein, Eric Sedgwick

math.GT2013

Surfaces that become isotopic after Dehn filling

David Bachman, Ryan Derby-Talbot, Eric Sedgwick

math.GT2014

Embeddability in the 3-sphere is decidable

Jiří Matoušek, Eric Sedgwick, Martin Tancer +1

cs.CG2019

Link Crossing Number is NP-hard

Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick

The paper proves that computing the crossing number of a link is NP‑hard and that, for certain weaker notions of link equivalence, the problem is NP‑complete.

#crossing number#link theory#np-hardness#computational topology
math.GT2009

The Heegaard structure of Dehn filled manifolds

Yoav Moriah, Eric Sedgwick

math.GT2004

Heegaard splittings of the form H + nK

Yoav Moriah, Saul Schleimer, Eric Sedgwick

cs.DS2016

Computing the flip distance between triangulations

Iyad Kanj, Eric Sedgwick, Ge Xia

math.GT1998

Decision problems in the space of Dehn fillings

William Jaco, Eric Sedgwick