The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John Hershberger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Julien Basch, Leonidas J. Guibas, John Hershberger
    Data Structures for Mobile Data. [Citation Graph (3, 0)][DBLP]
    SODA, 1997, pp:747-756 [Conf]
  2. John Hershberger, Matthew Maxel, Subhash Suri
    Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:26-36 [Conf]
  3. John Hershberger, Jack Snoeyink
    An Efficient Solution to the Zookeeper's Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:104-109 [Conf]
  4. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
    Lower Bounds for Kinetic Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:247-254 [Conf]
  5. Julien Basch, João Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang
    Kinetic Data Structures: Animating Proofs Through Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:427-428 [Conf]
  6. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
    Slimming Down by Adding: Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:116-127 [Conf]
  7. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangements of Jordan Arcs with Three Intersections per Pair. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:258-265 [Conf]
  8. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:56-69 [Conf]
  9. Joseph Friedman, John Hershberger, Jack Snoeyink
    Compliant Motion in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:175-186 [Conf]
  10. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu
    Discrete mobile centers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:188-196 [Conf]
  11. Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum
    Snap Rounding Line Segments Efficiently in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:284-293 [Conf]
  12. Leonidas J. Guibas, John Hershberger
    Optimal Shortest Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:50-63 [Conf]
  13. Leonidas J. Guibas, John Hershberger
    Morphing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:267-276 [Conf]
  14. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
    Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:1-13 [Conf]
  15. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang
    Kinetic connectivity for unit disks. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:331-340 [Conf]
  16. John Hershberger
    Smooth kinetic maintenance of clusters. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:48-57 [Conf]
  17. John Hershberger
    Improved output-sensitive snap rounding. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:357-366 [Conf]
  18. John Hershberger
    Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:11-20 [Conf]
  19. John Hershberger
    Optimal Parallel Algorithms for Triangulated Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:33-42 [Conf]
  20. John Hershberger
    Compliant Motion in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:397-398 [Conf]
  21. John Hershberger, Subhash Suri
    Finding Tailored Partitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:255-265 [Conf]
  22. John Hershberger, Jack Snoeyink
    An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:383-384 [Conf]
  23. John Hershberger, Subhash Suri
    Efficient Breakout Routing in Printed Circuit Boards. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:460-462 [Conf]
  24. John Hershberger, Subhash Suri
    Kinetic Connectivity of Rectangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:237-246 [Conf]
  25. John Hershberger, Subhash Suri, Csaba D. Tóth
    Binary space partitions of orthogonal subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:230-238 [Conf]
  26. Jack Snoeyink, John Hershberger
    Sweeping Arrangements of Curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:354-363 [Conf]
  27. Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri
    Contour Approximation in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2006, pp:356-371 [Conf]
  28. Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter
    The Centroid of Points with Approximate Weights. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:460-472 [Conf]
  29. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
    Visibility-Polygon Search and Euclidean Shortest Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:155-164 [Conf]
  30. John Hershberger, Subhash Suri
    Vickrey Prices and Shortest Paths: What is an Edge Worth?. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:252-259 [Conf]
  31. John Hershberger, Subhash Suri
    Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:809-0 [Conf]
  32. John Hershberger, Subhash Suri
    Efficient Computation of Euclidean Shortest Paths in the Plane [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:508-517 [Conf]
  33. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
    Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:661-646 [Conf]
  34. John Hershberger, Nisheeth Shrivastava, Subhash Suri
    Cluster Hull: A Technique for Summarizing Spatial Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:138- [Conf]
  35. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang
    Fractionally cascaded information in a sensor network. [Citation Graph (0, 0)][DBLP]
    IPSN, 2004, pp:311-319 [Conf]
  36. Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, John Hershberger
    Sparse data aggregation in sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2007, pp:430-439 [Conf]
  37. Sorabh Gandhi, John Hershberger, Subhash Suri
    Approximate isocontours and spatial summaries for sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2007, pp:400-409 [Conf]
  38. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
    Approximating Polygons and Subdivisions with Minimum Link Paths. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:151-162 [Conf]
  39. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Adaptive Spatial Partitioning for Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:522-533 [Conf]
  40. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu
    Geometric spanner for routing in mobile networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2001, pp:45-55 [Conf]
  41. John Hershberger, Subhash Suri
    Adaptive Sampling for Geometric Problems over Data Streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:252-262 [Conf]
  42. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Space complexity of hierarchical heavy hitters in multi-dimensional data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:338-347 [Conf]
  43. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
    Implicitly Searching Convolutions and Computing Depth of Collision. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:165-180 [Conf]
  44. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
    An efficient algorithm for finding the CSG representation of a simple polygon. [Citation Graph (0, 0)][DBLP]
    SIGGRAPH, 1988, pp:31-40 [Conf]
  45. 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]
  46. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink
    Polygonal path approximation with angle constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:342-343 [Conf]
  47. Leonidas J. Guibas, John Hershberger, Jack Snoeyink
    Compact Interval Trees: A Data Structure for Convex Hulls. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:169-178 [Conf]
  48. John Hershberger, Subhash Suri
    Simplified kinetic connectivity for rectangles and hypercubes. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:158-167 [Conf]
  49. John Hershberger, Subhash Suri
    Binary space partitions for 3D subdivisions. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:100-108 [Conf]
  50. John Hershberger, Subhash Suri
    Offline Maintenance of Planar Configurations. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:32-41 [Conf]
  51. John Hershberger, Subhash Suri
    A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:54-63 [Conf]
  52. John Hershberger, Subhash Suri
    Morphing Binary Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:396-404 [Conf]
  53. John Hershberger, Subhash Suri
    Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:447-456 [Conf]
  54. John Hershberger, Subhash Suri, Amit M. Bhosle
    On the Difficulty of Some Shortest Path Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:343-354 [Conf]
  55. John Hershberger, Subhash Suri
    Matrix searching with the shortest path metric. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:485-494 [Conf]
  56. Joseph Friedman, John Hershberger, Jack Snoeyink
    Input-Sensitive Compliant Motion in the Plane. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:225-237 [Conf]
  57. John Hershberger
    Upper Envelope Onion Peeling. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:368-379 [Conf]
  58. John Hershberger, Monika Rauch, Subhash Suri
    Fully Dynamic 2-Edge-Connectivity in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:233-244 [Conf]
  59. John Hershberger, Subhash Suri
    Applications of a Semi-Dynamic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:380-392 [Conf]
  60. John Hershberger, Jack Snoeyink
    Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:376-387 [Conf]
  61. Marc H. Brown, John Hershberger
    Color and Sound in Algorithm Animation. [Citation Graph (0, 0)][DBLP]
    VL, 1991, pp:10-17 [Conf]
  62. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach
    Maintaining the Extent of a Moving Point Set. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:31-44 [Conf]
  63. John Hershberger, Jack Snoeyink
    Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:331-342 [Conf]
  64. John Hershberger, Jack Snoeyink
    Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:93-103 [Conf]
  65. John Hershberger, Subhash Suri
    Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:462-471 [Conf]
  66. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
    Visibility of Disjoint Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:49-63 [Journal]
  67. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
    Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:54-68 [Journal]
  68. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
    An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:1, pp:1-23 [Journal]
  69. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
    Computing the Intersection-Depth of Polyhedra. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:518-533 [Journal]
  70. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
    Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:209-233 [Journal]
  71. John Hershberger
    An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:1, pp:141-155 [Journal]
  72. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Adaptive Spatial Partitioning for Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:97-117 [Journal]
  73. John Hershberger, Subhash Suri
    Applications of a Semi-Dynamic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:249-267 [Journal]
  74. 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]
  75. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink
    Polygonal path simplification with angle constraints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:3, pp:173-187 [Journal]
  76. John Hershberger
    Smooth kinetic maintenance of clusters. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:3-30 [Journal]
  77. John Hershberger
    Upper Envelope Onion Peeling. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:93-110 [Journal]
  78. John Hershberger
    Minimizing the Sum of Diameters Efficiently. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:111-118 [Journal]
  79. John Hershberger, Jack Snoeyink
    Computing Minimum Length Paths of a Given Homotopy Class. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:63-97 [Journal]
  80. John Hershberger, Subhash Suri
    Finding a Shortest Diagonal of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:149-160 [Journal]
  81. John Hershberger, Jack Snoeyink
    Erased arrangements of lines and convex decompositions of polyhedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:3, pp:129-143 [Journal]
  82. John Hershberger, Jack Snoeyink
    Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:175-185 [Journal]
  83. John Hershberger, Subhash Suri
    Practical methods for approximating shortest paths on a convex polytope in R3. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:31-46 [Journal]
  84. Marc H. Brown, John Hershberger
    Color and Sound in Algorithmic Animation. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1992, v:25, n:12, pp:52-63 [Journal]
  85. 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]
  86. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
    Lower Bounds for Kinetic Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:721-733 [Journal]
  87. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach
    Maintaining the Extent of a Moving Point Set. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:353-374 [Journal]
  88. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangement of Jordan Arcs with Three Intersection per Pair. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:523-539 [Journal]
  89. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:433-466 [Journal]
  90. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu
    Discrete Mobile Centers. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:1, pp:45-63 [Journal]
  91. Leonidas J. Guibas, John Hershberger, Subhash Suri
    Morphing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:1, pp:1-34 [Journal]
  92. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang
    Kinetic Connectivity for Unit Disks. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:591-610 [Journal]
  93. Leonidas J. Guibas, John Hershberger
    Computing the visibility graphs of n line segments in O(nn) time. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:26, n:, pp:13-20 [Journal]
  94. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
    Approximating Polygons and Subdivisions with Minimum Link Paths. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:4, pp:383-415 [Journal]
  95. Leonidas J. Guibas, John Hershberger, Jack Snoeyink
    Compact interval trees: a data structure for convex hulls. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:1, pp:1-22 [Journal]
  96. John Hershberger
    Guest Editor's Foreword - Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, Minnesota, June 1998. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:3, pp:243-244 [Journal]
  97. John Hershberger
    Optimal parallel algorithms for triangulated simple polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:145-170 [Journal]
  98. Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang
    Deformable Free-Space Tilings for Kinetic Collision Detection. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2002, v:21, n:3, pp:179-198 [Journal]
  99. John Hershberger
    Kinetic collision detection with fast flight plan changes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:6, pp:287-291 [Journal]
  100. John Hershberger
    Finding the Upper Envelope of n Line Segments in O(n log n) Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:4, pp:169-174 [Journal]
  101. John Hershberger
    A New Data Structure for Shortest Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:5, pp:231-235 [Journal]
  102. John Hershberger
    A Faster Algorithm for the Two-Center Decision Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:23-29 [Journal]
  103. Julien Basch, Leonidas J. Guibas, John Hershberger
    Data Structures for Mobile Data. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:1, pp:1-28 [Journal]
  104. John Hershberger, Leonidas J. Guibas
    An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:1, pp:18-46 [Journal]
  105. John Hershberger, Subhash Suri
    Finding Tailored Partitions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:3, pp:431-463 [Journal]
  106. John Hershberger, Subhash Suri
    A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:3, pp:403-431 [Journal]
  107. John Hershberger, Subhash Suri
    Off-Line Maintenance of Planar Configurations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:453-475 [Journal]
  108. Leonidas J. Guibas, John Hershberger
    Optimal Shortest Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:2, pp:126-152 [Journal]
  109. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
    Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1138-1151 [Journal]
  110. Joseph Friedman, John Hershberger, Jack Snoeyink
    Efficiently Planning Compliant Motion in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:3, pp:562-599 [Journal]
  111. John Hershberger, Subhash Suri
    Matrix Searching with the Shortest-Path Metric. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1612-1634 [Journal]
  112. John Hershberger, Subhash Suri
    An Optimal Algorithm for Euclidean Shortest Paths in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2215-2256 [Journal]
  113. John Hershberger, Subhash Suri, Amit M. Bhosle
    On the difficulty of some shortest path problems. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  114. John Hershberger, Monika Rauch, Subhash Suri
    Data Structures for Two-Edge Connectivity in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:139-161 [Journal]

  115. Road Network Reconstruction for Organizing Paths. [Citation Graph (, )][DBLP]


  116. Simplified Planar Coresets for Data Streams. [Citation Graph (, )][DBLP]


  117. Adaptive sampling for geometric problems over data streams. [Citation Graph (, )][DBLP]


  118. Improved Output-Sensitive Snap Rounding. [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.030secs
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