default search action
Jeff Erickson 0001
Person information
- affiliation: University of Illinois at Urbana-Champaign, Urbana, IL, USA
Other persons with the same name
- Jeff Erickson 0002 — University of Colorado, Denver, CO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c71]Eliot Wong Robson
, Sam Ruggerio
FSM Builder: A Tool for Writing Autograded Finite Automata Questions. ITiCSE (1) 2024 - [i38]Eliot Wong Robson, Sam Ruggerio, Jeff Erickson:
FSM Builder: A Tool for Writing Autograded Finite Automata Questions. CoRR abs/2405.01717 (2024) - 2023
- [j48]Jeff Erickson, Patrick Lin:
Planar and Toroidal Morphs Made Easier. J. Graph Algorithms Appl. 27(2): 95-118 (2023) - [j47]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. SIAM J. Comput. 52(1): 156-195 (2023) - [c70]Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen:
Reconstructing Graphs from Connected Triples. WG 2023: 16-29 - [i37]Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland
Reconstructing Graphs from Connected Triples. CoRR abs/2303.06609 (2023) - 2022
- [j46]Jeff Erickson, Gabriel Nivasch
Fusible numbers and Peano Arithmetic. Log. Methods Comput. Sci. 18(3) (2022) - [c69]Jeff Erickson:
The Tragedy of Being Almost but Not Quite Planar (Invited Talk). ISAAC 2022: 2:1-2:1 - 2021
- [j45]Jeff Erickson, Patrick Lin:
A Toroidal Maxwell-Cremona-Delaunay Correspondence. J. Comput. Geom. 12(2): 55-85 (2021) - [c68]Mikkel Abrahamsen
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG 2021: 5:1-5:19 - [c67]Jeff Erickson
Planar and Toroidal Morphs Made Easier. GD 2021: 123-137 - [c66]Jeff Erickson, Gabriel Nivasch, Junyan Xu
Fusible numbers and Peano Arithmetic. LICS 2021: 1-13 - [c65]Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. SODA 2021: 2759-2778 - [i36]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 abs/2103.09811 (2021) - [i35]Jeff Erickson, Patrick Lin:
Planar and Toroidal Morphs Made Easier. CoRR abs/2106.14086 (2021) - 2020
- [j44]Jeff Erickson
Topologically Trivial Closed Walks in Directed Surface Graphs. Discret. Comput. Geom. 64(4): 1253-1294 (2020) - [c64]Jeff Erickson:
Chasing Puppies. CCCG 2020: 94 - [c63]Jeff Erickson
A Toroidal Maxwell-Cremona-Delaunay Correspondence. SoCG 2020: 40:1-40:17 - [c62]Jeff Erickson, Ivor van der Hoog
Smoothing the gap between NP and ER. FOCS 2020: 1022-1033 - [i34]Jeff Erickson, Patrick Lin:
A Toroidal Maxwell-Cremona-Delaunay Correspondence. CoRR abs/2003.10057 (2020) - [i33]Jeff Erickson, Gabriel Nivasch, Junyan Xu:
Fusible numbers and Peano Arithmetic. CoRR abs/2003.14342 (2020) - [i32]Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. CoRR abs/2007.07927 (2020)
2010 – 2019
- 2019
- [b1]Jeff Erickson:
Algorithms. 2019, ISBN 978-1-792-64483-2 - [c61]Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson:
Lower Bounds for Electrical Reduction on Surfaces. SoCG 2019: 25:1-25:16 - [c60]Jeff Erickson
Topologically Trivial Closed Walks in Directed Surface Graphs. SoCG 2019: 34:1-34:17 - [i31]Jeff Erickson:
Optimal Curve Straightening is ∃R-Complete. CoRR abs/1908.09400 (2019) - [i30]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. CoRR abs/1910.04278 (2019) - [i29]Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow:
A Framework for Robust Realistic Geometric Computations. CoRR abs/1912.02278 (2019) - [i28]Siu-Wing Cheng, Anne Driemel, Jeff Erickson:
Computational Geometry (Dagstuhl Seminar 19181). Dagstuhl Reports 9(4): 107-123 (2019) - 2018
- [c59]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: 121-135 - [c58]Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren:
Holiest minimum-cost paths and flows in surface graphs. STOC 2018: 1319-1332 - [i27]Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren:
Holiest Minimum-Cost Paths and Flows in Surface Graphs. CoRR abs/1804.01045 (2018) - [i26]Jeff Erickson, Yipu Wang:
Topologically Trivial Closed Walks in Directed Surface Graphs. CoRR abs/1812.01564 (2018) - 2017
- [j43]Hugo A. Akitaya
Recognizing Weakly Simple Polygons. Discret. Comput. Geom. 58(4): 785-821 (2017) - [j42]Hsien-Chih Chang, Jeff Erickson
Untangling Planar Curves. Discret. Comput. Geom. 58(4): 889-920 (2017) - [j41]Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. 25: 610-615 (2017) - [i25]Hsien-Chih Chang, Jeff Erickson:
Untangling Planar Curves. CoRR abs/1702.00146 (2017) - [i24]Glencora Borradaile, Jeff Erickson, Hung Le, Robbie Weber:
Embedded-width: A variant of treewidth for plane graphs. CoRR abs/1703.07532 (2017) - [i23]Hsien-Chih Chang, Jeff Erickson:
Lower Bounds for Planar Electrical Reduction. CoRR abs/1707.04683 (2017) - [i22]Otfried Cheong, Anne Driemel, Jeff Erickson:
Computational Geometry (Dagstuhl Seminar 17171). Dagstuhl Reports 7(4): 107-127 (2017) - 2016
- [c57]Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. SoCG 2016: 8:1-8:16 - [c56]Hsien-Chih Chang, Jeff Erickson:
Untangling Planar Curves. SoCG 2016: 29:1-29:16 - [r1]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Global Minimum Cuts in Surface-Embedded Graphs. Encyclopedia of Algorithms 2016: 852-856 - [i21]Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. CoRR abs/1603.07401 (2016) - [i20]Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu:
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). Dagstuhl Reports 6(5): 94-116 (2016) - 2015
- [c55]Hsien-Chih Chang, Jeff Erickson, Chao Xu
Detecting Weakly Simple Polygons. SODA 2015: 1655-1670 - [i19]Hsien-Chih Chang, Jeff Erickson:
Electrical Reduction, Homotopy Moves, and Defect. CoRR abs/1510.00571 (2015) - [i18]Otfried Cheong, Jeff Erickson, Monique Teillaud:
Computational Geometry (Dagstuhl Seminar 15111). Dagstuhl Reports 5(3): 41-62 (2015) - 2014
- [j40]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono
Necklaces, Convolutions, and X+Y. Algorithmica 69(2): 294-314 (2014) - [j39]Jeff Erickson:
Efficiently Hex-Meshing Things with Topology. Discret. Comput. Geom. 52(3): 427-449 (2014) - [c54]Jeff Erickson, Anastasios Sidiropoulos:
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs. SoCG 2014: 130 - [i17]Hsien-Chih Chang, Jeff Erickson, Chao Xu:
Detecting Weakly Simple Polygons. CoRR abs/1407.3340 (2014) - 2013
- [j38]Jeff Erickson, Amir Nayyeri:
Tracing Compressed Curves in Triangulated Surfaces. Discret. Comput. Geom. 49(4): 823-863 (2013) - [j37]Sergio Cabello, Erin W. Chambers
Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. 42(4): 1542-1571 (2013) - [c53]Jeff Erickson:
Efficiently hex-meshing things with topology. SoCG 2013: 37-46 - [c52]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
- [j36]Erin W. Chambers
Homology Flows, Cohomology Cuts. SIAM J. Comput. 41(6): 1605-1634 (2012) - [c51]Jeff Erickson, Amir Nayyeri:
Tracing compressed curves in triangulated surfaces. SCG 2012: 131-140 - [c50]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
Necklaces, Convolutions, and X+Y. CoRR abs/1212.4771 (2012) - 2011
- [j35]Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola:
Special Section on Foundations of Computer Science. SIAM J. Comput. 40(3): 770 (2011) - [c49]Jeff Erickson:
Shortest non-trivial cycles in directed surface graphs. SCG 2011: 236-243 - [c48]Jeff Erickson, Amir Nayyeri:
Shortest Non-Crossing Walks in the Plane. SODA 2011: 297-208 - [c47]Jeff Erickson, Amir Nayyeri:
Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. SODA 2011: 1166-1176 - [c46]Jeff Erickson, Amir Nayyeri:
Computing Replacement Paths in Surface Embedded Graphs. SODA 2011: 1347-1354 - 2010
- [j34]Erin W. Chambers
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43(3): 295-311 (2010) - [j33]Erin W. Chambers
Vietoris-Rips Complexes of Planar Point Sets. Discret. Comput. Geom. 44(1): 75-90 (2010) - [j32]Jeff Erickson, Pratik Worah
Computing the Shortest Essential Cycle. Discret. Comput. Geom. 44(4): 912-930 (2010) - [j31]Éric Colin de Verdière, Jeff Erickson:
Tightening Nonsimple Paths and Cycles on Surfaces. SIAM J. Comput. 39(8): 3784-3813 (2010) - [j30]Sergio Cabello
Finding one tight cycle. ACM Trans. Algorithms 6(4): 61:1-61:13 (2010) - [c45]Jeff Erickson:
Maximum Flows and Parametric Shortest Paths in Planar Graphs. SODA 2010: 794-804
2000 – 2009
- 2009
- [j29]Jeff Erickson:
Guest Editor's Foreword. Discret. Comput. Geom. 42(1): 1-2 (2009) - [j28]Jeff Erickson, Ferran Hurtado, Pat Morin
Centerpoint Theorems for Wedges. Discret. Math. Theor. Comput. Sci. 11(1): 45-54 (2009) - [c44]Erin W. Chambers
Minimum cuts and shortest homologous cycles. SCG 2009: 377-385 - [c43]Erin W. Chambers
Homology flows, cohomology cuts. STOC 2009: 273-282 - 2008
- [j27]Erin W. Chambers
Splitting (complicated) surfaces is hard. Comput. Geom. 41(1-2): 94-110 (2008) - [j26]Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin
Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6(1): 51-58 (2008) - [c42]Erin W. Chambers
Walking your dog in the woods in polynomial time. SCG 2008: 101-109 - [c41]Erin W. Chambers
Testing contractibility in planar rips complexes. SCG 2008: 251-259 - [c40]Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle. SODA 2008: 527-531 - [c39]Olivier Devillers, Jeff Erickson, Xavier Goaoc:
Empty-ellipse graphs. SODA 2008: 1249-1257 - 2007
- [j25]Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce:
Capturing a Convex Object With Three Discs. IEEE Trans. Robotics 23(6): 1133-1140 (2007) - [c38]Jeff Erickson:
Finding Small Holes. WADS 2007: 1 - [e1]Jeff Erickson:
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007. ACM 2007, ISBN 978-1-59593-705-6 [contents] - 2006
- [j24]Jeff Erickson, Sariel Har-Peled
On the Least Median Square Problem. Discret. Comput. Geom. 36(4): 593-607 (2006) - [c37]Erin W. Chambers
Splitting (complicated) surfaces is hard. SCG 2006: 421-429 - [c36]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: 449-458 - [c35]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 - [c34]É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
- [j23]Jeff Erickson
Local polyhedra and geometric graphs. Comput. Geom. 31(1-2): 101-125 (2005) - [j22]Jeff Erickson:
Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". Discret. Comput. Geom. 33(1): 83-115 (2005) - [j21]David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. 33(4): 593-604 (2005) - [j20]Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör:
Building spacetime meshes over arbitrary spatial domains. Eng. Comput. 20(4): 342-353 (2005) - [j19]Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman
Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. 15(4): 403-420 (2005) - [c33]Jeff Erickson:
Lower bounds for external algebraic decision trees. SODA 2005: 755-761 - [c32]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
- [j18]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) - [j17]Jeff Erickson, Sariel Har-Peled
Optimally Cutting a Surface into a Disk. Discret. Comput. Geom. 31(1): 37-59 (2004) - [c31]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: 10-16 - [c30]Jeff Erickson, Sariel Har-Peled
On the least median square problem. SCG 2004: 273-279 - [c29]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: 300-309 - [c28]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu:
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA 2004: 4-15 - [c27]Damrong Guoy, Jeff Erickson:
Automatic Blocking Scheme for Structured Meshing in 2d Multiphase Flow Simulation. IMR 2004: 121-132 - 2003
- [j16]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) - [j15]Jeff Erickson:
Nice Point Sets Can Have Nasty Delaunay Triangulations. Discret. Comput. Geom. 30(1): 109-132 (2003) - [j14]Pankaj K. Agarwal, Lars Arge, Jeff Erickson:
Indexing Moving Points. J. Comput. Syst. Sci. 66(1): 207-243 (2003) - [c26]Erik D. Demaine, Jeff Erickson, Stefan Langerman:
On the Complexity of Halfspace Volume Queries. CCCG 2003: 159-160 - [c25]Jeff Erickson:
Local polyhedra and geometric graphs. SCG 2003: 171-180 - [c24]Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce:
Capturing a convex object with three discs. ICRA 2003: 2242-2247 - [c23]David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS 2003: 451-461 - 2002
- [j13]Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled
Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002) - [j12]Oswin Aichholzer, Carmen Cortés
Flipturning Polygons. Discret. Comput. Geom. 28(2): 231-253 (2002) - [j11]Marshall W. Bern, David Eppstein, Jeff Erickson:
Flipping Cubical Meshes. Eng. Comput. 18(3): 173-187 (2002) - [c22]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds. SCG 2002: 237-243 - [c21]Jeff Erickson, Sariel Har-Peled
Optimally cutting a surface into a disk. SCG 2002: 244-253 - [c20]Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör:
Building Space-Time Meshes Over Arbitrary Spatial Domains. IMR 2002: 391-402 - [c19]Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380 - [c18]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
Reconfiguring convex polygons. Comput. Geom. 20(1-2): 85-95 (2001) - [c17]Jeff Erickson:
Nice point sets can have nasty Delaunay triangulations. SCG 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) - [c16]Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint:
Reconfiguring Convex Polygons. CCCG 2000 - [c15]Pankaj K. Agarwal, Lars Arge, Jeff Erickson:
Indexing Moving Points. PODS 2000: 175-186 - [c14]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)
1990 – 1999
- 1999
- [j7]Jeff Erickson:
Bounds for Linear Satisfiability Problems. Chic. 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. Discret. Comput. Geom. 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) - [c13]Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang:
Kinetic Collision Detection Between Two Simple Polygons. SODA 1999: 102-111 - [c12]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
- [c11]David Eppstein, Jeff Erickson:
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. SCG 1998: 58-67 - [c10]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
Efficient Searching with Linear Constraints. PODS 1998: 169-178 - [c9]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. Discret. Comput. Geom. 18(2): 239-240 (1997) - [c8]Jeff Erickson:
Space-Time Tradeoffs for Emptiness Queries (Extended Abstract). SCG 1997: 304-313 - 1996
- [j3]Jeff Erickson:
New Lower Bounds for Hopcroft's Problem. Discret. Comput. Geom. 16(4): 389-418 (1996) - [c7]Jeff Erickson:
New Lower Bounds for Convex Hull Problems in Odd Dimensions. SCG 1996: 1-9 - [c6]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. Discret. Comput. Geom. 13: 41-57 (1995) - [c5]Jeff Erickson:
On the relative complexities of some geometric problems. CCCG 1995: 85-90 - [c4]Jeff Erickson:
New Lower Bounds for Hopcroft's Problem (Extended Abstract). SCG 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. Discret. Comput. Geom. 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
Erin W. Chambers
aka: Erin Wolf Chambers
aka: Erin Wolf Chambers
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: