Jeff Erickson

University of Illinois at Urbana-Champaign

other persons with the same name:

• Jeff Erickson 0002 - University of Colorado, Denver

	2013
c51		Jeff Erickson, Kim Whittlesey: Transforming Curves on Surfaces Redux. SODA 2013: 1646-1655
i16		Jeff Erickson, Anastasios Sidiropoulos: A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs. CoRR abs/1304.1810 (2013)
	2012
j35		Erin W. Chambers, Jeff Erickson, Amir Nayyeri: Homology Flows, Cohomology Cuts. SIAM J. Comput. 41(6): 1605-1634 (2012)
c50		Jeff Erickson, Amir Nayyeri: Tracing compressed curves in triangulated surfaces. Symposium on Computational Geometry 2012: 131-140
c49		Jeff Erickson, Kyle Fox, Amir Nayyeri: Global minimum cuts in surface embedded graphs. SODA 2012: 1309-1318
i15		Sergio Cabello, Erin W. Chambers, Jeff Erickson: Multiple-Source Shortest Paths in Embedded Graphs. CoRR abs/1202.0314 (2012)
i14		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 abs/1212.4771 (2012)
	2011
j34		Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola: Special Section on Foundations of Computer Science. SIAM J. Comput. 40(3): 770 (2011)
c48		Jeff Erickson: Shortest non-trivial cycles in directed surface graphs. Symposium on Computational Geometry 2011: 236-243
c47		Jeff Erickson, Amir Nayyeri: Shortest Non-Crossing Walks in the Plane. SODA 2011: 297-208
c46		Jeff Erickson, Amir Nayyeri: Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. SODA 2011: 1166-1176
c45		Jeff Erickson, Amir Nayyeri: Computing Replacement Paths in Surface Embedded Graphs. SODA 2011: 1347-1354
	2010
j33		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): 295-311 (2010)
j32		Erin W. Chambers, Vin de Silva, Jeff Erickson, Robert Ghrist: Vietoris-Rips Complexes of Planar Point Sets. Discrete & Computational Geometry 44(1): 75-90 (2010)
j31		Jeff Erickson, Pratik Worah: Computing the Shortest Essential Cycle. Discrete & Computational Geometry 44(4): 912-930 (2010)
j30		Éric Colin de Verdière, Jeff Erickson: Tightening Nonsimple Paths and Cycles on Surfaces. SIAM J. Comput. 39(8): 3784-3813 (2010)
j29		Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. ACM Transactions on Algorithms 6(4) (2010)
c44		Jeff Erickson: Maximum Flows and Parametric Shortest Paths in Planar Graphs. SODA 2010: 794-804
	2009
j28		Jeff Erickson: Guest Editor's Foreword. Discrete & Computational Geometry 42(1): 1-2 (2009)
j27		Jeff Erickson, Ferran Hurtado, Pat Morin: Centerpoint Theorems for Wedges. Discrete Mathematics & Theoretical Computer Science 11(1): 45-54 (2009)
c43		Erin W. Chambers, Jeff Erickson, Amir Nayyeri: Minimum cuts and shortest homologous cycles. Symposium on Computational Geometry 2009: 377-385
c42		Erin W. Chambers, Jeff Erickson, Amir Nayyeri: Homology flows, cohomology cuts. STOC 2009: 273-282
	2008
j26		Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey: Splitting (complicated) surfaces is hard. Comput. Geom. 41(1-2): 94-110 (2008)
j25		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): 51-58 (2008)
c41		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. Symposium on Computational Geometry 2008: 101-109
c40		Erin W. Chambers, Jeff Erickson, Pratik Worah: Testing contractibility in planar rips complexes. Symposium on Computational Geometry 2008: 251-259
c39		Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. SODA 2008: 527-531
c38		Olivier Devillers, Jeff Erickson, Xavier Goaoc: Empty-ellipse graphs. SODA 2008: 1249-1257
	2007
j24		Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce: Capturing a Convex Object With Three Discs. IEEE Transactions on Robotics 23(6): 1133-1140 (2007)
c37		Jeff Erickson: Finding Small Holes. WADS 2007: 1
e1		Jeff Erickson (Ed.): Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007. ACM 2007, isbn 978-1-59593-705-6
	2006
j23		Jeff Erickson, Sariel Har-Peled, David M. Mount: On the Least Median Square Problem. Discrete & Computational Geometry 36(4): 593-607 (2006)
c36		Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey: Splitting (complicated) surfaces is hard. Symposium on Computational Geometry 2006: 421-429
c35		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. Symposium on Computational Geometry 2006: 449-458
c34		David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian: Necklaces, Convolutions, and X + Y. ESA 2006: 160-171
c33		Éric Colin de Verdière, Jeff Erickson: Tightening non-simple paths and cycles on surfaces. SODA 2006: 192-201
i13		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 abs/cs/0604008 (2006)
	2005
j22		Jeff Erickson: Local polyhedra and geometric graphs. Comput. Geom. 31(1-2): 101-125 (2005)
j21		Jeff Erickson: Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". Discrete & Computational Geometry 33(1): 83-115 (2005)
j20		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. Discrete & Computational Geometry 33(4): 593-604 (2005)
j19		Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör: Building spacetime meshes over arbitrary spatial domains. Eng. Comput. (Lond.) 20(4): 342-353 (2005)
j18		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. Geometry Appl. 15(4): 403-420 (2005)
c32		Jeff Erickson: Lower bounds for external algebraic decision trees. SODA 2005: 755-761
c31		Jeff Erickson, Kim Whittlesey: Greedy optimal homotopy and homology generators. SODA 2005: 1038-1046
i12		Jeff Erickson, Shripad Thite, David P. Bunde: Distance-2 Edge Coloring is NP-Complete. CoRR abs/cs/0509100 (2005)
	2004
j17		Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang: Kinetic collision detection between two simple polygons. Comput. Geom. 27(3): 211-235 (2004)
j16		Jeff Erickson, Sariel Har-Peled: Optimally Cutting a Surface into a Disk. Discrete & Computational Geometry 31(1): 37-59 (2004)
c30		Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating point sets in polygonal environments. Symposium on Computational Geometry 2004: 10-16
c29		Jeff Erickson, Sariel Har-Peled, David M. Mount: On the least median square problem. Symposium on Computational Geometry 2004: 273-279
c28		Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert Haber, John M. Sullivan, Shripad Thite, Yuan Zhou: Spacetime meshing with adaptive refinement and coarsening. Symposium on Computational Geometry 2004: 300-309
c27		Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu: Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA 2004: 4-15
c26		Damrong Guoy, Jeff Erickson: Automatic Blocking Scheme for Structured Meshing in 2d Multiphase Flow Simulation. IMR 2004: 121-132
	2003
j15		Michael A. Soss, Jeff Erickson, Mark H. Overmars: Preprocessing chains for fast dihedral rotations is hard or even impossible. Comput. Geom. 26(3): 235-246 (2003)
j14		Jeff Erickson: Nice Point Sets Can Have Nasty Delaunay Triangulations. Discrete & Computational Geometry 30(1): 109-132 (2003)
j13		Pankaj K. Agarwal, Lars Arge, Jeff Erickson: Indexing Moving Points. J. Comput. Syst. Sci. 66(1): 207-243 (2003)
c25		Erik D. Demaine, Jeff Erickson, Stefan Langerman: On the Complexity of Halfspace Volume Queries. CCCG 2003: 159-160
c24		Jeff Erickson: Local polyhedra and geometric graphs. Symposium on Computational Geometry 2003: 171-180
c23		Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce: Capturing a convex object with three discs. ICRA 2003: 2242-2247
c22		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. WADS 2003: 451-461
	2002
j12		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: Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002)
j11		Marshall W. Bern, David Eppstein, Jeff Erickson: Flipping Cubical Meshes. Eng. Comput. (Lond.) 18(3): 173-187 (2002)
c21		Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-unfoldings of simplicial manifolds. Symposium on Computational Geometry 2002: 237-243
c20		Jeff Erickson, Sariel Har-Peled: Optimally cutting a surface into a disk. Symposium on Computational Geometry 2002: 244-253
c19		Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör: Building Space-Time Meshes Over Arbitrary Spatial Domains. IMR 2002: 391-402
c18		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: Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380
c17		Jeff Erickson: Dense point sets have sparse Delaunay triangulations: or "... but not too nasty". SODA 2002: 125-134
i11		Michael A. Soss, Jeff Erickson, Mark H. Overmars: Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible. CoRR cs.CG/0204042 (2002)
i10		Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör: Building Space-Time Meshes over Arbitrary Spatial Domains. CoRR cs.CG/0206002 (2002)
i9		Jeff Erickson, Sariel Har-Peled: Optimally cutting a surface into a disk. CoRR cs.CG/0207004 (2002)
	2001
j10		Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring convex polygons. Comput. Geom. 20(1-2): 85-95 (2001)
c16		Jeff Erickson: Nice point sets can have nasty Delaunay triangulations. Symposium on Computational Geometry 2001: 96-105
i8		Jeff Erickson: Nice point sets can have nasty Delaunay triangulations. CoRR cs.CG/0103017 (2001)
i7		Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Polyhedra. CoRR cs.CG/0107023 (2001)
i6		Marshall W. Bern, David Eppstein, Jeff Erickson: Flipping Cubical Meshes. CoRR cs.CG/0108020 (2001)
i5		Jeff Erickson: Dense point sets have sparse Delaunay triangulations. CoRR cs.CG/0110030 (2001)
i4		Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Manifolds. CoRR cs.CG/0110054 (2001)
	2000
j9		Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. J. Comput. Syst. Sci. 61(2): 194-216 (2000)
j8		Jeff Erickson: Space-Time Tradeoffs for Emptiness Queries. SIAM J. Comput. 29(6): 1968-1996 (2000)
c15		Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring Convex Polygons. CCCG 2000
c14		Pankaj K. Agarwal, Lars Arge, Jeff Erickson: Indexing Moving Points. PODS 2000: 175-186
c13		Jeff Erickson: Finite-resolution hidden surface removal. SODA 2000: 901-909
i3		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: Flipturning polygons. CoRR cs.CG/0008010 (2000)
	1999
j7		Jeff Erickson: Bounds for Linear Satisfiability Problems. Chicago J. Theor. Comput. Sci. 1999 (1999)
j6		David Eppstein, Jeff Erickson: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discrete & Computational Geometry 22(4): 569-592 (1999)
j5		Jeff Erickson: New Lower Bounds for Convex Hull Problems in Odd Dimensions. SIAM J. Comput. 28(4): 1198-1214 (1999)
c12		Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang: Kinetic Collision Detection Between Two Simple Polygons. SODA 1999: 102-111
c11		Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang: Separation-Sensitive Collision Detection for Convex Objects. SODA 1999: 327-336
i2		Jeff Erickson: Finite-resolution hidden surface removal. CoRR cs.CG/9910017 (1999)
	1998
c10		David Eppstein, Jeff Erickson: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Symposium on Computational Geometry 1998: 58-67
c9		Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998: 169-178
c8		Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas: Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). SODA 1998: 107-116
i1		Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang: Separation-Sensitive Collision Detection for Convex Objects. CoRR cs.CG/9809035 (1998)
	1997
j4		Jeff Erickson, Raimund Seidel: Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discrete & Computational Geometry 18(2): 239-240 (1997)
c7		Jeff Erickson: Space-Time Tradeoffs for Emptiness Queries (Extended Abstract). Symposium on Computational Geometry 1997: 304-313
	1996
j3		Jeff Erickson: New Lower Bounds for Hopcroft's Problem. Discrete & Computational Geometry 16(4): 389-418 (1996)
c6		Jeff Erickson: New Lower Bounds for Convex Hull Problems in Odd Dimensions. Symposium on Computational Geometry 1996: 1-9
c5		Jeff Erickson: Better Lower Bounds for Halfspace Emptiness. FOCS 1996: 472-481
	1995
j2		Jeff Erickson, Raimund Seidel: Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discrete & Computational Geometry 13: 41-57 (1995)
c4		Jeff Erickson: New Lower Bounds for Hopcroft's Problem (Extended Abstract). Symposium on Computational Geometry 1995: 127-137
c3		Jeff Erickson: Lower Bounds for Linear Satisfiability Problems. SODA 1995: 388-395
	1994
j1		David Eppstein, Jeff Erickson: Iterated Nearest Neighbors and Finding Minimal Polytopes. Discrete & Computational Geometry 11: 321-350 (1994)
	1993
c2		Jeff Erickson, Raimund Seidel: Better Lower Bounds on Detecting Affine and Spherical Degeneracies. FOCS 1993: 528-536
c1		David Eppstein, Jeff Erickson: Iterated Nearest Neighbors and Finding Minimal Polytopes. SODA 1993: 64-73

Coauthor Index

Last update Sun May 19 03:17:32 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page