Jeff Erickson
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
43
Venues
13
Active years
1993–2026
Best venue rank
A*
Where they publish
Papers
43 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SIGCSE | Pedagogy in Theory of Computing and Algorithms. | Ryan E. Dougherty, Jeff Erickson, Tim Randolph, Michael Shindler |
| 2026 | SIGCSE | Measuring Students' Perceptions of an Autograded Scaffolding Tool for Students Performing at All Levels in an Algorithms Class. | Yael Gertner, Brad Solomon, Hongxuan Chen, Eliot W. Robson, Carl Evans, Jeff Erickson |
| 2025 | SIGCSE | Novice Difficulties in Graph Layering for Algorithm Design. | Hongxuan Chen, Katherine Braught, Geoffrey L. Herman, Jeff Erickson |
| 2024 | ITiCSE | FSM Builder: A Tool for Writing Autograded Finite Automata Questions. | Eliot Wong Robson, Sam Ruggerio, Jeff Erickson |
| 2024 | SIGCSE | A Survey of Undergraduate Theory of Computing Curricula. | Ryan E. Dougherty, Tim Randolph, Tzu-Yi Chen, Jeff Erickson, Matthew Ferland, Dennis Komm, Jonathan Liu, Timothy Ng, Seth Poulsen, Smaranda Sandu, Michael Shindler, Edward Talmage, Thomas Zeume |
| 2023 | WG | Reconstructing Graphs from Connected Triples. | Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen |
| 2022 | ISAAC | The Tragedy of Being Almost but Not Quite Planar (Invited Talk). | Jeff Erickson |
| 2021 | GD | Planar and Toroidal Morphs Made Easier. | Jeff Erickson, Patrick Lin |
| 2021 | LICS | Fusible numbers and Peano Arithmetic. | Jeff Erickson, Gabriel Nivasch, Junyan Xu |
| 2021 | SODA | How to Morph Graphs on the Torus. | Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa |
| 2020 | FOCS | Smoothing the gap between NP and ER. | Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow |
| 2018 | SODA | Tightening Curves on Surfaces via Local Moves. | Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann |
| 2018 | STOC | Holiest minimum-cost paths and flows in surface graphs. | Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren |
| 2015 | SODA | Detecting Weakly Simple Polygons. | Hsien-Chih Chang, Jeff Erickson, Chao Xu |
| 2013 | SODA | Transforming Curves on Surfaces Redux. | Jeff Erickson, Kim Whittlesey |
| 2012 | SODA | Global minimum cuts in surface embedded graphs. | Jeff Erickson, Kyle Fox, Amir Nayyeri |
| 2011 | SODA | Shortest Non-Crossing Walks in the Plane. | Jeff Erickson, Amir Nayyeri |
| 2011 | SODA | Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. | Jeff Erickson, Amir Nayyeri |
| 2011 | SODA | Computing Replacement Paths in Surface Embedded Graphs. | Jeff Erickson, Amir Nayyeri |
| 2010 | SODA | Maximum Flows and Parametric Shortest Paths in Planar Graphs. | Jeff Erickson |
| 2009 | STOC | Homology flows, cohomology cuts. | Erin W. Chambers, Jeff Erickson, Amir Nayyeri |
| 2008 | SODA | Finding one tight cycle. | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar |
| 2008 | SODA | Empty-ellipse graphs. | Olivier Devillers, Jeff Erickson, Xavier Goaoc |
| 2007 | WADS | Finding Small Holes. | Jeff Erickson |
| 2006 | ESA | Necklaces, Convolutions, and | David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian |
| 2006 | SODA | Tightening non-simple paths and cycles on surfaces. | ric Colin de Verdire, Jeff Erickson |
| 2005 | SODA | Lower bounds for external algebraic decision trees. | Jeff Erickson |
| 2005 | SODA | Greedy optimal homotopy and homology generators. | Jeff Erickson, Kim Whittlesey |
| 2004 | ESA | Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. | Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu |
| 2003 | ICRA | Capturing a convex object with three discs. | Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce |
| 2003 | WADS | Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. | David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint |
| 2002 | ISAAC | Flat-State Connectivity of Linkages under Dihedral Motions. | Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint |
| 2002 | SODA | Dense point sets have sparse Delaunay triangulations: or "... but not too nasty". | Jeff Erickson |
| 2000 | PODS | Indexing Moving Points. | Pankaj K. Agarwal, Lars Arge, Jeff Erickson |
| 2000 | SODA | Finite-resolution hidden surface removal. | Jeff Erickson |
| 1999 | SODA | Kinetic Collision Detection Between Two Simple Polygons. | Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang |
| 1999 | SODA | Separation-Sensitive Collision Detection for Convex Objects. | Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang |
| 1998 | PODS | Efficient Searching with Linear Constraints. | Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter |
| 1998 | SODA | Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). | Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas |
| 1996 | FOCS | Better Lower Bounds for Halfspace Emptiness. | Jeff Erickson |
| 1995 | SODA | Lower Bounds for Linear Satisfiability Problems. | Jeff Erickson |
| 1993 | FOCS | Better Lower Bounds on Detecting Affine and Spherical Degeneracies | Jeff Erickson, Raimund Seidel |
| 1993 | SODA | Iterated Nearest Neighbors and Finding Minimal Polytopes. | David Eppstein, Jeff Erickson |