Emerging Challenges in Computational Topology - 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; et al. (CoRR, 1999)

An Improved Articulated Model of the Human Hand. - John McDonald 004; 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; et al. (WSCG, 2000)

A graphical environment for transcription of american sign language. - 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; et al. (CATA, 2001)

Toward the Effective Animation of American Sign Language. - 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; et al. (WSCG, 2001)

An improved articulated model of the human hand. - John McDonald 004; Jorge Toro; Karen Alkoby; André Berthiaume; Roymieco Carter; Pattaraporn Chomwong; Juliet Christopher; Mary Jo Davidson; Jacob D. Furst; Brian Konie; Glenn Lancaster; Lopa Roychoudhuri; et al. (Vis. Comput., 2001)

Algorithms for Normal Curves and Surfaces. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (COCOON, 2002)

Genus Characterizes the Complexity of Graph Problems: Some Tight Results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (ICALP, 2003)

Curricular Considerations for Supporting Careers in Computer Graphics. - Rosalee J. Wolfe; Steve Luecking; John McDonald 004; Jacob D. Furst; Eric Sedgwick; Roymieco Carter; Nedjla Ougouag-Tiouririne (Comput. Sci. Educ., 2003)

Recognizing string graphs in NP. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (J. Comput. Syst. Sci., 2003)

Spiralling and Folding: The Topological View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (CCCG, 2007)

Folding and Spiralling: The Word View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Electron. Notes Discret. Math., 2007)

Genus characterizes the complexity of certain graph problems: Some tight results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (J. Comput. Syst. Sci., 2007)

Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (CCCG, 2008)

Spiraling and Folding: The Word View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Algorithmica, 2011)

Untangling Two Systems of Noncrossing Curves. - Jirí Matousek 001; Eric Sedgwick; Martin Tancer; Uli Wagner 001 (GD, 2013)

Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. - Jonathan Spreer; Uli Wagner 001; Benjamin A. Burton; Satoshi Murai; Eric Sedgwick; Henry Segerman (CoRR, 2014)

Computing the Flip Distance Between Triangulations. - Iyad A. Kanj; Eric Sedgwick; Ge Xia (Discret. Comput. Geom., 2017)

Tightening Curves on Surfaces via Local Moves. - Hsien-Chih Chang; Jeff Erickson 001; David Letscher; Arnaud de Mesmay; Saul Schleimer; Eric Sedgwick; Dylan Thurston; Stephan Tillmann (SODA, 2018)

Embeddability in the 3-Sphere Is Decidable. - Jirí Matousek 001; Eric Sedgwick; Martin Tancer; Uli Wagner 001 (J. ACM, 2018)

The Unbearable Hardness of Unknotting. - Arnaud de Mesmay; Yo'av Rieck; Eric Sedgwick; Martin Tancer (SoCG, 2019)

Link Crossing Number is NP-hard. - Arnaud de Mesmay; Marcus Schaefer 001; Eric Sedgwick (CoRR, 2019)

On the tree-width of knot diagrams. - Saul Schleimer; Arnaud de Mesmay; Jessica S. Purcell; Eric Sedgwick (J. Comput. Geom., 2019)

Embeddability in R3 is NP-hard. - Arnaud de Mesmay; Yo'av Rieck; Eric Sedgwick; Martin Tancer (J. ACM, 2020)

Spiraling and Folding: The Topological View. - Jan Kyncl; Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Discret. Comput. Geom., 2024)

Hard Diagrams of the Unknot. - Benjamin A. Burton; Hsien-Chih Chang; Maarten Löffler; Clément Maria; Arnaud de Mesmay; Saul Schleimer; Eric Sedgwick; Jonathan Spreer (Exp. Math., 2024)

A Practical Algorithm for Knot Factorisation. - Alexander He 001; Eric Sedgwick; Jonathan Spreer (SoCG, 2025)