default search action
Eric Sedgwick
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Jan Kyncl
, Marcus Schaefer
Spiraling and Folding: The Topological View. Discret. Comput. Geom. 72(1): 246-268 (2024) - [j11]Benjamin A. Burton
Hard Diagrams of the Unknot. Exp. Math. 33(3): 482-500 (2024) - 2022
- [i6]Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiraling and Folding: The Topological View. CoRR abs/2206.07849 (2022) - 2020
- [j10]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
Embeddability in R3 is NP-hard. J. ACM 67(4): 20:1-20:29 (2020)
2010 – 2019
- 2019
- [j9]Saul Schleimer, Arnaud de Mesmay, Jessica S. Purcell
On the tree-width of knot diagrams. J. Comput. Geom. 10(1): 164-180 (2019) - [c13]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
The Unbearable Hardness of Unknotting. SoCG 2019: 49:1-49:19 - [i5]Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick:
Link Crossing Number is NP-hard. CoRR abs/1908.04073 (2019) - 2018
- [j8]Jirí Matousek, Eric Sedgwick, Martin Tancer
Embeddability in the 3-Sphere Is Decidable. J. ACM 65(1): 5:1-5:49 (2018) - [c12]Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann
Tightening Curves on Surfaces via Local Moves. SODA 2018: 121-135 - [c11]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
Embeddability in ℝ3 is NP-hard. SODA 2018: 1316-1329 - 2017
- [j7]Iyad A. Kanj, Eric Sedgwick, Ge Xia:
Computing the Flip Distance Between Triangulations. Discret. Comput. Geom. 58(2): 313-344 (2017) - [i4]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
Embeddability in R3 is NP-hard. CoRR abs/1708.07734 (2017) - 2014
- [c10]Jirí Matousek, Eric Sedgwick, Martin Tancer
Embeddability in the 3-sphere is decidable. SoCG 2014: 78 - [i3]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. CoRR abs/1402.0815 (2014) - [i2]Jonathan Spreer, Uli Wagner, Benjamin A. Burton, Satoshi Murai, Eric Sedgwick, Henry Segerman:
Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. CoRR abs/1406.0333 (2014) - 2013
- [c9]Jirí Matousek, Eric Sedgwick, Martin Tancer
Untangling Two Systems of Noncrossing Curves. GD 2013: 472-483 - 2011
- [j6]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Spiraling and Folding: The Word View. Algorithmica 60(3): 609-626 (2011)
2000 – 2009
- 2008
- [c8]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. CCCG 2008 - 2007
- [j5]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Folding and Spiralling: The Word View. Electron. Notes Discret. Math. 29: 101-105 (2007) - [j4]Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus characterizes the complexity of certain graph problems: Some tight results. J. Comput. Syst. Sci. 73(6): 892-907 (2007) - [c7]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiralling and Folding: The Topological View. CCCG 2007: 73-76 - 2003
- [j3]Rosalee J. Wolfe, Steve Luecking, John McDonald, Jacob D. Furst, Eric Sedgwick, Roymieco Carter, Nedjla Ougouag-Tiouririne:
Curricular Considerations for Supporting Careers in Computer Graphics. Comput. Sci. Educ. 13(1): 31-52 (2003) - [j2]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2): 365-380 (2003) - [c6]Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP 2003: 845-856 - 2002
- [c5]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Algorithms for Normal Curves and Surfaces. COCOON 2002: 370-380 - [c4]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Recognizing string graphs in NP. STOC 2002: 1-6 - 2001
- [j1]John McDonald, Jorge Toro, Karen Alkoby, André Berthiaume, Roymieco Carter, Pattaraporn Chomwong, Juliet Christopher, Mary Jo Davidson, Jacob D. Furst, Brian Konie, Glenn Lancaster, Lopa Roychoudhuri, Eric Sedgwick, Noriko Tomuro, Rosalee J. Wolfe:
An improved articulated model of the human hand. Vis. Comput. 17(3): 158-166 (2001) - [c3]Jorge Toro, Jacob D. Furst, Karen Alkoby, Roymieco Carter, Juliet Christopher, Brock Craft, Mary Jo Davidson, Damien Hinkle, Brian Konie, Glenn Lancaster, Steve Luecking, Ashley Morris, John McDonald, Eric Sedgwick, Noriko Tomuro, Rosalee J. Wolfe:
A graphical environment for transcription of american sign language. CATA 2001: 366-369 - [c2]Eric Sedgwick, Karen Alkoby, Mary Jo Davidson, Roymieco Carter, Juliet Christopher, Brock Craft, Jacob D. Furst, Damien Hinkle, Brian Konie, Glenn Lancaster, Steve Luecking, Ashley Morris, John McDonald, Noriko Tomuro, Jorge Toro, Rosalee J. Wolfe:
Toward the Effective Animation of American Sign Language. WSCG 2001: 375-378 - 2000
- [c1]John McDonald, Karen Alkoby, André Berthiaume, Pattaraporn Chomwong, Juliet Christopher, Mary Jo Davidson, Jacob D. Furst, Brian Konie, Glenn Lancaster, Steven L. Lytinen, Lopa Roychoudhuri, Eric Sedgwick, Noriko Tomuro, Jorge Toro, Rosalee J. Wolfe:
An Improved Articulated Model of the Human Hand. WSCG 2000
1990 – 1999
- 1999
- [i1]Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin:
Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: