Jeff Erickson - RankMe

169 papers A* 39A 3B 5Journal 89Unranked 30

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Measuring Students' Perceptions of an Autograded Scaffolding Tool for Students Performing at All Levels in an Algorithms Class. SIGCSE (1) Yael Gertner, Brad Solomon, Hongxuan Chen, Eliot W. Robson, Carl Evans, Jeff Erickson
2026	—	`conf`	Pedagogy in Theory of Computing and Algorithms. SIGCSE (2) Ryan E. Dougherty, Jeff Erickson, Tim Randolph, Michael Shindler
2025	—	`conf`	Novice Difficulties in Graph Layering for Algorithm Design. SIGCSE (2) Hongxuan Chen, Katherine Braught, Geoffrey L. Herman, Jeff Erickson
2025	A*	`conf`	Shelling and Sinking Graphs on the Sphere. SoCG Jeff Erickson, Christian Howard
2025	J	`jnl`	Shelling and Sinking Graphs on the Sphere. CoRR Jeff Erickson, Christian Howard
2024	—	`conf`	A Survey of Undergraduate Theory of Computation Curricula in the United States. SIGCSE Virtual (Working Group Reports) Ryan E. Dougherty, Tim Randolph, Tzu-Yi Chen, Jeff Erickson, Matthew Ferland, Dennis Komm, Jonathan Liu, Timothy Ng, Ana Smaranda Sandu, Michael Shindler, Edward Talmage, Thomas Zeume
2024	—	`conf`	A Survey of Undergraduate Theory of Computing Curricula. SIGCSE Virtual (2) 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
2024	—	`conf`	FSM Builder: A Tool for Writing Autograded Finite Automata Questions. ITiCSE (1) Eliot Wong Robson, Sam Ruggerio, Jeff Erickson
2024	J	`jnl`	FSM Builder: A Tool for Writing Autograded Finite Automata Questions. CoRR Eliot Wong Robson, Sam Ruggerio, Jeff Erickson
2024	J	`jnl`	Smoothing the Gap Between NP and ER. SIAM J. Comput. Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
2023	J	`jnl`	Minimum Cuts in Surface Graphs. SIAM J. Comput. Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri
2023	J	`jnl`	Planar and Toroidal Morphs Made Easier. J. Graph Algorithms Appl. Jeff Erickson, Patrick Lin
2023	B	`conf`	Reconstructing Graphs from Connected Triples. WG Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen
2023	J	`jnl`	Reconstructing Graphs from Connected Triples. CoRR Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen
2022	J	`jnl`	Fusible numbers and Peano Arithmetic. Log. Methods Comput. Sci. Jeff Erickson, Gabriel Nivasch, Junyan Xu
2022	B	`conf`	The Tragedy of Being Almost but Not Quite Planar (Invited Talk). ISAAC Jeff Erickson
2021	J	`jnl`	A Toroidal Maxwell-Cremona-Delaunay Correspondence. J. Comput. Geom. Jeff Erickson, Patrick Lin
2021	A*	`conf`	Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
2021	J	`jnl`	Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
2021	J	`jnl`	Chasing Puppies: Mobile Beacon Routing on Closed Curves. J. Comput. Geom. Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Till Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
2021	A*	`conf`	Fusible numbers and Peano Arithmetic. LICS Jeff Erickson, Gabriel Nivasch, Junyan Xu
2021	A*	`conf`	How to Morph Graphs on the Torus. SODA Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa
2021	A	`conf`	Planar and Toroidal Morphs Made Easier. GD Jeff Erickson, Patrick Lin
2021	J	`jnl`	Planar and Toroidal Morphs Made Easier. CoRR Jeff Erickson, Patrick Lin
2020	A*	`conf`	A Toroidal Maxwell-Cremona-Delaunay Correspondence. SoCG Jeff Erickson, Patrick Lin
2020	J	`jnl`	A Toroidal Maxwell-Cremona-Delaunay Correspondence. CoRR Jeff Erickson, Patrick Lin
2020	—	`conf`	Chasing Puppies. CCCG Jeff Erickson
2020	J	`jnl`	Fusible numbers and Peano Arithmetic. CoRR Jeff Erickson, Gabriel Nivasch, Junyan Xu
2020	J	`jnl`	How to Morph Graphs on the Torus. CoRR Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa
2020	A*	`conf`	Smoothing the gap between NP and ER. FOCS Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
2020	J	`jnl`	Topologically Trivial Closed Walks in Directed Surface Graphs. Discret. Comput. Geom. Jeff Erickson, Yipu Wang
2019	J	`jnl`	A Framework for Robust Realistic Geometric Computations. CoRR Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
2019	—	`book`	Algorithms Jeff Erickson
2019	J	`jnl`	Computational Geometry (Dagstuhl Seminar 19181). Dagstuhl Reports Siu-Wing Cheng, Anne Driemel, Jeff Erickson
2019	A*	`conf`	Lower Bounds for Electrical Reduction on Surfaces. SoCG Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson
2019	J	`jnl`	Minimum Cuts in Surface Graphs. CoRR Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri
2019	J	`jnl`	Optimal Curve Straightening is ∃R-Complete. CoRR Jeff Erickson
2019	A*	`conf`	Topologically Trivial Closed Walks in Directed Surface Graphs. SoCG Jeff Erickson, Yipu Wang
2018	J	`jnl`	Holiest Minimum-Cost Paths and Flows in Surface Graphs. CoRR Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren
2018	A*	`conf`	Holiest minimum-cost paths and flows in surface graphs. STOC Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren
2018	A*	`conf`	Tightening Curves on Surfaces via Local Moves. SODA Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann
2018	J	`jnl`	Topologically Trivial Closed Walks in Directed Surface Graphs. CoRR Jeff Erickson, Yipu Wang
2017	J	`jnl`	Computational Geometry (Dagstuhl Seminar 17171). Dagstuhl Reports Otfried Cheong, Anne Driemel, Jeff Erickson
2017	J	`jnl`	Embedded-width: A variant of treewidth for plane graphs. CoRR Glencora Borradaile, Jeff Erickson, Hung Le, Robbie Weber
2017	J	`jnl`	Lower Bounds for Planar Electrical Reduction. CoRR Hsien-Chih Chang, Jeff Erickson
2017	J	`jnl`	Recognizing Weakly Simple Polygons. Discret. Comput. Geom. Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth
2017	J	`jnl`	Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
2017	J	`jnl`	Untangling Planar Curves. CoRR Hsien-Chih Chang, Jeff Erickson
2017	J	`jnl`	Untangling Planar Curves. Discret. Comput. Geom. Hsien-Chih Chang, Jeff Erickson
2016	J	`jnl`	Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). Dagstuhl Reports Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu
2016	—	`ch.`	Global Minimum Cuts in Surface-Embedded Graphs. Encyclopedia of Algorithms Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri
2016	A*	`conf`	Recognizing Weakly Simple Polygons. SoCG Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth
2016	J	`jnl`	Recognizing Weakly Simple Polygons. CoRR Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth
2016	A*	`conf`	Untangling Planar Curves. SoCG Hsien-Chih Chang, Jeff Erickson
2015	J	`jnl`	Computational Geometry (Dagstuhl Seminar 15111). Dagstuhl Reports Otfried Cheong, Jeff Erickson, Monique Teillaud
2015	A*	`conf`	Detecting Weakly Simple Polygons. SODA Hsien-Chih Chang, Jeff Erickson, Chao Xu
2015	J	`jnl`	Electrical Reduction, Homotopy Moves, and Defect. CoRR Hsien-Chih Chang, Jeff Erickson
2014	A*	`conf`	A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs. SoCG Jeff Erickson, Anastasios Sidiropoulos
2014	J	`jnl`	Detecting Weakly Simple Polygons. CoRR Hsien-Chih Chang, Jeff Erickson, Chao Xu
2014	J	`jnl`	Efficiently Hex-Meshing Things with Topology. Discret. Comput. Geom. Jeff Erickson
2014	J	`jnl`	Necklaces, Convolutions, and X+Y. Algorithmica David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2013	J	`jnl`	A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs CoRR Jeff Erickson, Anastasios Sidiropoulos
2013	A*	`conf`	Efficiently hex-meshing things with topology. SoCG Jeff Erickson
2013	J	`jnl`	Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. Sergio Cabello, Erin W. Chambers, Jeff Erickson
2013	J	`jnl`	Tracing Compressed Curves in Triangulated Surfaces. Discret. Comput. Geom. Jeff Erickson, Amir Nayyeri
2013	A*	`conf`	Transforming Curves on Surfaces Redux. SODA Jeff Erickson, Kim Whittlesey
2012	A*	`conf`	Global minimum cuts in surface embedded graphs. SODA Jeff Erickson, Kyle Fox, Amir Nayyeri
2012	J	`jnl`	Homology Flows, Cohomology Cuts. SIAM J. Comput. Erin W. Chambers, Jeff Erickson, Amir Nayyeri
2012	J	`jnl`	Multiple-Source Shortest Paths in Embedded Graphs CoRR Sergio Cabello, Erin W. Chambers, Jeff Erickson
2012	J	`jnl`	Necklaces, Convolutions, and X+Y CoRR David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2012	—	`conf`	Tracing compressed curves in triangulated surfaces. SCG Jeff Erickson, Amir Nayyeri
2011	A*	`conf`	Computing Replacement Paths in Surface Embedded Graphs. SODA Jeff Erickson, Amir Nayyeri
2011	A*	`conf`	Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. SODA Jeff Erickson, Amir Nayyeri
2011	A*	`conf`	Shortest Non-Crossing Walks in the Plane. SODA Jeff Erickson, Amir Nayyeri
2011	—	`conf`	Shortest non-trivial cycles in directed surface graphs. SCG Jeff Erickson
2011	J	`jnl`	Special Section on Foundations of Computer Science. SIAM J. Comput. Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola
2010	J	`jnl`	Computing the Shortest Essential Cycle. Discret. Comput. Geom. Jeff Erickson, Pratik Worah
2010	J	`jnl`	Finding one tight cycle. ACM Trans. Algorithms Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
2010	J	`jnl`	Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
2010	A*	`conf`	Maximum Flows and Parametric Shortest Paths in Planar Graphs. SODA Jeff Erickson
2010	J	`jnl`	Tightening Nonsimple Paths and Cycles on Surfaces. SIAM J. Comput. Éric Colin de Verdière, Jeff Erickson
2010	J	`jnl`	Vietoris-Rips Complexes of Planar Point Sets. Discret. Comput. Geom. Erin W. Chambers, Vin de Silva, Jeff Erickson, Robert Ghrist
2009	J	`jnl`	Centerpoint Theorems for Wedges. Discret. Math. Theor. Comput. Sci. Jeff Erickson, Ferran Hurtado, Pat Morin
2009	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. Jeff Erickson
2009	A*	`conf`	Homology flows, cohomology cuts. STOC Erin W. Chambers, Jeff Erickson, Amir Nayyeri
2009	—	`conf`	Minimum cuts and shortest homologous cycles. SCG Erin W. Chambers, Jeff Erickson, Amir Nayyeri
2008	A*	`conf`	Empty-ellipse graphs. SODA Olivier Devillers, Jeff Erickson, Xavier Goaoc
2008	A*	`conf`	Finding one tight cycle. SODA Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
2008	J	`jnl`	Realizing partitions respecting full and partial order information. J. Discrete Algorithms Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides
2008	J	`jnl`	Splitting (complicated) surfaces is hard. Comput. Geom. Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey
2008	—	`conf`	Testing contractibility in planar rips complexes. SCG Erin W. Chambers, Jeff Erickson, Pratik Worah
2008	—	`conf`	Walking your dog in the woods in polynomial time. SCG Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
2007	J	`jnl`	Capturing a Convex Object With Three Discs. IEEE Trans. Robotics Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce
2007	B	`conf`	Finding Small Holes. WADS Jeff Erickson
2007	—	`ed.`	Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007 SCG Jeff Erickson
2006	J	`jnl`	Minimum-Cost Coverage of Point Sets by Disks CoRR Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
2006	—	`conf`	Minimum-cost coverage of point sets by disks. SCG Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
2006	A	`conf`	Necklaces, Convolutions, and ESA David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
2006	J	`jnl`	On the Least Median Square Problem. Discret. Comput. Geom. Jeff Erickson, Sariel Har-Peled, David M. Mount
2006	—	`conf`	Splitting (complicated) surfaces is hard. SCG Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey
2006	A*	`conf`	Tightening non-simple paths and cycles on surfaces. SODA Éric Colin de Verdière, Jeff Erickson
2005	J	`jnl`	Building spacetime meshes over arbitrary spatial domains. Eng. Comput. Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
2005	J	`jnl`	Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". Discret. Comput. Geom. Jeff Erickson
2005	J	`jnl`	Distance-2 Edge Coloring is NP-Complete CoRR Jeff Erickson, Shripad Thite, David P. Bunde
2005	A*	`conf`	Greedy optimal homotopy and homology generators. SODA Jeff Erickson, Kim Whittlesey
2005	J	`jnl`	Local polyhedra and geometric graphs. Comput. Geom. Jeff Erickson
2005	A*	`conf`	Lower bounds for external algebraic decision trees. SODA Jeff Erickson
2005	J	`jnl`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2005	J	`jnl`	Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2004	—	`conf`	Automatic Blocking Scheme for Structured Meshing in 2d Multiphase Flow Simulation. IMR Damrong Guoy, Jeff Erickson
2004	A	`conf`	Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
2004	J	`jnl`	Kinetic collision detection between two simple polygons. Comput. Geom. Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang
2004	—	`conf`	On the least median square problem. SCG Jeff Erickson, Sariel Har-Peled, David M. Mount
2004	J	`jnl`	Optimally Cutting a Surface into a Disk. Discret. Comput. Geom. Jeff Erickson, Sariel Har-Peled
2004	—	`conf`	Separating point sets in polygonal environments. SCG Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2004	—	`conf`	Spacetime meshing with adaptive refinement and coarsening. SCG Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert B. Haber, John M. Sullivan, Shripad Thite, Yuan Zhou
2003	A*	`conf`	Capturing a convex object with three discs. ICRA Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce
2003	J	`jnl`	Indexing Moving Points. J. Comput. Syst. Sci. Pankaj K. Agarwal, Lars Arge, Jeff Erickson
2003	—	`conf`	Local polyhedra and geometric graphs. SCG Jeff Erickson
2003	J	`jnl`	Nice Point Sets Can Have Nasty Delaunay Triangulations. Discret. Comput. Geom. Jeff Erickson
2003	—	`conf`	On the Complexity of Halfspace Volume Queries. CCCG Erik D. Demaine, Jeff Erickson, Stefan Langerman
2003	B	`conf`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2003	J	`jnl`	Preprocessing chains for fast dihedral rotations is hard or even impossible. Comput. Geom. Michael A. Soss, Jeff Erickson, Mark H. Overmars
2002	J	`jnl`	Algorithmic issues in modeling motion. ACM Comput. Surv. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson
2002	—	`conf`	Building Space-Time Meshes Over Arbitrary Spatial Domains. IMR Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
2002	J	`jnl`	Building Space-Time Meshes over Arbitrary Spatial Domains CoRR Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
2002	A*	`conf`	Dense point sets have sparse Delaunay triangulations: or "... but not too nasty". SODA Jeff Erickson
2002	B	`conf`	Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 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	J	`jnl`	Flipping Cubical Meshes. Eng. Comput. Marshall W. Bern, David Eppstein, Jeff Erickson
2002	J	`jnl`	Flipturning Polygons. Discret. Comput. Geom. Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint
2002	J	`jnl`	Optimally cutting a surface into a disk CoRR Jeff Erickson, Sariel Har-Peled
2002	—	`conf`	Optimally cutting a surface into a disk. SCG Jeff Erickson, Sariel Har-Peled
2002	J	`jnl`	Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible CoRR Michael A. Soss, Jeff Erickson, Mark H. Overmars
2002	—	`conf`	Vertex-unfoldings of simplicial manifolds. SCG Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2001	J	`jnl`	Dense point sets have sparse Delaunay triangulations CoRR Jeff Erickson
2001	J	`jnl`	Flipping Cubical Meshes CoRR Marshall W. Bern, David Eppstein, Jeff Erickson
2001	J	`jnl`	Nice point sets can have nasty Delaunay triangulations CoRR Jeff Erickson
2001	—	`conf`	Nice point sets can have nasty Delaunay triangulations. SCG Jeff Erickson
2001	J	`jnl`	Reconfiguring convex polygons. Comput. Geom. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
2001	J	`jnl`	Vertex-Unfoldings of Simplicial Manifolds CoRR Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2001	J	`jnl`	Vertex-Unfoldings of Simplicial Polyhedra CoRR Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2000	J	`jnl`	Efficient Searching with Linear Constraints. J. Comput. Syst. Sci. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
2000	A*	`conf`	Finite-resolution hidden surface removal. SODA Jeff Erickson
2000	J	`jnl`	Flipturning polygons CoRR Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint
2000	A*	`conf`	Indexing Moving Points. PODS Pankaj K. Agarwal, Lars Arge, Jeff Erickson
2000	—	`conf`	Reconfiguring Convex Polygons. CCCG Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
2000	J	`jnl`	Space-Time Tradeoffs for Emptiness Queries. SIAM J. Comput. Jeff Erickson
1999	J	`jnl`	Bounds for Linear Satisfiability Problems. Chic. J. Theor. Comput. Sci. Jeff Erickson
1999	J	`jnl`	Finite-resolution hidden surface removal CoRR Jeff Erickson
1999	A*	`conf`	Kinetic Collision Detection Between Two Simple Polygons. SODA Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang
1999	J	`jnl`	New Lower Bounds for Convex Hull Problems in Odd Dimensions. SIAM J. Comput. Jeff Erickson
1999	J	`jnl`	Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discret. Comput. Geom. David Eppstein, Jeff Erickson
1999	A*	`conf`	Separation-Sensitive Collision Detection for Convex Objects. SODA Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang
1998	A*	`conf`	Efficient Searching with Linear Constraints. PODS Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
1998	A*	`conf`	Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). SODA Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas
1998	—	`conf`	Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. SCG David Eppstein, Jeff Erickson
1998	J	`jnl`	Separation-Sensitive Collision Detection for Convex Objects CoRR Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang
1997	J	`jnl`	Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discret. Comput. Geom. Jeff Erickson, Raimund Seidel
1997	—	`conf`	Space-Time Tradeoffs for Emptiness Queries (Extended Abstract). SCG Jeff Erickson
1996	A*	`conf`	Better Lower Bounds for Halfspace Emptiness. FOCS Jeff Erickson
1996	—	`conf`	New Lower Bounds for Convex Hull Problems in Odd Dimensions. SCG Jeff Erickson
1996	J	`jnl`	New Lower Bounds for Hopcroft's Problem. Discret. Comput. Geom. Jeff Erickson
1995	J	`jnl`	Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discret. Comput. Geom. Jeff Erickson, Raimund Seidel
1995	A*	`conf`	Lower Bounds for Linear Satisfiability Problems. SODA Jeff Erickson
1995	—	`conf`	New Lower Bounds for Hopcroft's Problem (Extended Abstract). SCG Jeff Erickson
1995	—	`conf`	On the relative complexities of some geometric problems. CCCG Jeff Erickson
1994	J	`jnl`	Iterated Nearest Neighbors and Finding Minimal Polytopes. Discret. Comput. Geom. David Eppstein, Jeff Erickson
1993	A*	`conf`	Better Lower Bounds on Detecting Affine and Spherical Degeneracies FOCS Jeff Erickson, Raimund Seidel
1993	A*	`conf`	Iterated Nearest Neighbors and Finding Minimal Polytopes. SODA David Eppstein, Jeff Erickson