Jeff Erickson

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 43

Top Venues

CoRR

SoCG

Discret. Comput. Geom.

Dagstuhl Reports

Publications

Eliot Wong Robson, Sam Ruggerio, Jeff Erickson
FSM Builder: A Tool for Writing Autograded Finite Automata Questions. CoRR (2024)
Eliot Wong Robson, Sam Ruggerio, Jeff Erickson
FSM Builder: A Tool for Writing Autograded Finite Automata Questions. ITiCSE (1) (2024)
Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri
Minimum Cuts in Surface Graphs. SIAM J. Comput. 52 (1) (2023)
Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen
Reconstructing Graphs from Connected Triples. CoRR (2023)
Jeff Erickson, Patrick Lin
Planar and Toroidal Morphs Made Easier. J. Graph Algorithms Appl. 27 (2) (2023)
Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen
Reconstructing Graphs from Connected Triples. WG (2023)
Jeff Erickson, Gabriel Nivasch, Junyan Xu
Fusible numbers and Peano Arithmetic. Log. Methods Comput. Sci. 18 (3) (2022)
Jeff Erickson
The Tragedy of Being Almost but Not Quite Planar (Invited Talk). ISAAC (2022)
Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa
How to Morph Graphs on the Torus. SODA (2021)
Jeff Erickson, Gabriel Nivasch, Junyan Xu
Fusible numbers and Peano Arithmetic. LICS (2021)
Jeff Erickson, Patrick Lin
Planar and Toroidal Morphs Made Easier. CoRR (2021)
Jeff Erickson, Patrick Lin
Planar and Toroidal Morphs Made Easier. Graph Drawing (2021)
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG (2021)
Jeff Erickson, Patrick Lin
A Toroidal Maxwell-Cremona-Delaunay Correspondence. J. Comput. Geom. 12 (2) (2021)
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR (2021)
Jeff Erickson, Patrick Lin
A Toroidal Maxwell-Cremona-Delaunay Correspondence. CoRR (2020)
Jeff Erickson
Chasing Puppies. CCCG (2020)
Jeff Erickson, Yipu Wang
Topologically Trivial Closed Walks in Directed Surface Graphs. Discret. Comput. Geom. 64 (4) (2020)
Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa
How to Morph Graphs on the Torus. CoRR (2020)
Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
Smoothing the gap between NP and ER. FOCS (2020)
Jeff Erickson, Patrick Lin
A Toroidal Maxwell-Cremona-Delaunay Correspondence. SoCG (2020)
Jeff Erickson, Gabriel Nivasch, Junyan Xu
Fusible numbers and Peano Arithmetic. CoRR (2020)
Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
A Framework for Robust Realistic Geometric Computations. CoRR (2019)
Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson
Lower Bounds for Electrical Reduction on Surfaces. SoCG (2019)
Jeff Erickson, Yipu Wang
Topologically Trivial Closed Walks in Directed Surface Graphs. SoCG (2019)
Jeff Erickson
Optimal Curve Straightening is ∃R-Complete. CoRR (2019)
Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri
Minimum Cuts in Surface Graphs. CoRR (2019)
Siu-Wing Cheng, Anne Driemel, Jeff Erickson
Computational Geometry (Dagstuhl Seminar 19181). Dagstuhl Reports 9 (4) (2019)
Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren
Holiest Minimum-Cost Paths and Flows in Surface Graphs. CoRR (2018)
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)
Jeff Erickson, Yipu Wang
Topologically Trivial Closed Walks in Directed Surface Graphs. CoRR (2018)
Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren
Holiest minimum-cost paths and flows in surface graphs. STOC (2018)
Hsien-Chih Chang, Jeff Erickson
Untangling Planar Curves. Discret. Comput. Geom. 58 (4) (2017)
Hsien-Chih Chang, Jeff Erickson
Untangling Planar Curves. CoRR (2017)
Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth
Recognizing Weakly Simple Polygons. Discret. Comput. Geom. 58 (4) (2017)
Glencora Borradaile, Jeff Erickson, Hung Le, Robbie Weber
Embedded-width: A variant of treewidth for plane graphs. CoRR (2017)
Hsien-Chih Chang, Jeff Erickson
Lower Bounds for Planar Electrical Reduction. CoRR (2017)
Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. 25 (2017)
Otfried Cheong, Anne Driemel, Jeff Erickson
Computational Geometry (Dagstuhl Seminar 17171). Dagstuhl Reports 7 (4) (2017)
Hugo Alves Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth
Recognizing Weakly Simple Polygons. SoCG (2016)
Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). Dagstuhl Reports 6 (5) (2016)
Hugo Alves Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth
Recognizing Weakly Simple Polygons. CoRR (2016)
Hsien-Chih Chang, Jeff Erickson
Untangling Planar Curves. SoCG (2016)
Otfried Cheong, Jeff Erickson, Monique Teillaud
Computational Geometry (Dagstuhl Seminar 15111). Dagstuhl Reports 5 (3) (2015)
Hsien-Chih Chang, Jeff Erickson
Electrical Reduction, Homotopy Moves, and Defect. CoRR (2015)
Hsien-Chih Chang, Jeff Erickson, Chao Xu
Detecting Weakly Simple Polygons. SODA (2015)
Jeff Erickson, Anastasios Sidiropoulos
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs. SoCG (2014)
Jeff Erickson
Efficiently Hex-Meshing Things with Topology. Discret. Comput. Geom. 52 (3) (2014)
David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
Necklaces, Convolutions, and X+Y. Algorithmica 69 (2) (2014)
Hsien-Chih Chang, Jeff Erickson, Chao Xu
Detecting Weakly Simple Polygons. CoRR (2014)
Jeff Erickson, Kim Whittlesey
Transforming Curves on Surfaces Redux. SODA (2013)
Jeff Erickson, Amir Nayyeri
Tracing Compressed Curves in Triangulated Surfaces. Discret. Comput. Geom. 49 (4) (2013)
Sergio Cabello, Erin W. Chambers, Jeff Erickson
Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. 42 (4) (2013)
Jeff Erickson
Efficiently hex-meshing things with topology. SoCG (2013)
Jeff Erickson, Anastasios Sidiropoulos
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs CoRR (2013)
Jeff Erickson, Amir Nayyeri
Tracing compressed curves in triangulated surfaces. SCG (2012)
David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
Necklaces, Convolutions, and X+Y CoRR (2012)
Sergio Cabello, Erin W. Chambers, Jeff Erickson
Multiple-Source Shortest Paths in Embedded Graphs CoRR (2012)
Jeff Erickson, Kyle Fox, Amir Nayyeri
Global minimum cuts in surface embedded graphs. SODA (2012)
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
Homology Flows, Cohomology Cuts. SIAM J. Comput. 41 (6) (2012)
Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola
Special Section on Foundations of Computer Science. SIAM J. Comput. 40 (3) (2011)
Jeff Erickson
Shortest non-trivial cycles in directed surface graphs. SCG (2011)
Jeff Erickson, Amir Nayyeri
Computing Replacement Paths in Surface Embedded Graphs. SODA (2011)
Jeff Erickson, Amir Nayyeri
Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. SODA (2011)
Jeff Erickson, Amir Nayyeri
Shortest Non-Crossing Walks in the Plane. SODA (2011)
Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
Finding one tight cycle. ACM Trans. Algorithms 6 (4) (2010)
Erin W. Chambers, Vin de Silva, Jeff Erickson, Robert Ghrist
Vietoris-Rips Complexes of Planar Point Sets. Discret. Comput. Geom. 44 (1) (2010)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43 (3) (2010)
Éric Colin de Verdière, Jeff Erickson
Tightening Nonsimple Paths and Cycles on Surfaces. SIAM J. Comput. 39 (8) (2010)
Jeff Erickson
Maximum Flows and Parametric Shortest Paths in Planar Graphs. SODA (2010)
Jeff Erickson, Pratik Worah
Computing the Shortest Essential Cycle. Discret. Comput. Geom. 44 (4) (2010)
Jeff Erickson
Guest Editor's Foreword. Discret. Comput. Geom. 42 (1) (2009)
Jeff Erickson, Ferran Hurtado, Pat Morin
Centerpoint Theorems for Wedges. Discret. Math. Theor. Comput. Sci. 11 (1) (2009)
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
Homology flows, cohomology cuts. STOC (2009)
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
Minimum cuts and shortest homologous cycles. SCG (2009)
Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides
Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6 (1) (2008)
Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
Finding one tight cycle. SODA (2008)
Erin W. Chambers, Jeff Erickson, Pratik Worah
Testing contractibility in planar rips complexes. SCG (2008)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
Walking your dog in the woods in polynomial time. SCG (2008)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey
Splitting (complicated) surfaces is hard. Comput. Geom. 41 (1-2) (2008)
Olivier Devillers, Jeff Erickson, Xavier Goaoc
Empty-ellipse graphs. SODA (2008)
Jeff Erickson
Finding Small Holes. WADS (2007)
Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce
Capturing a Convex Object With Three Discs. IEEE Trans. Robotics 23 (6) (2007)
Jeff Erickson, Sariel Har-Peled, David M. Mount
On the Least Median Square Problem. Discret. Comput. Geom. 36 (4) (2006)
Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
Minimum-Cost Coverage of Point Sets by Disks CoRR (2006)
David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
. ESA (2006)
Éric Colin de Verdière, Jeff Erickson
Tightening non-simple paths and cycles on surfaces. SODA (2006)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey
Splitting (complicated) surfaces is hard. SCG (2006)
Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
Minimum-cost coverage of point sets by disks. SCG (2006)
Jeff Erickson
Local polyhedra and geometric graphs. Comput. Geom. 31 (1-2) (2005)
Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
Building spacetime meshes over arbitrary spatial domains. Eng. Comput. 20 (4) (2005)
Jeff Erickson
Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". Discret. Comput. Geom. 33 (1) (2005)
Jeff Erickson, Kim Whittlesey
Greedy optimal homotopy and homology generators. SODA (2005)
Jeff Erickson, Shripad Thite, David P. Bunde
Distance-2 Edge Coloring is NP-Complete CoRR (2005)
David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. 33 (4) (2005)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. 15 (4) (2005)
Jeff Erickson
Lower bounds for external algebraic decision trees. SODA (2005)
Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang
Kinetic collision detection between two simple polygons. Comput. Geom. 27 (3) (2004)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
Separating point sets in polygonal environments. SCG (2004)
Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert B. Haber, John M. Sullivan, Shripad Thite, Yuan Zhou
Spacetime meshing with adaptive refinement and coarsening. SCG (2004)

Jeff Erickson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jeff Erickson