Eric Sedgwick

Mathematics · Physical Sciences

15h-index828citations133works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Geometric and Algebraic Topology(40), Computational Geometry and Mesh Generation(28), Avian ecology and behavior(24), Homotopy and Cohomology in Algebraic Topology(18), Wildlife Ecology and Conservation(16)

Publications133 total

A Practical Algorithm for Knot Factorisation
arXiv (Cornell University)·2025Open Access
Spiraling and Folding: The Topological View
Discrete & Computational Geometry·2023
Hard Diagrams of the Unknot
Experimental Mathematics·2023Open Access
Spiraling and Folding: The Topological View
arXiv (Cornell University)·2022· 1 citedOpen Access
The unbearable hardness of unknotting
Advances in Mathematics·2021· 3 citedOpen Access
Embeddability in R <sup>3</sup> is NP-hard
Journal of the ACM·2020· 6 cited
Link crossing number is NP-hard
Journal of Knot Theory and Its Ramifications·2020Open Access
On the tree-width of knot diagrams
Journal of Computational Geometry (Carleton University)·2018· 5 citedOpen Access
On the tree-width of knot diagrams
arXiv (Cornell University)·2018· 1 citedOpen Access
Embeddability in the 3-Sphere Is Decidable
Journal of the ACM·2018· 11 cited
Tightening Curves on Surfaces Via Local Moves
HAL (Le Centre pour la Communication Scientifique Directe)·2018
Embeddability in R^3 is NP-hard
HAL (Le Centre pour la Communication Scientifique Directe)·2018· 1 cited
Embeddability in ℝ<sup>3</sup> is NP-hard
Society for Industrial and Applied Mathematics eBooks·2018· 4 citedOpen Access
Tightening Curves on Surfaces via Local Moves
Society for Industrial and Applied Mathematics eBooks·2018· 4 citedOpen Access
Locally helical surfaces have bounded twisting
Pacific Journal of Mathematics·2017Open Access
Embeddability in $\mathbb{R}^3$ is NP-hard
arXiv (Cornell University)·2017· 2 citedOpen Access
Computing the Flip Distance Between Triangulations
Discrete & Computational Geometry·2017· 19 cited
Computing Heegaard Genus is NP-Hard
2017· 6 cited
Computing Heegaard genus is NP-hard
arXiv (Cornell University)·2016Open Access
Untangling two systems of noncrossing curves
Israel Journal of Mathematics·2016· 4 cited
page 1 of 7Next →

Frequent Co-authors

Martin Tancer(8), Marcus Schaefer(7), Daniel Štefankovič(6), Jiřı́ Matoušek(6), Uli Wagner(6), David Bachman(5), John C. McDonald(5), Karen Alkoby(5), Mary Jo Davidson(5), Jacob Furst(5), Brian Konie(5), Glenn Lancaster(5), Noriko Tomuro(5), Rosalee Wolfe(5), Yo’av Rieck(5), Saul Schleimer(4), Jorge Toro(4), Roymieco Carter(4), Juliet Christopher(4), Yoav Moriah(4)