John Hershberger

other persons with the same name:

• John Hershberger

	2009
123		John Hershberger, Efi Fogel: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009 ACM 2009
122		Irene Finocchi, John Hershberger: Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, January 3, 2009 SIAM 2009
	2008
121		John Hershberger, Subhash Suri: Simplified Planar Coresets for Data Streams. SWAT 2008: 5-16
120		John Hershberger, Nisheeth Shrivastava, Subhash Suri: Summarizing spatial data streams using ClusterHulls. ACM Journal of Experimental Algorithmics 13: (2008)
119		John Hershberger, Subhash Suri: Adaptive sampling for geometric problems over data streams. Comput. Geom. 39(3): 191-208 (2008)
118		John Hershberger: Improved Output-Sensitive Snap Rounding. Discrete & Computational Geometry 39(1-3): 298-318 (2008)
	2007
117		Sorabh Gandhi, John Hershberger, Subhash Suri: Approximate isocontours and spatial summaries for sensor networks. IPSN 2007: 400-409
116		Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, John Hershberger: Sparse data aggregation in sensor networks. IPSN 2007: 430-439
115		John Hershberger, Subhash Suri, Amit M. Bhosle: On the difficulty of some shortest path problems. ACM Transactions on Algorithms 3(1): (2007)
114		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)
	2006
113		Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri: Contour Approximation in Sensor Networks. DCOSS 2006: 356-371
112		John Hershberger, Nisheeth Shrivastava, Subhash Suri: Cluster Hull: A Technique for Summarizing Spatial Data Streams. ICDE 2006: 138
111		John Hershberger: Improved output-sensitive snap rounding. Symposium on Computational Geometry 2006: 357-366
110		John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica 46(1): 97-117 (2006)
	2005
109		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
108		John Hershberger: Smooth kinetic maintenance of clusters. Comput. Geom. 31(1-2): 3-30 (2005)
107		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)
106		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)
105		John Hershberger, Subhash Suri, Csaba D. Tóth: Binary Space Partitions of Orthogonal Subdivisions. SIAM J. Comput. 34(6): 1380-1397 (2005)
	2004
104		Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang: Fractionally cascaded information in a sensor network. IPSN 2004: 311-319
103		John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Adaptive Spatial Partitioning for Multidimensional Data Streams. ISAAC 2004: 522-533
102		John Hershberger, Subhash Suri: Adaptive Sampling for Geometric Problems over Data Streams. PODS 2004: 252-262
101		John Hershberger, Subhash Suri, Csaba D. Tóth: Binary space partitions of orthogonal subdivisions. Symposium on Computational Geometry 2004: 230-238
100		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)
99		John Hershberger: Kinetic collision detection with fast flight plan changes. Inf. Process. Lett. 92(6): 287-291 (2004)
	2003
98		John Hershberger, Matthew Maxel, Subhash Suri: Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. ALENEX 2003: 26-36
97		John Hershberger, Subhash Suri: Binary space partitions for 3D subdivisions. SODA 2003: 100-108
96		John Hershberger, Subhash Suri, Amit M. Bhosle: On the Difficulty of Some Shortest Path Problems. STACS 2003: 343-354
95		John Hershberger: Smooth kinetic maintenance of clusters. Symposium on Computational Geometry 2003: 48-57
94		Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu: Discrete Mobile Centers. Discrete & Computational Geometry 30(1): 45-63 (2003)
	2002
93		John Hershberger, Subhash Suri: Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". FOCS 2002: 809-
92		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)
91		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)
	2001
90		John Hershberger, Subhash Suri: Vickrey Prices and Shortest Paths: What is an Edge Worth?. FOCS 2001: 252-259
89		Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu: Geometric spanner for routing in mobile networks. MobiHoc 2001: 45-55
88		John Hershberger, Subhash Suri: Simplified kinetic connectivity for rectangles and hypercubes. SODA 2001: 158-167
87		Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink: Polygonal path approximation with angle constraints. SODA 2001: 342-343
86		Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu: Discrete mobile centers. Symposium on Computational Geometry 2001: 188-196
85		Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang: Kinetic Connectivity for Unit Disks. Discrete & Computational Geometry 25(4): 591-610 (2001)
84		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)
83		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)
	2000
82		Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang: Kinetic connectivity for unit disks. Symposium on Computational Geometry 2000: 331-340
81		Leonidas J. Guibas, John Hershberger, Subhash Suri: Morphing Simple Polygons. Discrete & Computational Geometry 24(1): 1-34 (2000)
80		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)
	1999
79		Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang: Kinetic Collision Detection Between Two Simple Polygons. SODA 1999: 102-111
78		John Hershberger, Subhash Suri: Kinetic Connectivity of Rectangles. Symposium on Computational Geometry 1999: 237-246
77		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
76		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
75		Julien Basch, Leonidas J. Guibas, John Hershberger: Data Structures for Mobile Data. J. Algorithms 31(1): 1-28 (1999)
74		John Hershberger, Subhash Suri: An Optimal Algorithm for Euclidean Shortest Paths in the Plane. SIAM J. Comput. 28(6): 2215-2256 (1999)
	1998
73		John Hershberger, Subhash Suri: Practical methods for approximating shortest paths on a convex polytope in R3. Comput. Geom. 10(1): 31-46 (1998)
72		John Hershberger, Jack Snoeyink: Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. Comput. Geom. 11(3-4): 175-185 (1998)
71		John Hershberger, Jack Snoeyink: Erased arrangements of lines and convex decompositions of polyhedra. Comput. Geom. 9(3): 129-143 (1998)
	1997
70		Julien Basch, Leonidas J. Guibas, John Hershberger: Data Structures for Mobile Data. SODA 1997: 747-756
69		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
68		John Hershberger, Subhash Suri: Efficient Breakout Routing in Printed Circuit Boards. Symposium on Computational Geometry 1997: 460-462
67		Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach: Maintaining the Extent of a Moving Point Set. WADS 1997: 31-44
66		John Hershberger, Subhash Suri: Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). WADS 1997: 462-471
65		John Hershberger, Jack Snoeyink: Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. WADS 1997: 93-103
64		John Hershberger, Subhash Suri: Finding a Shortest Diagonal of a Simple Polygon in Linear Time. Comput. Geom. 7: 149-160 (1997)
63		John Hershberger, Subhash Suri: Matrix Searching with the Shortest-Path Metric. SIAM J. Comput. 26(6): 1612-1634 (1997)
	1996
62		John Hershberger, Subhash Suri: Off-Line Maintenance of Planar Configurations. J. Algorithms 21(3): 453-475 (1996)
61		Joseph Friedman, John Hershberger, Jack Snoeyink: Efficiently Planning Compliant Motion in the Plane. SIAM J. Comput. 25(3): 562-599 (1996)
	1995
60		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
59		John Hershberger, Subhash Suri: Morphing Binary Trees. SODA 1995: 396-404
58		John Hershberger, Subhash Suri: Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. SODA 1995: 447-456
57		John Hershberger: Optimal parallel algorithms for triangulated simple polygons. Int. J. Comput. Geometry Appl. 5: 145-170 (1995)
56		John Hershberger, Subhash Suri: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. J. Algorithms 18(3): 403-431 (1995)
	1994
55		John Hershberger, Jack Snoeyink: An Efficient Solution to the Zookeeper's Problem. CCCG 1994: 104-109
54		Leonidas J. Guibas, John Hershberger: Morphing Simple Polygons. Symposium on Computational Geometry 1994: 267-276
53		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
52		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)
51		John Hershberger, Jack Snoeyink: Computing Minimum Length Paths of a Given Homotopy Class. Comput. Geom. 4: 63-97 (1994)
50		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)
49		John Hershberger, Monika Rauch, Subhash Suri: Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. 130(1): 139-161 (1994)
	1993
48		John Hershberger, Subhash Suri: Efficient Computation of Euclidean Shortest Paths in the Plane FOCS 1993: 508-517
47		John Hershberger, Subhash Suri: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. SODA 1993: 54-63
46		John Hershberger, Subhash Suri: Matrix searching with the shortest path metric. STOC 1993: 485-494
45		John Hershberger: Compliant Motion in a Simple Polygon. Symposium on Computational Geometry 1993: 397-398
44		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)
43		David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri: Computing the Intersection-Depth of Polyhedra. Algorithmica 9(6): 518-533 (1993)
42		John Hershberger: A Faster Algorithm for the Two-Center Decision Problem. Inf. Process. Lett. 47(1): 23-29 (1993)
41		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)
	1992
40		John Hershberger, Monika Rauch, Subhash Suri: Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992: 233-244
39		John Hershberger, Jack Snoeyink: Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. SWAT 1992: 376-387
38		John Hershberger: Optimal Parallel Algorithms for Triangulated Simple Polygons. Symposium on Computational Geometry 1992: 33-42
37		John Hershberger, Subhash Suri: Applications of a Semi-Dynamic Convex Hull Algorithm. BIT 32(2): 249-267 (1992)
36		John Hershberger: Minimizing the Sum of Diameters Efficiently. Comput. Geom. 2: 111-118 (1992)
35		John Hershberger: Upper Envelope Onion Peeling. Comput. Geom. 2: 93-110 (1992)
34		Marc H. Brown, John Hershberger: Color and Sound in Algorithmic Animation. IEEE Computer 25(12): 52-63 (1992)
	1991
33		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
32		Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162
31		John Hershberger, Subhash Suri: Offline Maintenance of Planar Configurations. SODA 1991: 32-41
30		Marc H. Brown, John Hershberger: Color and Sound in Algorithm Animation. VL 1991: 10-17
29		John Hershberger, Jack Snoeyink: Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). WADS 1991: 331-342
28		John Hershberger: A New Data Structure for Shortest Path Queries in a Simple Polygon. Inf. Process. Lett. 38(5): 231-235 (1991)
27		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)
26		John Hershberger, Subhash Suri: Finding Tailored Partitions. J. Algorithms 12(3): 431-463 (1991)
	1990
25		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
24		Leonidas J. Guibas, John Hershberger, Jack Snoeyink: Compact Interval Trees: A Data Structure for Convex Hulls. SODA 1990: 169-178
23		Joseph Friedman, John Hershberger, Jack Snoeyink: Input-Sensitive Compliant Motion in the Plane. SWAT 1990: 225-237
22		John Hershberger: Upper Envelope Onion Peeling. SWAT 1990: 368-379
21		John Hershberger, Subhash Suri: Applications of a Semi-Dynamic Convex Hull Algorithm. SWAT 1990: 380-392
20		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
	1989
19		Joseph Friedman, John Hershberger, Jack Snoeyink: Compliant Motion in a Simple Polygon. Symposium on Computational Geometry 1989: 175-186
18		John Hershberger, Subhash Suri: Finding Tailored Partitions. Symposium on Computational Geometry 1989: 255-265
17		Jack Snoeyink, John Hershberger: Sweeping Arrangements of Curves. Symposium on Computational Geometry 1989: 354-363
16		John Hershberger: An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons. Algorithmica 4(1): 141-155 (1989)
15		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)
14		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)
13		John Hershberger: Finding the Upper Envelope of n Line Segments in O(n log n) Time. Inf. Process. Lett. 33(4): 169-174 (1989)
12		Leonidas J. Guibas, John Hershberger: Optimal Shortest Path Queries in a Simple Polygon. J. Comput. Syst. Sci. 39(2): 126-152 (1989)
	1988
11		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
10		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
9		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
8		John Hershberger, Leonidas J. Guibas: An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. J. Algorithms 9(1): 18-46 (1988)
	1987
7		John Hershberger: Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. Symposium on Computational Geometry 1987: 11-20
6		Leonidas J. Guibas, John Hershberger: Optimal Shortest Path Queries in a Simple Polygon. Symposium on Computational Geometry 1987: 50-63
5		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)
	1986
4		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
3		Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986)
	1985
2		Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility-Polygon Search and Euclidean Shortest Paths FOCS 1985: 155-164
1		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)

Coauthor Index

1	Pankaj K. Agarwal	[67] [77] [80] [84] [91] [92]
2	Takao Asano	[2] [3]
3	Tetsuo Asano	[2] [3]
4	Julien Basch	[70] [75] [76] [77] [79] [80] [91] [100]
5	Mark de Berg	[77] [80]
6	Marshall W. Bern	[60]
7	Amit M. Bhosle	[96] [115]
8	Marc H. Brown	[30] [34]
9	Chiranjeeb Buragohain	[113]
10	Bernard Chazelle	[20] [33] [50] [52]
11	Danny Z. Chen	[87] [107]
12	João Luiz Dihl Comba (João Comba)	[76]
13	Ovidiu Daescu	[87] [107]
14	David P. Dobkin	[11] [25] [43] [44]
15	Herbert Edelsbrunner	[9] [10] [14] [15] [20] [33] [50] [52] [92]
16	David Eppstein	[60]
17	Jeff Erickson	[79] [92] [100]
18	Irene Finocchi	[122]
19	Efi Fogel	[123]
20	Joseph Friedman	[19] [23] [61]
21	Sorabh Gandhi	[113] [117]
22	Jie Gao	[86] [89] [94] [104] [106] [116]
23	Michael T. Goodrich	[69]
24	Michelangelo Grigni	[33] [52]
25	Leonidas J. Guibas	[1] [2] [3] [4] [5] [6] [8] [9] [10] [11] [12] [14] [15] [20] [24] [27] [32] [33] [41] [44] [50] [52] [54] [60] [67] [69] [70] [75] [76] [77] [79] [80] [81] [82] [84] [85] [86] [89] [91] [92] [94] [100] [104] [106] [116]
26	Sariel Har-Peled	[92]
27	Monika Rauch Henzinger (Monika Henzinger, Monika Rauch)	[40] [49]
28	Hiroshi Imai	[2] [3]
29	Michael Isard	[92]
30	Christian S. Jensen	[92]
31	Lydia E. Kavraki	[92]
32	David G. Kirkpatrick	[25] [43]
33	Patrice Koehl	[92]
34	Peter M. Kogge	[87] [107]
35	Daniel Leven	[4] [5]
36	Ming C. Lin	[92]
37	Dinesh Manocha	[92]
38	Matthew Maxel	[98] [114]
39	Dimitris N. Metaxas	[92]
40	Ningfang Mi	[107]
41	Nikola Milosavljevic	[116]
42	Brian Mirtich	[92]
43	Joseph S. B. Mitchell	[32] [41]
44	David M. Mount	[92]
45	S. Muthukrishnan (S. Muthu Muthukrishnan)	[92]
46	János Pach	[10] [14]
47	Dinesh K. Pai	[92]
48	Richard Pollack	[10] [14]
49	Elisha Sacks	[92]
50	Raimund Seidel	[9] [10] [14] [15] [20] [50]
51	Micha Sharir	[4] [5] [9] [10] [14] [15] [20] [33] [50] [52]
52	Nisheeth Shrivastava	[103] [109] [110] [112] [120]
53	Craig Silverstein	[76]
54	Jack Snoeyink	[9] [10] [11] [14] [15] [17] [19] [23] [24] [27] [29] [32] [33] [39] [41] [44] [51] [52] [53] [55] [61] [65] [71] [72] [87] [92] [107]
55	Subhash Suri	[18] [21] [25] [26] [31] [37] [40] [43] [46] [47] [48] [49] [56] [58] [59] [60] [62] [63] [64] [66] [68] [73] [74] [78] [81] [82] [85] [88] [90] [92] [93] [96] [97] [98] [101] [102] [103] [105] [109] [110] [112] [113] [114] [115] [117] [119] [120] [121]
56	Paul J. Tanenbaum	[69]
57	Robert Endre Tarjan	[4] [5]
58	Csaba D. Tóth	[101] [103] [105] [109] [110]
59	Eric Veach	[67] [84]
60	Emo Welzl	[9] [15]
61	Ouri Wolfson	[92]
62	Jan Wolter	[60]
63	Li Zhang	[76] [79] [82] [85] [86] [89] [91] [94] [100] [104] [106]
64	An Zhu	[86] [89] [94] [106]

Colors in the list of coauthors