The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jeff Erickson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
    Efficient Searching with Linear Constraints. [Citation Graph (8, 28)][DBLP]
    PODS, 1998, pp:169-178 [Conf]
  2. Pankaj K. Agarwal, Lars Arge, Jeff Erickson
    Indexing Moving Points. [Citation Graph (1, 34)][DBLP]
    PODS, 2000, pp:175-186 [Conf]
  3. Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas
    Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    SODA, 1998, pp:107-116 [Conf]
  4. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  5. Erik D. Demaine, Jeff Erickson, Stefan Langerman
    On the Complexity of Halfspace Volume Queries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:159-160 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:300-309 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:449-458 [Conf]
  8. Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey
    Splitting (complicated) surfaces is hard. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:421-429 [Conf]
  9. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-unfoldings of simplicial manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:237-243 [Conf]
  10. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:10-16 [Conf]
  11. David Eppstein, Jeff Erickson
    Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:58-67 [Conf]
  12. Jeff Erickson
    Nice point sets can have nasty Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:96-105 [Conf]
  13. Jeff Erickson
    Local polyhedra and geometric graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:171-180 [Conf]
  14. Jeff Erickson
    New Lower Bounds for Hopcroft's Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:127-137 [Conf]
  15. Jeff Erickson
    New Lower Bounds for Convex Hull Problems in Odd Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:1-9 [Conf]
  16. Jeff Erickson
    Space-Time Tradeoffs for Emptiness Queries (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:304-313 [Conf]
  17. Jeff Erickson, Sariel Har-Peled
    Optimally cutting a surface into a disk. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:244-253 [Conf]
  18. Jeff Erickson, Sariel Har-Peled, David M. Mount
    On the least median square problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:273-279 [Conf]
  19. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
    Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:4-15 [Conf]
  20. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
    Necklaces, Convolutions, and X + Y. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:160-171 [Conf]
  21. Jeff Erickson
    Better Lower Bounds for Halfspace Emptiness. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:472-481 [Conf]
  22. Jeff Erickson, Raimund Seidel
    Better Lower Bounds on Detecting Affine and Spherical Degeneracies [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:528-536 [Conf]
  23. Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce
    Capturing a convex object with three discs. [Citation Graph (0, 0)][DBLP]
    ICRA, 2003, pp:2242-2247 [Conf]
  24. Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
    Building Space-Time Meshes Over Arbitrary Spatial Domains. [Citation Graph (0, 0)][DBLP]
    IMR, 2002, pp:391-402 [Conf]
  25. Damrong Guoy, Jeff Erickson
    Automatic Blocking Scheme for Structured Meshing in 2d Multiphase Flow Simulation. [Citation Graph (0, 0)][DBLP]
    IMR, 2004, pp:121-132 [Conf]
  26. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  27. Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang
    Kinetic Collision Detection Between Two Simple Polygons. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:102-111 [Conf]
  28. David Eppstein, Jeff Erickson
    Iterated Nearest Neighbors and Finding Minimal Polytopes. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:64-73 [Conf]
  29. Jeff Erickson
    Finite-resolution hidden surface removal. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:901-909 [Conf]
  30. Jeff Erickson
    Dense point sets have sparse Delaunay triangulations: or "... but not too nasty". [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:125-134 [Conf]
  31. Jeff Erickson
    Lower bounds for external algebraic decision trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:755-761 [Conf]
  32. Jeff Erickson
    Lower Bounds for Linear Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:388-395 [Conf]
  33. Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang
    Separation-Sensitive Collision Detection for Convex Objects. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:327-336 [Conf]
  34. Jeff Erickson, Kim Whittlesey
    Greedy optimal homotopy and homology generators. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1038-1046 [Conf]
  35. Éric Colin de Verdière, Jeff Erickson
    Tightening non-simple paths and cycles on surfaces. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:192-201 [Conf]
  36. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:451-461 [Conf]
  37. Jeff Erickson
    Bounds for Linear Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  38. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring convex polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:85-95 [Journal]
  39. Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang
    Kinetic collision detection between two simple polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:3, pp:211-235 [Journal]
  40. Jeff Erickson
    Local polyhedra and geometric graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:101-125 [Journal]
  41. Michael A. Soss, Jeff Erickson, Mark H. Overmars
    Preprocessing chains for fast dihedral rotations is hard or even impossible. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:3, pp:235-246 [Journal]
  42. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  43. Jeff Erickson
    Nice point sets can have nasty Delaunay triangulations [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  44. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-Unfoldings of Simplicial Polyhedra [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  45. Marshall W. Bern, David Eppstein, Jeff Erickson
    Flipping Cubical Meshes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  46. Jeff Erickson
    Dense point sets have sparse Delaunay triangulations [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  47. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-Unfoldings of Simplicial Manifolds [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  48. Michael A. Soss, Jeff Erickson, Mark H. Overmars
    Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  49. Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
    Building Space-Time Meshes over Arbitrary Spatial Domains [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  50. Jeff Erickson, Sariel Har-Peled
    Optimally cutting a surface into a disk [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  51. Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang
    Separation-Sensitive Collision Detection for Convex Objects [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  52. Jeff Erickson
    Finite-resolution hidden surface removal [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  53. 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. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:4, pp:550-572 [Journal]
  54. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:593-604 [Journal]
  55. David Eppstein, Jeff Erickson
    Iterated Nearest Neighbors and Finding Minimal Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:321-350 [Journal]
  56. David Eppstein, Jeff Erickson
    Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:569-592 [Journal]
  57. Jeff Erickson
    Nice Point Sets Can Have Nasty Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:1, pp:109-132 [Journal]
  58. Jeff Erickson
    Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:1, pp:83-115 [Journal]
  59. Jeff Erickson
    New Lower Bounds for Hopcroft's Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:4, pp:389-418 [Journal]
  60. Jeff Erickson, Sariel Har-Peled
    Optimally Cutting a Surface into a Disk. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:37-59 [Journal]
  61. Jeff Erickson, Raimund Seidel
    Better Lower Bounds on Detecting Affine and Spherical Degeneracies. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:41-57 [Journal]
  62. Jeff Erickson, Raimund Seidel
    Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:2, pp:239-240 [Journal]
  63. Jeff Erickson, Sariel Har-Peled, David M. Mount
    On the Least Median Square Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:593-607 [Journal]
  64. Marshall W. Bern, David Eppstein, Jeff Erickson
    Flipping Cubical Meshes. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2002, v:18, n:3, pp:173-187 [Journal]
  65. Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
    Building spacetime meshes over arbitrary spatial domains. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2005, v:20, n:4, pp:342-353 [Journal]
  66. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating Point Sets in Polygonal Environments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:403-420 [Journal]
  67. Pankaj K. Agarwal, Lars Arge, Jeff Erickson
    Indexing Moving Points. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:1, pp:207-243 [Journal]
  68. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
    Efficient Searching with Linear Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:2, pp:194-216 [Journal]
  69. Jeff Erickson
    Space-Time Tradeoffs for Emptiness Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:1968-1996 [Journal]
  70. Jeff Erickson
    New Lower Bounds for Convex Hull Problems in Odd Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1198-1214 [Journal]
  71. Jeff Erickson
    Finding Small Holes. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:1- [Conf]
  72. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  73. Testing contractibility in planar rips complexes. [Citation Graph (, )][DBLP]


  74. Walking your dog in the woods in polynomial time. [Citation Graph (, )][DBLP]


  75. Minimum cuts and shortest homologous cycles. [Citation Graph (, )][DBLP]


  76. Finding one tight cycle. [Citation Graph (, )][DBLP]


  77. Empty-ellipse graphs. [Citation Graph (, )][DBLP]


  78. Maximum Flows and Parametric Shortest Paths in Planar Graphs. [Citation Graph (, )][DBLP]


  79. Homology flows, cohomology cuts. [Citation Graph (, )][DBLP]


  80. Splitting (complicated) surfaces is hard. [Citation Graph (, )][DBLP]


  81. Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. [Citation Graph (, )][DBLP]


  82. Distance-2 Edge Coloring is NP-Complete [Citation Graph (, )][DBLP]


  83. Guest Editor's Foreword. [Citation Graph (, )][DBLP]


  84. Vietoris-Rips Complexes of Planar Point Sets. [Citation Graph (, )][DBLP]


Search in 0.120secs, Finished in 0.122secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002