Jeff Erickson

University of Illinois at Urbana-Champaign

other persons with the same name:

• Jeff Erickson - University of Colorado, Denver

	2012
98		Jeff Erickson, Kyle Fox, Amir Nayyeri: Global minimum cuts in surface embedded graphs. SODA 2012: 1309-1318
97		Sergio Cabello, Erin W. Chambers, Jeff Erickson: Multiple-Source Shortest Paths in Embedded Graphs CoRR abs/1202.0314: (2012)
	2011
96		Jeff Erickson, Amir Nayyeri: Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. SODA 2011: 1166-1176
95		Jeff Erickson, Amir Nayyeri: Computing Replacement Paths in Surface Embedded Graphs. SODA 2011: 1347-1354
94		Jeff Erickson, Amir Nayyeri: Shortest Non-Crossing Walks in the Plane. SODA 2011: 297-208
93		Jeff Erickson: Shortest non-trivial cycles in directed surface graphs. Symposium on Computational Geometry 2011: 236-243
92		Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola: Special Section on Foundations of Computer Science. SIAM J. Comput. 40(3): 770 (2011)
	2010
91		Jeff Erickson: Maximum Flows and Parametric Shortest Paths in Planar Graphs. SODA 2010: 794-804
90		Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. ACM Transactions on Algorithms 6(4): (2010)
89		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)
88		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)
87		Jeff Erickson, Pratik Worah: Computing the Shortest Essential Cycle. Discrete & Computational Geometry 44(4): 912-930 (2010)
86		Éric Colin de Verdière, Jeff Erickson: Tightening Nonsimple Paths and Cycles on Surfaces. SIAM J. Comput. 39(8): 3784-3813 (2010)
	2009
85		Erin W. Chambers, Jeff Erickson, Amir Nayyeri: Homology flows, cohomology cuts. STOC 2009: 273-282
84		Erin W. Chambers, Jeff Erickson, Amir Nayyeri: Minimum cuts and shortest homologous cycles. Symposium on Computational Geometry 2009: 377-385
83		Jeff Erickson: Guest Editor's Foreword. Discrete & Computational Geometry 42(1): 1-2 (2009)
82		Jeff Erickson, Ferran Hurtado, Pat Morin: Centerpoint Theorems for Wedges. Discrete Mathematics & Theoretical Computer Science 11(1): 45-54 (2009)
	2008
81		Olivier Devillers, Jeff Erickson, Xavier Goaoc: Empty-ellipse graphs. SODA 2008: 1249-1257
80		Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. SODA 2008: 527-531
79		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
78		Erin W. Chambers, Jeff Erickson, Pratik Worah: Testing contractibility in planar rips complexes. Symposium on Computational Geometry 2008: 251-259
77		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)
76		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)
	2007
75		Jeff Erickson: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007 ACM 2007
74		Jeff Erickson: Finding Small Holes. WADS 2007: 1
73		Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce: Capturing a Convex Object With Three Discs. IEEE Transactions on Robotics 23(6): 1133-1140 (2007)
	2006
72		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
71		Éric Colin de Verdière, Jeff Erickson: Tightening non-simple paths and cycles on surfaces. SODA 2006: 192-201
70		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
69		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
68		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)
67		Jeff Erickson, Sariel Har-Peled, David M. Mount: On the Least Median Square Problem. Discrete & Computational Geometry 36(4): 593-607 (2006)
	2005
66		Jeff Erickson, Kim Whittlesey: Greedy optimal homotopy and homology generators. SODA 2005: 1038-1046
65		Jeff Erickson: Lower bounds for external algebraic decision trees. SODA 2005: 755-761
64		Jeff Erickson, Shripad Thite, David P. Bunde: Distance-2 Edge Coloring is NP-Complete CoRR abs/cs/0509100: (2005)
63		Jeff Erickson: Local polyhedra and geometric graphs. Comput. Geom. 31(1-2): 101-125 (2005)
62		Jeff Erickson: Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". Discrete & Computational Geometry 33(1): 83-115 (2005)
61		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)
60		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)
59		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)
	2004
58		Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu: Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA 2004: 4-15
57		Damrong Guoy, Jeff Erickson: Automatic Blocking Scheme for Structured Meshing in 2d Multiphase Flow Simulation. IMR 2004: 121-132
56		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
55		Jeff Erickson, Sariel Har-Peled, David M. Mount: On the least median square problem. Symposium on Computational Geometry 2004: 273-279
54		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
53		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)
52		Jeff Erickson, Sariel Har-Peled: Optimally Cutting a Surface into a Disk. Discrete & Computational Geometry 31(1): 37-59 (2004)
	2003
51		Erik D. Demaine, Jeff Erickson, Stefan Langerman: On the Complexity of Halfspace Volume Queries. CCCG 2003: 159-160
50		Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce: Capturing a convex object with three discs. ICRA 2003: 2242-2247
49		Jeff Erickson: Local polyhedra and geometric graphs. Symposium on Computational Geometry 2003: 171-180
48		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
47		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)
46		Jeff Erickson: Nice Point Sets Can Have Nasty Delaunay Triangulations. Discrete & Computational Geometry 30(1): 109-132 (2003)
45		Pankaj K. Agarwal, Lars Arge, Jeff Erickson: Indexing Moving Points. J. Comput. Syst. Sci. 66(1): 207-243 (2003)
	2002
44		Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör: Building Space-Time Meshes Over Arbitrary Spatial Domains. IMR 2002: 391-402
43		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
42		Jeff Erickson: Dense point sets have sparse Delaunay triangulations: or "... but not too nasty". SODA 2002: 125-134
41		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
40		Jeff Erickson, Sariel Har-Peled: Optimally cutting a surface into a disk. Symposium on Computational Geometry 2002: 244-253
39		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)
38		Michael A. Soss, Jeff Erickson, Mark H. Overmars: Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible CoRR cs.CG/0204042: (2002)
37		Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör: Building Space-Time Meshes over Arbitrary Spatial Domains CoRR cs.CG/0206002: (2002)
36		Jeff Erickson, Sariel Har-Peled: Optimally cutting a surface into a disk CoRR cs.CG/0207004: (2002)
35		Marshall W. Bern, David Eppstein, Jeff Erickson: Flipping Cubical Meshes. Eng. Comput. (Lond.) 18(3): 173-187 (2002)
	2001
34		Jeff Erickson: Nice point sets can have nasty Delaunay triangulations. Symposium on Computational Geometry 2001: 96-105
33		Jeff Erickson: Nice point sets can have nasty Delaunay triangulations CoRR cs.CG/0103017: (2001)
32		Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Polyhedra CoRR cs.CG/0107023: (2001)
31		Marshall W. Bern, David Eppstein, Jeff Erickson: Flipping Cubical Meshes CoRR cs.CG/0108020: (2001)
30		Jeff Erickson: Dense point sets have sparse Delaunay triangulations CoRR cs.CG/0110030: (2001)
29		Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Manifolds CoRR cs.CG/0110054: (2001)
28		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)
	2000
27		Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring Convex Polygons. CCCG 2000
26		Pankaj K. Agarwal, Lars Arge, Jeff Erickson: Indexing Moving Points. PODS 2000: 175-186
25		Jeff Erickson: Finite-resolution hidden surface removal. SODA 2000: 901-909
24		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)
23		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)
22		Jeff Erickson: Space-Time Tradeoffs for Emptiness Queries. SIAM J. Comput. 29(6): 1968-1996 (2000)
	1999
21		Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang: Kinetic Collision Detection Between Two Simple Polygons. SODA 1999: 102-111
20		Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang: Separation-Sensitive Collision Detection for Convex Objects. SODA 1999: 327-336
19		Jeff Erickson: Bounds for Linear Satisfiability Problems. Chicago J. Theor. Comput. Sci. 1999: (1999)
18		Jeff Erickson: Finite-resolution hidden surface removal CoRR cs.CG/9910017: (1999)
17		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)
16		Jeff Erickson: New Lower Bounds for Convex Hull Problems in Odd Dimensions. SIAM J. Comput. 28(4): 1198-1214 (1999)
	1998
15		Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998: 169-178
14		Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas: Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). SODA 1998: 107-116
13		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
12		Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang: Separation-Sensitive Collision Detection for Convex Objects CoRR cs.CG/9809035: (1998)
	1997
11		Jeff Erickson: Space-Time Tradeoffs for Emptiness Queries (Extended Abstract). Symposium on Computational Geometry 1997: 304-313
10		Jeff Erickson, Raimund Seidel: Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discrete & Computational Geometry 18(2): 239-240 (1997)
	1996
9		Jeff Erickson: Better Lower Bounds for Halfspace Emptiness. FOCS 1996: 472-481
8		Jeff Erickson: New Lower Bounds for Convex Hull Problems in Odd Dimensions. Symposium on Computational Geometry 1996: 1-9
7		Jeff Erickson: New Lower Bounds for Hopcroft's Problem. Discrete & Computational Geometry 16(4): 389-418 (1996)
	1995
6		Jeff Erickson: Lower Bounds for Linear Satisfiability Problems. SODA 1995: 388-395
5		Jeff Erickson: New Lower Bounds for Hopcroft's Problem (Extended Abstract). Symposium on Computational Geometry 1995: 127-137
4		Jeff Erickson, Raimund Seidel: Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discrete & Computational Geometry 13: 41-57 (1995)
	1994
3		David Eppstein, Jeff Erickson: Iterated Nearest Neighbors and Finding Minimal Polytopes. Discrete & Computational Geometry 11: 321-350 (1994)
	1993
2		Jeff Erickson, Raimund Seidel: Better Lower Bounds on Detecting Affine and Spherical Degeneracies FOCS 1993: 528-536
1		David Eppstein, Jeff Erickson: Iterated Nearest Neighbors and Finding Minimal Polytopes. SODA 1993: 64-73

Coauthor Index

1	Scott Aaronson	[92]
2	Reza Abedi	[54]
3	Pankaj K. Agarwal	[14] [15] [23] [26] [39] [45] [58]
4	Oswin Aichholzer	[24] [27] [28]
5	Greg Aloupis	[43]
6	Helmut Alt	[69]
7	Lars Arge	[15] [23] [26] [45] [58]
8	Esther M. Arkin	[68] [69]
9	Julien Basch	[21] [53]
10	Marshall W. Bern	[31] [35]
11	David Bremner	[48] [61] [72]
12	Hervé Brönnimann	[68] [69]
13	David P. Bunde	[64]
14	Sergio Cabello	[80] [90] [97]
15	Erin W. Chambers	[70] [77] [78] [79] [84] [85] [88] [89] [97]
16	Timothy M. Chan	[72]
17	Shuo-Heng Chung	[54]
18	Carmen Cortés	[24]
19	Matt DeVos	[80] [90]
20	Erik D. Demaine	[24] [27] [28] [29] [32] [41] [43] [48] [51] [56] [59] [61] [72] [76]
21	Olivier Devillers	[81]
22	Vida Dujmovic	[24] [43]
23	Herbert Edelsbrunner	[39]
24	David Eppstein	[1] [3] [13] [17] [29] [31] [32] [35] [41]
25	Yong Fan	[54]
26	Sándor P. Fekete	[68] [69]
27	Kyle Fox	[98]
28	Paolo Giulio Franciosa	[15] [23]
29	Michael Garland	[54]
30	Robert Ghrist	[88]
31	Xavier Goaoc	[81]
32	Leonidas J. Guibas	[12] [14] [20] [21] [39] [53]
33	Damrong Guoy	[37] [44] [54] [57] [60]
34	Robert Haber	[54]
35	Sariel Har-Peled	[36] [39] [40] [52] [55] [67]
36	George W. Hart	[29] [32] [41]
37	John Hershberger	[21] [39] [53]
38	Ferran Hurtado	[27] [28] [56] [59] [72] [82]
39	John Iacono	[48] [56] [59] [61] [72]
40	Michael Isard	[39]
41	Christian S. Jensen	[39]
42	Lydia E. Kavraki	[39]
43	Christian Knauer	[68] [69]
44	Patrice Koehl	[39]
45	Danny Krizanc	[76]
46	Stefan Langerman	[43] [48] [51] [56] [59] [61] [72]
47	Sylvain Lazard	[79] [89]
48	Francis Lazarus	[70] [77] [79] [89]
49	Jonathan Lenchner	[68] [69]
50	Ming C. Lin	[39]
51	Mohammad Mahdian	[92]
52	Dinesh Manocha	[39]
53	Henk Meijer	[24] [43] [56] [59] [76]
54	Dimitris N. Metaxas	[39]
55	Brian Mirtich	[39]
56	Joseph S. B. Mitchell	[68] [69]
57	Bojan Mohar	[80] [90]
58	Pat Morin	[48] [61] [76] [82]
59	David M. Mount	[39] [55] [67]
60	S. Muthukrishnan (S. Muthu Muthukrishnan)	[39]
61	Amir Nayyeri	[84] [85] [94] [95] [96] [98]
62	Joseph O'Rourke	[29] [32] [41] [43]
63	Mark H. Overmars	[24] [27] [28] [38] [43] [47] [56] [59] [76]
64	Dinesh K. Pai	[39]
65	Belén Palop	[24]
66	Jean Ponce	[50] [73]
67	Suneeta Ramaswami	[24]
68	R. Ravi	[92]
69	Fred Rothganger (Fredrick H. Rothganger)	[50] [73]
70	Elisha Sacks	[39]
71	Raimund Seidel	[2] [4] [10]
72	Vin de Silva	[88]
73	Jack Snoeyink	[39]
74	Michael A. Soss	[27] [28] [38] [43] [47]
75	Jorge Stolfi	[12] [20]
76	Ileana Streinu	[43]
77	John M. Sullivan	[37] [44] [54] [60]
78	Subhash Suri	[39]
79	Perouz Taslakian	[72]
80	Shripad Thite	[50] [54] [64] [73] [79] [89]
81	Godfried T. Toussaint	[24] [27] [28] [43] [48] [61]
82	Alper Üngör	[37] [44] [60]
83	Éric Colin de Verdière	[70] [71] [77] [79] [86] [89]
84	Emanuele Viola	[92]
85	Jeffrey Scott Vitter	[15] [23]
86	Sue Whitesides	[56] [59] [76]
87	Kim Whittlesey	[66] [68] [69] [70] [77]
88	Ouri Wolfson	[39]
89	Pratik Worah	[78] [87]
90	Hai Yu	[58]
91	Li Zhang	[12] [20] [21] [53]
92	Yuan Zhou	[54]

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page