Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Jeff
Last name:	Erickson
DBLP:	e/JeffErickson
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 102  

Select a publication
Show	Title	Venue	Rating	Date
	Journal article Jeff Erickson, Anastasios Sidiropoulos. A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs	CoRR 2013, Volume 0	(0)	2013
	Conference paper Jeff Erickson, Kim Whittlesey. Transforming Curves on Surfaces Redux.	Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013	(0)	2013
	Conference paper Jeff Erickson, Amir Nayyeri. Tracing compressed curves in triangulated surfaces.	Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC, USA, June 17-20, 2012 2012	(0)	2012
	Conference paper Sergio Cabello, Erin W. Chambers, Jeff Erickson. Multiple-Source Shortest Paths in Embedded Graphs	CoRR 2012, Volume 0	(0)	2012
	Conference paper Jeff Erickson, Kyle Fox, Amir Nayyeri. Global minimum cuts in surface embedded graphs.	Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012	(0)	2012
	Journal article 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, Volume 0	(0)	2012
	Conference paper Erin W. Chambers, Jeff Erickson, Amir Nayyeri. Homology Flows, Cohomology Cuts.	SIAM J. Comput. 2012, Volume 41	(0)	2012
	Conference paper Jeff Erickson, Amir Nayyeri. Computing Replacement Paths in Surface Embedded Graphs.	Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011	(0)	2011
	Conference paper Jeff Erickson, Amir Nayyeri. Shortest Non-Crossing Walks in the Plane.	Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011	(0)	2011
	Conference paper Jeff Erickson, Amir Nayyeri. Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers.	Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011	(0)	2011
	Conference paper Jeff Erickson. Shortest non-trivial cycles in directed surface graphs.	Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011 2011	(0)	2011
	Conference paper Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola. Special Section on Foundations of Computer Science.	SIAM J. Comput. 2011, Volume 40	(0)	2011
	Conference paper Jeff Erickson. Maximum Flows and Parametric Shortest Paths in Planar Graphs.	Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010	(0)	2010
	Conference paper Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar. Finding one tight cycle.	ACM Transactions on Algorithms 2009, Volume 6	(0)	2010
	Journal article Erin W. Chambers, Vin de Silva, Jeff Erickson, Robert Ghrist. Vietoris-Rips Complexes of Planar Point Sets.	Discrete Computational Geometry 2010, Volume 44	(0)	2010
	Conference paper Jeff Erickson, Pratik Worah. Computing the Shortest Essential Cycle.	Discrete Computational Geometry 2010, Volume 44	(0)	2010
	Conference paper Éric Colin de Verdière, Jeff Erickson. Tightening Nonsimple Paths and Cycles on Surfaces.	SIAM J. Comput. 2009, Volume 39	(0)	2010
	Journal article 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. 2010, Volume 43	(0)	2010
	Journal article Jeff Erickson, Ferran Hurtado, Pat Morin. Centerpoint Theorems for Wedges.	Discrete Mathematics Theoretical Computer Science 2009, Volume 11	(0)	2009
	Conference paper Erin W. Chambers, Jeff Erickson, Amir Nayyeri. Minimum cuts and shortest homologous cycles.	Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009 2009	(0)	2009
	Conference paper Erin W. Chambers, Jeff Erickson, Amir Nayyeri. Homology flows, cohomology cuts.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Jeff Erickson. Guest Editor's Foreword.	Discrete Computational Geometry 2009, Volume 42	(0)	2009
	Conference paper Erin W. Chambers, Jeff Erickson, Pratik Worah. Testing contractibility in planar rips complexes.	Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008 2008	(0)	2008
	Conference paper 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.	Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008 2008	(0)	2008
	Conference paper Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar. Finding one tight cycle.	Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 2008	(0)	2008

Show item 1 to 25 of 102  

Your query returned 102 matches in the database.