Sariel Har-Peled

שריאל הר-פלד

	2012
146		Anne Driemel, Sariel Har-Peled: Jaywalking your dog: computing the Fréchet distance with shortcuts. SODA 2012: 318-337
145		Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled: Faster Approximate Distance Queries and Compact Routing in Sparse Graphs CoRR abs/1201.2703: (2012)
144		Sariel Har-Peled, Benjamin Raichel: Fréchet Distance Revisited and Extended CoRR abs/1202.5610: (2012)
143		Mohammad Ali Abam, Sariel Har-Peled: New constructions of SSPDs and their applications. Comput. Geom. 45(5-6): 200-214 (2012)
142		Anne Driemel, Sariel Har-Peled, Carola Wenk: Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. Discrete & Computational Geometry 48(1): 94-127 (2012)
141		Sariel Har-Peled, Mira Lee: Weighted geometric set cover problems revisited. JoCG 3(1): 65-85 (2012)
	2011
140		Rachit Agarwal, Philip Brighten Godfrey, Sariel Har-Peled: Approximate distance queries and compact routing in sparse graphs. INFOCOM 2011: 1754-1762
139		Sariel Har-Peled, Nirman Kumar: Approximate Nearest Neighbor Search for Low Dimensional Queries. SODA 2011: 854-867
138		Sariel Har-Peled, Benjamin Raichel: The frechet distance revisited and extended. Symposium on Computational Geometry 2011: 448-457
137		Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk: Computing the Fréchet Distance between Folded Polygons. WADS 2011: 267-278
136		Timothy M. Chan, Sariel Har-Peled: Approximation Algorithms for Maximum Independent Set of Pseudo-Disks CoRR abs/1103.1431: (2011)
135		Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk: Computing the Fréchet Distance Between Folded Polygons CoRR abs/1103.2865: (2011)
134		Sariel Har-Peled: A Simple Proof of the Existence of a Planar Separator CoRR abs/1105.0103: (2011)
133		Anne Driemel, Sariel Har-Peled: Jaywalking your Dog - Computing the Fréchet Distance with Shortcuts CoRR abs/1107.1720: (2011)
132		Alina Ene, Sariel Har-Peled, Benjamin Raichel: Geometric Packing under Non-uniform Constraints CoRR abs/1107.2949: (2011)
131		Sariel Har-Peled, Nirman Kumar: Down the Rabbit Hole: Robust Proximity Search in Sublinear Space CoRR abs/1111.2942: (2011)
130		Sariel Har-Peled: On the Expected Complexity of Random Convex Hulls CoRR abs/1111.5340: (2011)
129		Anne Driemel, Sariel Har-Peled, Benjamin Raichel: On the Expected Complexity of Voronoi Diagrams on Terrains CoRR abs/1112.0695: (2011)
128		Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth: Minimum Convex Partitions and Maximum Empty Polytopes CoRR abs/1112.1124: (2011)
127		Sariel Har-Peled, Micha Sharir: Relative (p, ε)-Approximations in Geometry. Discrete & Computational Geometry 45(3): 462-496 (2011)
	2010
126		Mohammad Ali Abam, Sariel Har-Peled: New constructions of SSPDs and their applications. Symposium on Computational Geometry 2010: 192-200
125		Anne Driemel, Sariel Har-Peled, Carola Wenk: Approximating the Fréchet distance for realistic curves in near linear time. Symposium on Computational Geometry 2010: 365-374
124		Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang: Hausdorff distance under translation for points and balls. ACM Transactions on Algorithms 6(4): (2010)
123		Anne Driemel, Sariel Har-Peled, Carola Wenk: Approximating the Fréchet Distance for Realistic Curves in Near Linear Time CoRR abs/1003.0460: (2010)
122		Sariel Har-Peled, Nirman Kumar: Approximate Nearest Neighbor Search for Low Dimensional Queries CoRR abs/1007.3296: (2010)
	2009
121		Timothy M. Chan, Sariel Har-Peled: Approximation algorithms for maximum independent set of pseudo-disks. Symposium on Computational Geometry 2009: 333-340
120		Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the set multi-cover problem in geometric settings. Symposium on Computational Geometry 2009: 341-350
119		Amitabha Bagchi, Sariel Har-Peled, Achal Premi, Adit Madan: Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space CoRR abs/0903.0742: (2009)
118		Sariel Har-Peled: Randomized Incremental Construction of Compressed Quadtrees CoRR abs/0907.0907: (2009)
117		Sariel Har-Peled: Approximating Spanning Trees with Low Crossing Number CoRR abs/0907.1131: (2009)
116		Sariel Har-Peled: Being Fat and Friendly is Not Enough CoRR abs/0908.2369: (2009)
115		Sariel Har-Peled: Carnival of Samplings: Nets, Approximations, Relative and Sensitive CoRR abs/0908.3716: (2009)
114		Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the Set Multi-Cover Problem in Geometric Settings CoRR abs/0909.0537: (2009)
113		Sariel Har-Peled, Micha Sharir: Relative (p,epsilon)-Approximations in Geometry CoRR abs/0909.0717: (2009)
112		Mark de Berg, Sergio Cabello, Sariel Har-Peled: Covering Many or Few Points with Unit Disks. Theory Comput. Syst. 45(3): 446-469 (2009)
	2008
111		Sariel Har-Peled, S. Muthukrishnan: Range Medians. ESA 2008: 503-514
110		Sariel Har-Peled, S. Muthukrishnan: Range Medians CoRR abs/0807.0222: (2008)
109		Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu: Robust Shape Fitting via Peeling and Grating Coresets. Discrete & Computational Geometry 39(1-3): 38-58 (2008)
108		Ke Chen, Sariel Har-Peled: The Euclidean Orienteering Problem Revisited. SIAM J. Comput. 38(1): 385-397 (2008)
107		Boris Aronov, Sariel Har-Peled: On Approximating the Depth and Related Problems. SIAM J. Comput. 38(3): 899-921 (2008)
	2007
106		Sariel Har-Peled, Dan Roth, Dav Zimak: Maximum Margin Coresets for Active and Noise Tolerant Learning. IJCAI 2007: 836-841
105		Boris Aronov, Sariel Har-Peled, Micha Sharir: On approximate halfspace range counting and relative epsilon-approximations. Symposium on Computational Geometry 2007: 327-336
104		Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu: Embeddings of surfaces, curves, and moving points in euclidean space. Symposium on Computational Geometry 2007: 381-389
103		Sariel Har-Peled: How to get close to the median shape. Comput. Geom. 36(1): 39-51 (2007)
102		Sariel Har-Peled, Akash Kushal: Smaller Coresets for k-Median and k-Means Clustering. Discrete & Computational Geometry 37(1): 3-19 (2007)
101		Otfried Cheong, Alon Efrat, Sariel Har-Peled: Finding a Guard that Sees Most and a Shop that Sells Most. Discrete & Computational Geometry 37(4): 545-563 (2007)
	2006
100		Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk: Fréchet Distance for Curves, Revisited. ESA 2006: 52-63
99		Sariel Har-Peled: Coresets for Discrete Integration and Clustering. FSTTCS 2006: 33-44
98		Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu: Robust shape fitting via peeling and grating coresets. SODA 2006: 182-191
97		Ke Chen, Sariel Har-Peled: The orienteering problem in the plane revisited. Symposium on Computational Geometry 2006: 247-254
96		Sariel Har-Peled: How to get close to the median shape. Symposium on Computational Geometry 2006: 402-410
95		Mark de Berg, Sergio Cabello, Sariel Har-Peled: Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68
94		Jeff Erickson, Sariel Har-Peled, David M. Mount: On the Least Median Square Problem. Discrete & Computational Geometry 36(4): 593-607 (2006)
93		Alon Efrat, Sariel Har-Peled: Guarding galleries and terrains. Inf. Process. Lett. 100(6): 238-245 (2006)
92		Sariel Har-Peled, Manor Mendel: Fast Construction of Nets in Low-Dimensional Metrics and Their Applications. SIAM J. Comput. 35(5): 1148-1184 (2006)
	2005
91		Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell: Approximation algorithms for location problems in sensor networks. BROADNETS 2005: 767-776
90		John Fischer, Sariel Har-Peled: Dynamic Well-Separated Pair Decomposition Made Easy. CCCG 2005: 235-238
89		Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled: Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. CCCG 2005: 43-46
88		Sariel Har-Peled: Approximation algorithm for the L1-fitting circle problem. EuroCG 2005: 103-106
87		Sariel Har-Peled, Vladlen Koltun: Separability with Outliers. ISAAC 2005: 28-39
86		Sariel Har-Peled, Bardia Sadri: How fast is the k-means method? SODA 2005: 877-885
85		Boris Aronov, Sariel Har-Peled: On approximating the depth and related problems. SODA 2005: 886-894
84		Sariel Har-Peled, Akash Kushal: Smaller coresets for k-median and k-means clustering. Symposium on Computational Geometry 2005: 126-134
83		Sariel Har-Peled, Manor Mendel: Fast construction of nets in low dimensional metrics, and their applications. Symposium on Computational Geometry 2005: 150-158
82		Sariel Har-Peled, Alper Üngör: A time-optimal delaunay refinement algorithm in two dimensions. Symposium on Computational Geometry 2005: 228-236
81		Sariel Har-Peled, Soham Mazumdar: Fast Algorithms for Computing the Smallest k-Enclosing Circle. Algorithmica 41(3): 147-157 (2005)
80		Sariel Har-Peled, Bardia Sadri: How Fast Is the k-Means Method? Algorithmica 41(3): 185-202 (2005)
79		Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005)
78		Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang: Near-Linear Time Approximation Algorithms for Curve Simplification. Algorithmica 42(3-4): 203-219 (2005)
77		Sariel Har-Peled, Alper Üngör: A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions CoRR abs/cs/0501007: (2005)
76		Paz Carmi, Sariel Har-Peled, Matthew J. Katz: On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005)
75		Sariel Har-Peled, Shakhar Smorodinsky: Conflict-Free Coloring of Points and Simple Regions in the Plane. Discrete & Computational Geometry 34(1): 47-70 (2005)
74		Shivani Agarwal, Thore Graepel, Ralf Herbrich, Sariel Har-Peled, Dan Roth: Generalization Bounds for the Area Under the ROC Curve. Journal of Machine Learning Research 6: 393-425 (2005)
73		Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella: Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005)
	2004
72		Sariel Har-Peled: No, Coreset, No Cry. FSTTCS 2004: 324-335
71		Otfried Cheong, Alon Efrat, Sariel Har-Peled: On finding a guard that sees most and a shop that sells most. SODA 2004: 1098-1107
70		Sariel Har-Peled, Soham Mazumdar: On coresets for k-means and k-median clustering. STOC 2004: 291-300
69		Jeff Erickson, Sariel Har-Peled, David M. Mount: On the least median square problem. Symposium on Computational Geometry 2004: 273-279
68		Sariel Har-Peled, Manor Mendel: Fast Construction of Nets in Low Dimensional Metrics, and Their Applications CoRR cs.DS/0409057: (2004)
67		Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek: The One-Round Voronoi Game. Discrete & Computational Geometry 31(1): 125-138 (2004)
66		Jeff Erickson, Sariel Har-Peled: Optimally Cutting a Surface into a Disk. Discrete & Computational Geometry 31(1): 37-59 (2004)
65		Sariel Har-Peled: Clustering Motion. Discrete & Computational Geometry 31(4): 545-565 (2004)
64		Sariel Har-Peled, Kasturi R. Varadarajan: High-Dimensional Shape Fitting in Linear Time. Discrete & Computational Geometry 32(2): 269-288 (2004)
63		Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan: Approximating extent measures of points. J. ACM 51(4): 606-635 (2004)
62		Sariel Har-Peled, Yusu Wang: Shape Fitting with Outliers. SIAM J. Comput. 33(2): 269-285 (2004)
	2003
61		Sariel Har-Peled, Soham Mazumdar: Fast Algorithms for Computing the Smallest k-Enclosing Disc. ESA 2003: 278-288
60		Sariel Har-Peled, Shakhar Smorodinsky: On conflict-free coloring of points and simple regions in the plane. Symposium on Computational Geometry 2003: 114-123
59		Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang: Hausdorff distance under translation for points and balls. Symposium on Computational Geometry 2003: 282-291
58		Sariel Har-Peled, Yusu Wang: Shape fitting with outliers. Symposium on Computational Geometry 2003: 29-38
57		Sariel Har-Peled, Kasturi R. Varadarajan: High-dimensional shape fitting in linear time. Symposium on Computational Geometry 2003: 39-47
56		Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg: Efficient algorithms for shared camera control. Symposium on Computational Geometry 2003: 68-77
55		Sariel Har-Peled, Piotr Indyk: When Crossings Count - Approximating the Minimum Spanning Tree CoRR cs.CG/0303001: (2003)
54		Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled: An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane. Int. J. Comput. Geometry Appl. 13(6): 463-485 (2003)
	2002
53		Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled: STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. ALENEX 2002: 178-193
52		Sariel Har-Peled, Dan Roth, Dav Zimak: Constraint Classification: A New Approach to Multiclass Classification. ALT 2002: 365-379
51		Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang: Near-Linear Time Approximation Algorithms for Curve Simplification. ESA 2002: 29-41
50		Ashutosh Garg, Sariel Har-Peled, Dan Roth: On generalization bounds, projection profile, and margin distribution. ICML 2002: 171-178
49		Alon Efrat, Sariel Har-Peled: Guarding Galleries and Terrains. IFIP TCS 2002: 181-192
48		Sariel Har-Peled, Dan Roth, Dav Zimak: Constraint Classification for Multiclass Classification and Ranking. NIPS 2002: 785-792
47		Mihai Badoiu, Sariel Har-Peled, Piotr Indyk: Approximate clustering via core-sets. STOC 2002: 250-257
46		Jeff Erickson, Sariel Har-Peled: Optimally cutting a surface into a disk. Symposium on Computational Geometry 2002: 244-253
45		Sariel Har-Peled, Kasturi R. Varadarajan: Projective clustering in high dimensions using core-sets. Symposium on Computational Geometry 2002: 312-318
44		Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek: The one-round Voronoi game. Symposium on Computational Geometry 2002: 97-101
43		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)
42		Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia: Computing Approximate Shortest Paths on Convex Polytopes. Algorithmica 33(2): 227-242 (2002)
41		Jeff Erickson, Sariel Har-Peled: Optimally cutting a surface into a disk CoRR cs.CG/0207004: (2002)
40		Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23(2): 195-207 (2002)
39		Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali: New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. Discrete & Computational Geometry 28(4): 535-569 (2002)
	2001
38		Sariel Har-Peled, Kasturi R. Varadarajan: Approximate Shape Fitting via Linearization. FOCS 2001: 66-73
37		Sariel Har-Peled: Clustering Motion. FOCS 2001: 84-93
36		Sariel Har-Peled: A Replacement for Voronoi Diagrams of Near Linear Size. FOCS 2001: 94-103
35		Pankaj K. Agarwal, Sariel Har-Peled: Maintaining approximate extent measures of moving points. SODA 2001: 148-157
34		Sariel Har-Peled, Micha Sharir: Online point location in planar arrangements and its applications. SODA 2001: 57-66
33		Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali: Morphing between polylines. SODA 2001: 680-689
32		Sariel Har-Peled: A practical approach for computing the diameter of a point set. Symposium on Computational Geometry 2001: 177-186
31		Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS 2001: 122-134
30		Sariel Har-Peled, Micha Sharir: Online Point Location in Planar Arrangements and Its Applications. Discrete & Computational Geometry 26(1): 19-40 (2001)
29		Yehuda Afek, Anat Bremler-Barr, Sariel Har-Peled: Routing with a clue. IEEE/ACM Trans. Netw. 9(6): 693-705 (2001)
28		Gill Barequet, Sariel Har-Peled: Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. Int. J. Comput. Geometry Appl. 11(4): 465-474 (2001)
27		Gill Barequet, Sariel Har-Peled: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. J. Algorithms 38(1): 91-109 (2001)
	2000
26		Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali: Sweeping simple polygons with a chain of guards. SODA 2000: 927-936
25		Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir: Computing the Penetration Depth of Two Convex Polytopes in 3D. SWAT 2000: 328-338
24		Sariel Har-Peled, Piotr Indyk: When crossings count - approximating the minimum spanning tree. Symposium on Computational Geometry 2000: 166-175
23		Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia: Computing approximate shortest paths on convex polytopes. Symposium on Computational Geometry 2000: 270-279
22		Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir: Approximation Algorithms for Minimum-Width Annuli and Shells. Discrete & Computational Geometry 24(4): 687-705 (2000)
21		Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir: Penetration Depth of Two Convex Polytopes in 3D. Nord. J. Comput. 7(3): 227-240 (2000)
20		Sariel Har-Peled: Constructing Planar Cuttings in Theory and Practice. SIAM J. Comput. 29(6): 2016-2039 (2000)
19		Sariel Har-Peled: Taking a Walk in a Planar Arrangement. SIAM J. Comput. 30(4): 1341-1367 (2000)
	1999
18		Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart: On-Line Zone Construction in Arrangements of Lines in the Plane. Algorithm Engineering 1999: 139-153
17		Sariel Har-Peled: Taking a Walk in a Planar Arrangement. FOCS 1999: 100-111
16		Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled: Routing with a Clue. SIGCOMM 1999: 203-214
15		Gill Barequet, Sariel Har-Peled: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. SODA 1999: 82-91
14		Gill Barequet, Sariel Har-Peled: Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. SODA 1999: 862-863
13		Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir: Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Symposium on Computational Geometry 1999: 380-389
12		Sariel Har-Peled: Multicolor Combination Lemma. Comput. Geom. 12(3-4): 155-176 (1999)
11		Sariel Har-Peled: Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions. Discrete & Computational Geometry 21(2): 217-231 (1999)
10		Sariel Har-Peled: Constructing Approximate Shortest Path Maps in Three Dimensions. SIAM J. Comput. 28(4): 1182-1197 (1999)
	1998
9		Alon Efrat, Sariel Har-Peled: Fly Cheaply: On the Minimum Fuel-Consumption Problem. Symposium on Computational Geometry 1998: 143-145
8		Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl: Results on k-Sets and j-Facets via Continuous Motion. Symposium on Computational Geometry 1998: 192-199
7		Sariel Har-Peled: Constructing Cuttings in Theory and Practice. Symposium on Computational Geometry 1998: 327-336
6		Sariel Har-Peled: An Output Sensitive Algorithm for Discrete Convex Hulls. Symposium on Computational Geometry 1998: 357-364
5		Sariel Har-Peled: Constructing Approximate Shortest Path Maps in Three Dimensions. Symposium on Computational Geometry 1998: 383-391
4		Sariel Har-Peled: An output sensitive algorithm for discrete convex hulls. Comput. Geom. 10(2): 125-138 (1998)
	1997
3		Sariel Har-Peled: Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions. Symposium on Computational Geometry 1997: 359-365
2		Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating shortest paths on a convex polytope in three dimensions. J. ACM 44(4): 567-584 (1997)
	1996
1		Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating Shortest Paths on a Convex Polytope in Three Dimensions. Symposium on Computational Geometry 1996: 329-338

Coauthor Index

1	Mohammad Ali Abam	[126] [143]
2	Yehuda Afek	[16] [29]
3	Pankaj K. Agarwal	[2] [13] [21] [22] [23] [25] [31] [35] [40] [42] [43] [51] [53] [59] [63] [78] [89] [98] [104] [109] [124]
4	Rachit Agarwal	[140] [145]
5	Shivani Agarwal	[74]
6	Yuval Aharoni	[18]
7	Ernst Althaus	[73]
8	Artur Andrzejak	[8]
9	Boris Aronov	[8] [13] [22] [85] [100] [105] [107]
10	Mihai Badoiu	[47]
11	Amitabha Bagchi	[119]
12	Gill Barequet	[14] [15] [27] [28]
13	Mark de Berg	[31] [40] [89] [95] [112]
14	Anat Bremler-Barr	[16] [29]
15	Sergio Cabello	[95] [112]
16	Paz Carmi	[76] [79]
17	Timothy M. Chan	[121] [136]
18	Chandra Chekuri	[114] [120]
19	Ke Chen	[97] [108]
20	Otfried Cheong (Otfried Schwarzkopf)	[44] [67] [71] [101]
21	Kenneth L. Clarkson	[114] [120]
22	Atlas F. Cook (Atlas F. Cook IV)	[135] [137]
23	Shlomi Dolev	[79]
24	Anne Driemel	[123] [125] [129] [133] [135] [137] [142] [146]
25	Adrian Dumitrescu	[128]
26	Herbert Edelsbrunner	[43]
27	Alon Efrat	[9] [26] [33] [39] [49] [71] [91] [93] [101]
28	Alina Ene	[132]
29	Jeff Erickson	[41] [43] [46] [66] [69] [94]
30	John Fischer	[90]
31	Stefan Funke	[73]
32	Jie Gao	[89]
33	Ashutosh Garg	[50]
34	Brighten Godfrey (Philip Brighten Godfrey)	[140] [145]
35	Kenneth Y. Goldberg	[56]
36	Thore Graepel	[74]
37	Leonidas J. Guibas	[21] [25] [26] [33] [39] [43] [89]
38	Dan Halperin	[18] [54]
39	Iddo Hanniel	[18] [54]
40	Ralf Herbrich	[74]
41	John Hershberger	[43]
42	Piotr Indyk	[24] [47] [55]
43	Michael Isard	[43]
44	Christian S. Jensen	[43]
45	Meetesh Karia	[23] [42]
46	Matthew J. Katz (Matya Katz)	[76] [79]
47	Lydia E. Kavraki	[43]
48	Christian Knauer	[100]
49	Patrice Koehl	[43]
50	Vladlen Koltun	[56] [87]
51	Jochen Könemann	[73]
52	Nirman Kumar	[122] [131] [139]
53	Akash Kushal	[84] [102]
54	Mira Lee	[141]
55	David C. Lin	[26]
56	Ming C. Lin	[43]
57	Chaim Linhart	[18] [54]
58	Nathan Linial (Nati Linial)	[44] [67]
59	Adit Madan	[119]
60	Dinesh Manocha	[43]
61	Jirí Matousek	[44] [67]
62	Soham Mazumdar	[61] [70] [81]
63	Manor Mendel	[68] [83] [92]
64	Dimitris N. Metaxas	[43]
65	Brian Mirtich	[43]
66	Joseph S. B. Mitchell	[26] [39] [91]
67	David M. Mount	[43] [69] [94]
68	T. M. Murali	[26] [33] [39]
69	Nabil H. Mustafa	[51] [78]
70	S. Muthukrishnan (S. Muthu Muthukrishnan)	[43] [110] [111]
71	Mark H. Overmars	[31] [40]
72	Dinesh K. Pai	[43]
73	Achal Premi	[119]
74	Cecilia M. Procopiuc (Cecilia Magdalena Procopiuc, Cecilia Magdalena Ionescu)	[53]
75	Alexander Rabinovitch	[21] [25]
76	Benjamin Raichel	[129] [132] [138] [144]
77	Edgar A. Ramos	[73]
78	Dan Roth	[48] [50] [52] [74] [106]
79	Elisha Sacks	[43]
80	Bardia Sadri	[80] [86]
81	Michael Segal	[79]
82	Raimund Seidel	[8]
83	Micha Sharir	[1] [2] [13] [21] [22] [25] [30] [31] [34] [40] [59] [105] [113] [124] [127]
84	Jessica Sherette	[135] [137]
85	Martin Skutella	[73]
86	Shakhar Smorodinsky	[60] [75]
87	Jack Snoeyink	[43]
88	Dezhen Song	[56]
89	Subhash Suri	[43]
90	Csaba D. Tóth	[128]
91	Alper Üngör	[77] [82]
92	Jan Vahrenhold	[31] [40]
93	Kasturi R. Varadarajan	[1] [2] [38] [45] [57] [63] [64]
94	Yusu Wang	[51] [58] [59] [62] [78] [100] [124]
95	Emo Welzl	[8]
96	Carola Wenk	[100] [123] [125] [135] [137] [142]
97	Ouri Wolfson	[43]
98	Hai Yu	[98] [104] [109]
99	Dav Zimak	[48] [52] [106]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page