Jeff G Erickson
Primary Research Area
- Theory and Algorithms
- Ph.D., Computer Science, University of California, Berkeley, July 1996
- M.S., Information and Computer Science, University of California, Irvine, June 1992
- B.A., Computer Science and Mathematical Sciences (double major), Rice University, May 1987
I am a full professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign, where I have been on the faculty since 1998. I have published over 100 technical papers in computational geometry, computational topology, and related research areas. I am also the author of a popular collection of free algorithms course materials. My awards include a Sloan Research Fellowship, an NSF CAREER award, and multiple teaching and research awards from the University of Illinois. Please see http://jeffe.cs.illinois.edu/cv.pdf for a detailed curriculum vit/p>
- Professor, University of Illinois at Urbana-Champaign, 2010-present
- Associate Professor (tenured), University of Illinois at Urbana-Champaign, 2004-2010
- Assistant Professor, University of Illinois at Urbana-Champaign, August 1998-2004
For more information
I primarily teach courses in algorithms. A complete archive of my algorithms course materials, including more than 1200 pages of lecture notes, homework and discussion exercises, and past exams, is freely available at http://jeffe.cs.illinois.edu/teaching/algorithms/. Please send me bug reports!
For a complete overview of my research activities, please see my publication archive athttp://jeffe.cs.illinois.edu/pubs/.
Undergraduate Research Opportunities
Are you an independent, curious, intellectually mature student? Are you interested in algorithms? Come talk to me!
- Applications of geometry, topology, and optimization to computer graphics, robotics, spatial databases, and mesh generation
- Combinatorial optimization
- Computational and discrete geometry and topology
- Algorithms, data structures, and lower bounds
Selected Articles in Journals
- Jeff Erickson. Efficiently hex-meshing things with topology. Discrete & Computational Geometry 52(3):427449, 2014,special issue of invited papers from the 29th Symposium on Computational Geometry.
- David Bremner, Timothy M. Chan, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Pǎtraşcu, and Perouz Taslakian. Necklaces, convolutions, and X + Y. Algorithmica 69(2): 294–314, 2014.
- Jeff Erickson and Amir Nayyeri.Tracing compressed curves in triangulated surfaces. Discrete & Computational Geometry 49(4):823--863, 2013, special issue of invited papers from the 28th Symposium on Computational Geometry.
- Sergio Cabello, Erin W. Chambers, and Jeff Erickson. Multiple-source shortest paths in surface-embedded graphs. SIAM Journal on Computing, 42(4):1542--1571, 2013. ArXiv:1202.0314.
- Erin W. Chambers, Jeff Erickson, and Amir Nayyeri. Homology flows, cohomology cuts.SIAM Journal on Computing41(6):16051634, 2012, special section of invited papers from the 41st Annual ACM Symposium on Theory of Computing.
- ic Colin de Verdi and Jeff Erickson. Tightening non-simple paths and cycles on surfaces. SIAM Journal on Computing 39(8):37843813, 2010.
- Erin W. Chambers, ic Colin de Verdi, Jeff Erickson, Sylvain Lazard, Francis Lazarus, and Shripad Thite. Homotopic Fret distance, or Walking your dog in the woods in polynomial time. Computational Geometry: Theory and Applications, 43(3):295311, 2010, Special issue of invited papers from the 24th Annual ACM Symposium on Computational Geometry.
- Jeff Erickson. Dense point sets have sparse Delaunay triangulations. Discrete & Computational Geometry 33:83115, 2005.
- Jeff Erickson and Sariel Har-Peled. Optimally cutting a surface into a disk. Discrete & Computational Geometry 31(1):3759, 2004. Special issue of invited papers from the 18th Annual ACM Symposium on Computational Geometry.
Articles in Conference Proceedings
- Jeff Erickson and Kim Whittlesey. Transforming curves on surfaces redux. Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms, 1646–1655, 2013.
- Jeff Erickson and Amir Nayyeri. Minimum cuts and shortest non-separating cycles via homology covers. Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, 11661176, 2011.
- Jeff Erickson. Maximum flows and parametric shortest paths in planar graphs. Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms, 794804, 2010
- Jeff Erickson and Kim Whittlesey. Greedy optimal homotopy and homology generators. Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 10381046, 2005.
- Jeff Erickson. Algorithms, etc. Lecture notes (639 pages) and homework/exam/discussion problems (611 pages), last revised January 2015. Freely available at http://jeffe.cs.illinois.edu/teaching/algorithms/
Conferences Organized or Chaired
- Organizing committee, Dagstuhl Seminar on Computational Geometry (2017)
- Program committee, 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) submission forbidden
- Organizing committee, Oberwolfach Seminar on Computational Geometric and Algebraic Topology (2015)
- Workshop committee chair,30th Annual Symposium on Computational Geometry (SOCG 2014)
- Steering committee chair, Symposium on Computational Geometry (SOCG), 20132016 committee members elected by the research community, officers elected by the committee. Oversaw the 2014 community vote ending SOCGs 30-year affiliation with ACM; for details, see http://makingsocg.wordpress.com for details.
- Program committee chair, 23rd Annual ACM Symposium on Computational Geometry (SOCG 2007)
- Campus Award For Excellence in Undergraduate Teaching, May 2007
- Everitt Award for Teaching Excellence, College of Engineering, April 2001
- (Incomplete) List of Teachers Ranked as Excellent by Their Students Spring 1999, Fall 2000, Spring 2001 (outstanding rating), Fall 2001, Fall 2005, Fall 2006, Spring 2007, Spring 2008, Spring 2010, Fall 2010, Spring 2011, Fall 2012, Fall 2013, Fall 2014, Spring 2015 (with outstanding rating), and Fall 2015
- NSF Career Award (CCR-0093348), 2001-2006
- Alfred P. Sloan Research Fellowship, 1999-2001