other persons with the same name:
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j58 |      | |
| 2011 | ||
| j57 | | |
| j56 | | Irene Finocchi, John Hershberger: Guest editors' foreword. ACM Journal of Experimental Algorithmics 16 (2011) |
| c72 | | Hakan Yildiz, John Hershberger, Subhash Suri: A Discrete and Dynamic Version of Klee's Measure Problem. CCCG 2011 |
| c71 | | |
| c70 | | Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri: The Union of Probabilistic Boxes: Maintaining the Volume. ESA 2011: 591-602 |
| c69 | | Luca Foschini, John Hershberger, Subhash Suri: On the Complexity of Time-Dependent Shortest Paths. SODA 2011: 327-341 |
| 2010 | ||
| c68 | | Daniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun: Road Network Reconstruction for Organizing Paths. SODA 2010: 1309-1320 |
| 2009 | ||
| e2 |  | Irene Finocchi, John Hershberger (Eds.): Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, January 3, 2009. SIAM 2009, isbn 978-0-898719-30-7 |
| e1 | | |
| 2008 | ||
| j55 | | John Hershberger, Subhash Suri: Adaptive sampling for geometric problems over data streams. Comput. Geom. 39(3): 191-208 (2008) |
| j54 | | John Hershberger: Improved Output-Sensitive Snap Rounding. Discrete & Computational Geometry 39(1-3): 298-318 (2008) |
| j53 | | John Hershberger, Nisheeth Shrivastava, Subhash Suri: Summarizing spatial data streams using ClusterHulls. ACM Journal of Experimental Algorithmics 13 (2008) |
| c67 | | |
| 2007 | ||
| j52 | | John Hershberger, Subhash Suri, Amit M. Bhosle: On the difficulty of some shortest path problems. ACM Transactions on Algorithms 3(1) (2007) |
| j51 | | John Hershberger, Matthew Maxel, Subhash Suri: Finding the k shortest simple paths: A new algorithm and its implementation. ACM Transactions on Algorithms 3(4) (2007) |
| c66 | | Sorabh Gandhi, John Hershberger, Subhash Suri: Approximate isocontours and spatial summaries for sensor networks. IPSN 2007: 400-409 |
| c65 | | Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, John Hershberger: Sparse data aggregation in sensor networks. IPSN 2007: 430-439 |
| 2006 | ||
| j50 | | John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica 46(1): 97-117 (2006) |
| c64 | | John Hershberger, Nisheeth Shrivastava, Subhash Suri: Summarizing Spatial Data Streams Using ClusterHulls. ALENEX 2006: 26-40 |
| c63 | | John Hershberger: Improved output-sensitive snap rounding. Symposium on Computational Geometry 2006: 357-366 |
| c62 | | Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri: Contour Approximation in Sensor Networks. DCOSS 2006: 356-371 |
| c61 | | John Hershberger, Nisheeth Shrivastava, Subhash Suri: Cluster Hull: A Technique for Summarizing Spatial Data Streams. ICDE 2006: 138 |
| 2005 | ||
| j49 | | |
| j48 | | Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink: Polygonal path simplification with angle constraints. Comput. Geom. 32(3): 173-187 (2005) |
| j47 | | Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu: Geometric spanners for routing in mobile networks. IEEE Journal on Selected Areas in Communications 23(1): 174-185 (2005) |
| j46 | | John Hershberger, Subhash Suri, Csaba D. Tóth: Binary Space Partitions of Orthogonal Subdivisions. SIAM J. Comput. 34(6): 1380-1397 (2005) |
| c60 | | John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Space complexity of hierarchical heavy hitters in multi-dimensional data streams. PODS 2005: 338-347 |
| 2004 | ||
| j45 | | 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) |
| j44 | | John Hershberger: Kinetic collision detection with fast flight plan changes. Inf. Process. Lett. 92(6): 287-291 (2004) |
| c59 | | John Hershberger, Subhash Suri, Csaba D. Tóth: Binary space partitions of orthogonal subdivisions. Symposium on Computational Geometry 2004: 230-238 |
| c58 | | Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang: Fractionally cascaded information in a sensor network. IPSN 2004: 311-319 |
| c57 | | John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Adaptive Spatial Partitioning for Multidimensional Data Streams. ISAAC 2004: 522-533 |
| c56 | | John Hershberger, Subhash Suri: Adaptive Sampling for Geometric Problems over Data Streams. PODS 2004: 252-262 |
| 2003 | ||
| j43 | | Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu: Discrete Mobile Centers. Discrete & Computational Geometry 30(1): 45-63 (2003) |
| c55 | | John Hershberger, Matthew Maxel, Subhash Suri: Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. ALENEX 2003: 26-36 |
| c54 | | John Hershberger: Smooth kinetic maintenance of clusters. Symposium on Computational Geometry 2003: 48-57 |
| c53 | | |
| c52 | | John Hershberger, Subhash Suri, Amit M. Bhosle: On the Difficulty of Some Shortest Path Problems. STACS 2003: 343-354 |
| 2002 | ||
| j42 | | 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) |
| j41 | | Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang: Deformable Free-Space Tilings for Kinetic Collision Detection. I. J. Robotic Res. 21(3): 179-198 (2002) |
| c51 | | John Hershberger, Subhash Suri: Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". FOCS 2002: 809- |
| 2001 | ||
| j40 | | Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang: Kinetic Connectivity for Unit Disks. Discrete & Computational Geometry 25(4): 591-610 (2001) |
| j39 | | Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach: Maintaining the Extent of a Moving Point Set. Discrete & Computational Geometry 26(3): 353-374 (2001) |
| j38 | | John Hershberger: Guest Editor's Foreword - Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, Minnesota, June 1998. Int. J. Comput. Geometry Appl. 11(3): 243-244 (2001) |
| c50 | | Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu: Discrete mobile centers. Symposium on Computational Geometry 2001: 188-196 |
| c49 | | John Hershberger, Subhash Suri: Vickrey Prices and Shortest Paths: What is an Edge Worth?. FOCS 2001: 252-259 |
| c48 | | Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu: Geometric spanner for routing in mobile networks. MobiHoc 2001: 45-55 |
| c47 | | John Hershberger, Subhash Suri: Simplified kinetic connectivity for rectangles and hypercubes. SODA 2001: 158-167 |
| c46 | | Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink: Polygonal path approximation with angle constraints. SODA 2001: 342-343 |
| 2000 | ||
| j37 | | Leonidas J. Guibas, John Hershberger, Subhash Suri: Morphing Simple Polygons. Discrete & Computational Geometry 24(1): 1-34 (2000) |
| j36 | | Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger: Lower Bounds for Kinetic Planar Subdivisions. Discrete & Computational Geometry 24(4): 721-733 (2000) |
| c45 | | Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang: Kinetic connectivity for unit disks. Symposium on Computational Geometry 2000: 331-340 |
| 1999 | ||
| j35 | | Julien Basch, Leonidas J. Guibas, John Hershberger: Data Structures for Mobile Data. J. Algorithms 31(1): 1-28 (1999) |
| j34 | | John Hershberger, Subhash Suri: An Optimal Algorithm for Euclidean Shortest Paths in the Plane. SIAM J. Comput. 28(6): 2215-2256 (1999) |
| c44 | | John Hershberger, Subhash Suri: Kinetic Connectivity of Rectangles. Symposium on Computational Geometry 1999: 237-246 |
| c43 | | Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger: Lower Bounds for Kinetic Planar Subdivisions. Symposium on Computational Geometry 1999: 247-254 |
| c42 | | Julien Basch, João Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang: Kinetic Data Structures: Animating Proofs Through Time. Symposium on Computational Geometry 1999: 427-428 |
| c41 | | Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang: Kinetic Collision Detection Between Two Simple Polygons. SODA 1999: 102-111 |
| 1998 | ||
| j33 | | John Hershberger, Jack Snoeyink: Erased arrangements of lines and convex decompositions of polyhedra. Comput. Geom. 9(3): 129-143 (1998) |
| j32 | | John Hershberger, Subhash Suri: Practical methods for approximating shortest paths on a convex polytope in R3. Comput. Geom. 10(1): 31-46 (1998) |
| j31 | | John Hershberger, Jack Snoeyink: Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. Comput. Geom. 11(3-4): 175-185 (1998) |
| 1997 | ||
| j30 | | John Hershberger, Subhash Suri: Finding a Shortest Diagonal of a Simple Polygon in Linear Time. Comput. Geom. 7: 149-160 (1997) |
| j29 | | John Hershberger, Subhash Suri: Matrix Searching with the Shortest-Path Metric. SIAM J. Comput. 26(6): 1612-1634 (1997) |
| c40 | | Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum: Snap Rounding Line Segments Efficiently in Two and Three Dimensions. Symposium on Computational Geometry 1997: 284-293 |
| c39 | | John Hershberger, Subhash Suri: Efficient Breakout Routing in Printed Circuit Boards. Symposium on Computational Geometry 1997: 460-462 |
| c38 | | Julien Basch, Leonidas J. Guibas, John Hershberger: Data Structures for Mobile Data. SODA 1997: 747-756 |
| c37 | | Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach: Maintaining the Extent of a Moving Point Set. WADS 1997: 31-44 |
| c36 | | John Hershberger, Jack Snoeyink: Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. WADS 1997: 93-103 |
| c35 | | John Hershberger, Subhash Suri: Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). WADS 1997: 462-471 |
| 1996 | ||
| j28 | | John Hershberger, Subhash Suri: Off-Line Maintenance of Planar Configurations. J. Algorithms 21(3): 453-475 (1996) |
| j27 | | Joseph Friedman, John Hershberger, Jack Snoeyink: Efficiently Planning Compliant Motion in the Plane. SIAM J. Comput. 25(3): 562-599 (1996) |
| 1995 | ||
| j26 | | John Hershberger: Optimal parallel algorithms for triangulated simple polygons. Int. J. Comput. Geometry Appl. 5: 145-170 (1995) |
| j25 | | John Hershberger, Subhash Suri: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. J. Algorithms 18(3): 403-431 (1995) |
| c34 | | Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter: The Centroid of Points with Approximate Weights. ESA 1995: 460-472 |
| c33 | | |
| c32 | | John Hershberger, Subhash Suri: Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. SODA 1995: 447-456 |
| 1994 | ||
| j24 | | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994) |
| j23 | | John Hershberger, Jack Snoeyink: Computing Minimum Length Paths of a Given Homotopy Class. Comput. Geom. 4: 63-97 (1994) |
| j22 | | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Selecting Heavily Covered Points. SIAM J. Comput. 23(6): 1138-1151 (1994) |
| j21 | | John Hershberger, Monika Rauch, Subhash Suri: Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. 130(1): 139-161 (1994) |
| c31 | | John Hershberger, Jack Snoeyink: An Efficient Solution to the Zookeeper's Problem. CCCG 1994: 104-109 |
| c30 | | Leonidas J. Guibas, John Hershberger: Morphing Simple Polygons. Symposium on Computational Geometry 1994: 267-276 |
| c29 | | John Hershberger, Jack Snoeyink: An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. Symposium on Computational Geometry 1994: 383-384 |
| 1993 | ||
| j20 | | David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri: Computing the Intersection-Depth of Polyhedra. Algorithmica 9(6): 518-533 (1993) |
| j19 | | David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink: An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. Algorithmica 10(1): 1-23 (1993) |
| j18 | | Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. Int. J. Comput. Geometry Appl. 3(4): 383-415 (1993) |
| j17 | | John Hershberger: A Faster Algorithm for the Two-Center Decision Problem. Inf. Process. Lett. 47(1): 23-29 (1993) |
| c28 | | John Hershberger: Compliant Motion in a Simple Polygon. Symposium on Computational Geometry 1993: 397-398 |
| c27 | | John Hershberger, Subhash Suri: Efficient Computation of Euclidean Shortest Paths in the Plane. FOCS 1993: 508-517 |
| c26 | | John Hershberger, Subhash Suri: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. SODA 1993: 54-63 |
| c25 | | |
| 1992 | ||
| j16 | | John Hershberger, Subhash Suri: Applications of a Semi-Dynamic Convex Hull Algorithm. BIT 32(2): 249-267 (1992) |
| j15 | | |
| j14 | | |
| j13 | | Marc H. Brown, John Hershberger: Color and Sound in Algorithmic Animation. IEEE Computer 25(12): 52-63 (1992) |
| c24 | | John Hershberger: Optimal Parallel Algorithms for Triangulated Simple Polygons. Symposium on Computational Geometry 1992: 33-42 |
| c23 | | John Hershberger, Monika Rauch, Subhash Suri: Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992: 233-244 |
| c22 | | John Hershberger, Jack Snoeyink: Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. SWAT 1992: 376-387 |
| 1991 | ||
| j12 | | Leonidas J. Guibas, John Hershberger, Jack Snoeyink: Compact interval trees: a data structure for convex hulls. Int. J. Comput. Geometry Appl. 1(1): 1-22 (1991) |
| j11 | | John Hershberger: A New Data Structure for Shortest Path Queries in a Simple Polygon. Inf. Process. Lett. 38(5): 231-235 (1991) |
| j10 | | |
| c21 | | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646 |
| c20 | | Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162 |
| c19 | | |
| c18 | | |
| c17 | | John Hershberger, Jack Snoeyink: Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). WADS 1991: 331-342 |
| 1990 | ||
| c16 | | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Slimming Down by Adding: Selecting Heavily Covered Points. Symposium on Computational Geometry 1990: 116-127 |
| c15 | | David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri: Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms 1990: 165-180 |
| c14 | | Leonidas J. Guibas, John Hershberger, Jack Snoeyink: Compact Interval Trees: A Data Structure for Convex Hulls. SODA 1990: 169-178 |
| c13 | | Joseph Friedman, John Hershberger, Jack Snoeyink: Input-Sensitive Compliant Motion in the Plane. SWAT 1990: 225-237 |
| c12 | | |
| c11 | | John Hershberger, Subhash Suri: Applications of a Semi-Dynamic Convex Hull Algorithm. SWAT 1990: 380-392 |
| 1989 | ||
| j9 | | John Hershberger: An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons. Algorithmica 4(1): 141-155 (1989) |
| j8 | | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Discrete & Computational Geometry 4: 433-466 (1989) |
| j7 | | 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. Discrete & Computational Geometry 4: 523-539 (1989) |
| j6 | | John Hershberger: Finding the Upper Envelope of n Line Segments in O(n log n) Time. Inf. Process. Lett. 33(4): 169-174 (1989) |
| j5 | | Leonidas J. Guibas, John Hershberger: Optimal Shortest Path Queries in a Simple Polygon. J. Comput. Syst. Sci. 39(2): 126-152 (1989) |
| c10 | | Joseph Friedman, John Hershberger, Jack Snoeyink: Compliant Motion in a Simple Polygon. Symposium on Computational Geometry 1989: 175-186 |
| c9 | | John Hershberger, Subhash Suri: Finding Tailored Partitions. Symposium on Computational Geometry 1989: 255-265 |
| c8 | | Jack Snoeyink, John Hershberger: Sweeping Arrangements of Curves. Symposium on Computational Geometry 1989: 354-363 |
| 1988 | ||
| j4 | | John Hershberger, Leonidas J. Guibas: An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. J. Algorithms 9(1): 18-46 (1988) |
| c7 | | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Symposium on Computational Geometry 1988: 56-69 |
| c6 | | 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. Symposium on Computational Geometry 1988: 258-265 |
| c5 | | David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink: An efficient algorithm for finding the CSG representation of a simple polygon. SIGGRAPH 1988: 31-40 |
| 1987 | ||
| j3 | | 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. Algorithmica 2: 209-233 (1987) |
| c4 | | John Hershberger: Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. Symposium on Computational Geometry 1987: 11-20 |
| c3 | | Leonidas J. Guibas, John Hershberger: Optimal Shortest Path Queries in a Simple Polygon. Symposium on Computational Geometry 1987: 50-63 |
| 1986 | ||
| j2 | | Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986) |
| c2 | | Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan: Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. Symposium on Computational Geometry 1986: 1-13 |
| 1985 | ||
| j1 | | Leonidas J. Guibas, John Hershberger: Computing the visibility graphs of n line segments in O(nn) time. Bulletin of the EATCS 26: 13-20 (1985) |
| c1 | | Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility-Polygon Search and Euclidean Shortest Paths. FOCS 1985: 155-164 |
Data released under the ODC-BY 1.0 license — See also our legal information page