dblp.uni-trier.dewww.uni-trier.de

Sariel Har-Peled Vis

שריאל הר-פלד

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
119EETimothy M. Chan, Sariel Har-Peled: Approximation algorithms for maximum independent set of pseudo-disks. Symposium on Computational Geometry 2009: 333-340
118EEChandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the set multi-cover problem in geometric settings. Symposium on Computational Geometry 2009: 341-350
117EEAmitabha 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)
116EESariel Har-Peled: Randomized Incremental Construction of Compressed Quadtrees CoRR abs/0907.0907: (2009)
115EESariel Har-Peled: Approximating Spanning Trees with Low Crossing Number CoRR abs/0907.1131: (2009)
114EESariel Har-Peled: Being Fat and Friendly is Not Enough CoRR abs/0908.2369: (2009)
113EESariel Har-Peled: Carnival of Samplings: Nets, Approximations, Relative and Sensitive CoRR abs/0908.3716: (2009)
112EEChandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the Set Multi-Cover Problem in Geometric Settings CoRR abs/0909.0537: (2009)
111EESariel Har-Peled, Micha Sharir: Relative (p,epsilon)-Approximations in Geometry CoRR abs/0909.0717: (2009)
2008
110EESariel Har-Peled, S. Muthukrishnan: Range Medians. ESA 2008: 503-514
109EESariel Har-Peled, S. Muthukrishnan: Range Medians CoRR abs/0807.0222: (2008)
108EEPankaj K. Agarwal, Sariel Har-Peled, Hai Yu: Robust Shape Fitting via Peeling and Grating Coresets. Discrete & Computational Geometry 39(1-3): 38-58 (2008)
107EEKe Chen, Sariel Har-Peled: The Euclidean Orienteering Problem Revisited. SIAM J. Comput. 38(1): 385-397 (2008)
106EEBoris Aronov, Sariel Har-Peled: On Approximating the Depth and Related Problems. SIAM J. Comput. 38(3): 899-921 (2008)
2007
105EESariel Har-Peled, Dan Roth, Dav Zimak: Maximum Margin Coresets for Active and Noise Tolerant Learning. IJCAI 2007: 836-841
104EEBoris Aronov, Sariel Har-Peled, Micha Sharir: On approximate halfspace range counting and relative epsilon-approximations. Symposium on Computational Geometry 2007: 327-336
103EEPankaj K. Agarwal, Sariel Har-Peled, Hai Yu: Embeddings of surfaces, curves, and moving points in euclidean space. Symposium on Computational Geometry 2007: 381-389
102EESariel Har-Peled: How to get close to the median shape. Comput. Geom. 36(1): 39-51 (2007)
101EESariel Har-Peled, Akash Kushal: Smaller Coresets for k-Median and k-Means Clustering. Discrete & Computational Geometry 37(1): 3-19 (2007)
100EEOtfried 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
99EEBoris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk: Fréchet Distance for Curves, Revisited. ESA 2006: 52-63
98EESariel Har-Peled: Coresets for Discrete Integration and Clustering. FSTTCS 2006: 33-44
97EEPankaj K. Agarwal, Sariel Har-Peled, Hai Yu: Robust shape fitting via peeling and grating coresets. SODA 2006: 182-191
96EEKe Chen, Sariel Har-Peled: The orienteering problem in the plane revisited. Symposium on Computational Geometry 2006: 247-254
95EESariel Har-Peled: How to get close to the median shape. Symposium on Computational Geometry 2006: 402-410
94EEMark de Berg, Sergio Cabello, Sariel Har-Peled: Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68
93EEJeff Erickson, Sariel Har-Peled, David M. Mount: On the Least Median Square Problem. Discrete & Computational Geometry 36(4): 593-607 (2006)
92EEAlon Efrat, Sariel Har-Peled: Guarding galleries and terrains. Inf. Process. Lett. 100(6): 238-245 (2006)
91EESariel Har-Peled, Manor Mendel: Fast Construction of Nets in Low-Dimensional Metrics and Their Applications. SIAM J. Comput. 35(5): 1148-1184 (2006)
2005
90 Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell: Approximation algorithms for location problems in sensor networks. BROADNETS 2005: 767-776
89EEJohn Fischer, Sariel Har-Peled: Dynamic Well-Separated Pair Decomposition Made Easy. CCCG 2005: 235-238
88EEPankaj 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
87EESariel Har-Peled, Vladlen Koltun: Separability with Outliers. ISAAC 2005: 28-39
86EESariel Har-Peled, Bardia Sadri: How fast is the k-means method? SODA 2005: 877-885
85EEBoris Aronov, Sariel Har-Peled: On approximating the depth and related problems. SODA 2005: 886-894
84EESariel Har-Peled, Akash Kushal: Smaller coresets for k-median and k-means clustering. Symposium on Computational Geometry 2005: 126-134
83EESariel Har-Peled, Manor Mendel: Fast construction of nets in low dimensional metrics, and their applications. Symposium on Computational Geometry 2005: 150-158
82EESariel Har-Peled, Alper Üngör: A time-optimal delaunay refinement algorithm in two dimensions. Symposium on Computational Geometry 2005: 228-236
81EESariel Har-Peled, Soham Mazumdar: Fast Algorithms for Computing the Smallest k-Enclosing Circle. Algorithmica 41(3): 147-157 (2005)
80EESariel Har-Peled, Bardia Sadri: How Fast Is the k-Means Method? Algorithmica 41(3): 185-202 (2005)
79EEPaz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005)
78EEPankaj 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)
77EESariel Har-Peled, Alper Üngör: A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions CoRR abs/cs/0501007: (2005)
76EEPaz Carmi, Sariel Har-Peled, Matthew J. Katz: On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005)
75EESariel Har-Peled, Shakhar Smorodinsky: Conflict-Free Coloring of Points and Simple Regions in the Plane. Discrete & Computational Geometry 34(1): 47-70 (2005)
74EEShivani 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)
73EEErnst 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
72EESariel Har-Peled: No, Coreset, No Cry. FSTTCS 2004: 324-335
71EEOtfried Cheong, Alon Efrat, Sariel Har-Peled: On finding a guard that sees most and a shop that sells most. SODA 2004: 1098-1107
70EESariel Har-Peled, Soham Mazumdar: On coresets for k-means and k-median clustering. STOC 2004: 291-300
69EEJeff Erickson, Sariel Har-Peled, David M. Mount: On the least median square problem. Symposium on Computational Geometry 2004: 273-279
68EESariel Har-Peled, Manor Mendel: Fast Construction of Nets in Low Dimensional Metrics, and Their Applications CoRR cs.DS/0409057: (2004)
67EEOtfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek: The One-Round Voronoi Game. Discrete & Computational Geometry 31(1): 125-138 (2004)
66EEJeff Erickson, Sariel Har-Peled: Optimally Cutting a Surface into a Disk. Discrete & Computational Geometry 31(1): 37-59 (2004)
65EESariel Har-Peled: Clustering Motion. Discrete & Computational Geometry 31(4): 545-565 (2004)
64EESariel Har-Peled, Kasturi R. Varadarajan: High-Dimensional Shape Fitting in Linear Time. Discrete & Computational Geometry 32(2): 269-288 (2004)
63EEPankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan: Approximating extent measures of points. J. ACM 51(4): 606-635 (2004)
62EESariel Har-Peled, Yusu Wang: Shape Fitting with Outliers. SIAM J. Comput. 33(2): 269-285 (2004)
2003
61EESariel Har-Peled, Soham Mazumdar: Fast Algorithms for Computing the Smallest k-Enclosing Disc. ESA 2003: 278-288
60EESariel Har-Peled, Shakhar Smorodinsky: On conflict-free coloring of points and simple regions in the plane. Symposium on Computational Geometry 2003: 114-123
59EEPankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang: Hausdorff distance under translation for points and balls. Symposium on Computational Geometry 2003: 282-291
58EESariel Har-Peled, Yusu Wang: Shape fitting with outliers. Symposium on Computational Geometry 2003: 29-38
57EESariel Har-Peled, Kasturi R. Varadarajan: High-dimensional shape fitting in linear time. Symposium on Computational Geometry 2003: 39-47
56EESariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg: Efficient algorithms for shared camera control. Symposium on Computational Geometry 2003: 68-77
55EESariel Har-Peled, Piotr Indyk: When Crossings Count - Approximating the Minimum Spanning Tree CoRR cs.CG/0303001: (2003)
54EEChaim 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
53EECecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled: STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. ALENEX 2002: 178-193
52EESariel Har-Peled, Dan Roth, Dav Zimak: Constraint Classification: A New Approach to Multiclass Classification. ALT 2002: 365-379
51EEPankaj 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
48EESariel Har-Peled, Dan Roth, Dav Zimak: Constraint Classification for Multiclass Classification and Ranking. NIPS 2002: 785-792
47EEMihai Badoiu, Sariel Har-Peled, Piotr Indyk: Approximate clustering via core-sets. STOC 2002: 250-257
46EEJeff Erickson, Sariel Har-Peled: Optimally cutting a surface into a disk. Symposium on Computational Geometry 2002: 244-253
45EESariel Har-Peled, Kasturi R. Varadarajan: Projective clustering in high dimensions using core-sets. Symposium on Computational Geometry 2002: 312-318
44EEOtfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek: The one-round Voronoi game. Symposium on Computational Geometry 2002: 97-101
43EEPankaj 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)
42EEPankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia: Computing Approximate Shortest Paths on Convex Polytopes. Algorithmica 33(2): 227-242 (2002)
41EEJeff 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)
39EEAlon 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
35EEPankaj K. Agarwal, Sariel Har-Peled: Maintaining approximate extent measures of moving points. SODA 2001: 148-157
34EESariel Har-Peled, Micha Sharir: Online point location in planar arrangements and its applications. SODA 2001: 57-66
33EEAlon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali: Morphing between polylines. SODA 2001: 680-689
32EESariel Har-Peled: A practical approach for computing the diameter of a point set. Symposium on Computational Geometry 2001: 177-186
31EEPankaj 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
30EESariel Har-Peled, Micha Sharir: Online Point Location in Planar Arrangements and Its Applications. Discrete & Computational Geometry 26(1): 19-40 (2001)
29EEYehuda 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
26EEAlon 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
25EEPankaj 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
24EESariel Har-Peled, Piotr Indyk: When crossings count - approximating the minimum spanning tree. Symposium on Computational Geometry 2000: 166-175
23EEPankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia: Computing approximate shortest paths on convex polytopes. Symposium on Computational Geometry 2000: 270-279
22EEPankaj 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)
19EESariel Har-Peled: Taking a Walk in a Planar Arrangement. SIAM J. Comput. 30(4): 1341-1367 (2000)
1999
18EEYuval 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
17EESariel Har-Peled: Taking a Walk in a Planar Arrangement. FOCS 1999: 100-111
16EEAnat Bremler-Barr, Yehuda Afek, Sariel Har-Peled: Routing with a Clue. SIGCOMM 1999: 203-214
15EEGill Barequet, Sariel Har-Peled: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. SODA 1999: 82-91
14EEGill Barequet, Sariel Har-Peled: Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. SODA 1999: 862-863
13EEPankaj 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)
11EESariel 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
9EEAlon Efrat, Sariel Har-Peled: Fly Cheaply: On the Minimum Fuel-Consumption Problem. Symposium on Computational Geometry 1998: 143-145
8EEArtur 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
7EESariel Har-Peled: Constructing Cuttings in Theory and Practice. Symposium on Computational Geometry 1998: 327-336
6EESariel Har-Peled: An Output Sensitive Algorithm for Discrete Convex Hulls. Symposium on Computational Geometry 1998: 357-364
5EESariel 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
3EESariel Har-Peled: Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions. Symposium on Computational Geometry 1997: 359-365
2EEPankaj 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
1EESariel 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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)