The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sariel Har-Peled: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled
    STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:178-193 [Conf]
  2. Sariel Har-Peled, Dan Roth, Dav Zimak
    Constraint Classification: A New Approach to Multiclass Classification. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:365-379 [Conf]
  3. Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell
    Approximation algorithms for location problems in sensor networks. [Citation Graph (0, 0)][DBLP]
    BROADNETS, 2005, pp:767-776 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:43-46 [Conf]
  5. John Fischer, Sariel Har-Peled
    Dynamic Well-Separated Pair Decomposition Made Easy. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:235-238 [Conf]
  6. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:380-389 [Conf]
  7. Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
    Results on k-Sets and j-Facets via Continuous Motion. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:192-199 [Conf]
  8. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
    Computing approximate shortest paths on convex polytopes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:270-279 [Conf]
  9. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang
    Hausdorff distance under translation for points and balls. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:282-291 [Conf]
  10. Ke Chen, Sariel Har-Peled
    The orienteering problem in the plane revisited. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:247-254 [Conf]
  11. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
    The one-round Voronoi game. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:97-101 [Conf]
  12. Alon Efrat, Sariel Har-Peled
    Fly Cheaply: On the Minimum Fuel-Consumption Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:143-145 [Conf]
  13. Jeff Erickson, Sariel Har-Peled
    Optimally cutting a surface into a disk. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:244-253 [Conf]
  14. Jeff Erickson, Sariel Har-Peled, David M. Mount
    On the least median square problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:273-279 [Conf]
  15. Sariel Har-Peled
    A practical approach for computing the diameter of a point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:177-186 [Conf]
  16. Sariel Har-Peled
    How to get close to the median shape. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:402-410 [Conf]
  17. Sariel Har-Peled
    Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:359-365 [Conf]
  18. Sariel Har-Peled
    Constructing Cuttings in Theory and Practice. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:327-336 [Conf]
  19. Sariel Har-Peled
    An Output Sensitive Algorithm for Discrete Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:357-364 [Conf]
  20. Sariel Har-Peled
    Constructing Approximate Shortest Path Maps in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:383-391 [Conf]
  21. Sariel Har-Peled, Piotr Indyk
    When crossings count - approximating the minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:166-175 [Conf]
  22. Sariel Har-Peled, Akash Kushal
    Smaller coresets for k-median and k-means clustering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:126-134 [Conf]
  23. Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg
    Efficient algorithms for shared camera control. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:68-77 [Conf]
  24. Sariel Har-Peled, Manor Mendel
    Fast construction of nets in low dimensional metrics, and their applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:150-158 [Conf]
  25. Sariel Har-Peled, Shakhar Smorodinsky
    On conflict-free coloring of points and simple regions in the plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:114-123 [Conf]
  26. Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
    Approximating Shortest Paths on a Convex Polytope in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:329-338 [Conf]
  27. Sariel Har-Peled, Alper Üngör
    A time-optimal delaunay refinement algorithm in two dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:228-236 [Conf]
  28. Sariel Har-Peled, Kasturi R. Varadarajan
    Projective clustering in high dimensions using core-sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:312-318 [Conf]
  29. Sariel Har-Peled, Kasturi R. Varadarajan
    High-dimensional shape fitting in linear time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:39-47 [Conf]
  30. Sariel Har-Peled, Yusu Wang
    Shape fitting with outliers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:29-38 [Conf]
  31. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
    Embeddings of surfaces, curves, and moving points in euclidean space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:381-389 [Conf]
  32. Boris Aronov, Sariel Har-Peled, Micha Sharir
    On approximate halfspace range counting and relative epsilon-approximations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:327-336 [Conf]
  33. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
    Near-Linear Time Approximation Algorithms for Curve Simplification. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:29-41 [Conf]
  34. Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
    Fréchet Distance for Curves, Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:52-63 [Conf]
  35. Sariel Har-Peled, Soham Mazumdar
    Fast Algorithms for Computing the Smallest k-Enclosing Disc. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:278-288 [Conf]
  36. Sariel Har-Peled
    Clustering Motion. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:84-93 [Conf]
  37. Sariel Har-Peled
    A Replacement for Voronoi Diagrams of Near Linear Size. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:94-103 [Conf]
  38. Sariel Har-Peled
    Taking a Walk in a Planar Arrangement. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:100-111 [Conf]
  39. Sariel Har-Peled, Kasturi R. Varadarajan
    Approximate Shape Fitting via Linearization. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:66-73 [Conf]
  40. Sariel Har-Peled
    No, Coreset, No Cry. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:324-335 [Conf]
  41. Sariel Har-Peled
    Coresets for Discrete Integration and Clustering. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:33-44 [Conf]
  42. Ashutosh Garg, Sariel Har-Peled, Dan Roth
    On generalization bounds, projection profile, and margin distribution. [Citation Graph (0, 0)][DBLP]
    ICML, 2002, pp:171-178 [Conf]
  43. Alon Efrat, Sariel Har-Peled
    Guarding Galleries and Terrains. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:181-192 [Conf]
  44. Sariel Har-Peled, Dan Roth, Dav Zimak
    Maximum Margin Coresets for Active and Noise Tolerant Learning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:836-841 [Conf]
  45. Sariel Har-Peled, Vladlen Koltun
    Separability with Outliers. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:28-39 [Conf]
  46. Sariel Har-Peled, Dan Roth, Dav Zimak
    Constraint Classification for Multiclass Classification and Ranking. [Citation Graph (0, 0)][DBLP]
    NIPS, 2002, pp:785-792 [Conf]
  47. Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
    Routing with a Clue. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 1999, pp:203-214 [Conf]
  48. Pankaj K. Agarwal, Sariel Har-Peled
    Maintaining approximate extent measures of moving points. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:148-157 [Conf]
  49. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
    Robust shape fitting via peeling and grating coresets. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:182-191 [Conf]
  50. Boris Aronov, Sariel Har-Peled
    On approximating the depth and related problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:886-894 [Conf]
  51. Gill Barequet, Sariel Har-Peled
    Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:82-91 [Conf]
  52. Gill Barequet, Sariel Har-Peled
    Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:862-863 [Conf]
  53. Otfried Cheong, Alon Efrat, Sariel Har-Peled
    On finding a guard that sees most and a shop that sells most. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1098-1107 [Conf]
  54. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:927-936 [Conf]
  55. Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali
    Morphing between polylines. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:680-689 [Conf]
  56. Sariel Har-Peled, Micha Sharir
    Online point location in planar arrangements and its applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:57-66 [Conf]
  57. Sariel Har-Peled, Bardia Sadri
    How fast is the k-means method? [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:877-885 [Conf]
  58. Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
    Approximate clustering via core-sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:250-257 [Conf]
  59. Sariel Har-Peled, Soham Mazumdar
    On coresets for k-means and k-median clustering. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:291-300 [Conf]
  60. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
    Computing the Penetration Depth of Two Convex Polytopes in 3D. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:328-338 [Conf]
  61. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:122-134 [Conf]
  62. Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart
    On-Line Zone Construction in Arrangements of Lines in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:139-153 [Conf]
  63. Mark de Berg, Sergio Cabello, Sariel Har-Peled
    Covering Many or Few Points with Unit Disks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:55-68 [Conf]
  64. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
    Computing Approximate Shortest Paths on Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:227-242 [Journal]
  65. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
    Near-Linear Time Approximation Algorithms for Curve Simplification. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:203-219 [Journal]
  66. Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal
    Geographic Quorum System Approximations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:4, pp:233-244 [Journal]
  67. Sariel Har-Peled, Soham Mazumdar
    Fast Algorithms for Computing the Smallest k-Enclosing Circle. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:3, pp:147-157 [Journal]
  68. Sariel Har-Peled, Bardia Sadri
    How Fast Is the k-Means Method? [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:3, pp:185-202 [Journal]
  69. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:195-207 [Journal]
  70. Paz Carmi, Sariel Har-Peled, Matthew J. Katz
    On the Fermat-Weber center of a convex object. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:3, pp:188-195 [Journal]
  71. Sariel Har-Peled
    An output sensitive algorithm for discrete convex hulls. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:2, pp:125-138 [Journal]
  72. Sariel Har-Peled
    Multicolor Combination Lemma. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:155-176 [Journal]
  73. Sariel Har-Peled
    How to get close to the median shape. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:1, pp:39-51 [Journal]
  74. Jeff Erickson, Sariel Har-Peled
    Optimally cutting a surface into a disk [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  75. Sariel Har-Peled, Piotr Indyk
    When Crossings Count - Approximating the Minimum Spanning Tree [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  76. Sariel Har-Peled, Manor Mendel
    Fast Construction of Nets in Low Dimensional Metrics, and Their Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  77. 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]
  78. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:687-705 [Journal]
  79. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
    The One-Round Voronoi Game. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:125-138 [Journal]
  80. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:535-569 [Journal]
  81. Jeff Erickson, Sariel Har-Peled
    Optimally Cutting a Surface into a Disk. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:37-59 [Journal]
  82. Sariel Har-Peled
    Clustering Motion. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:4, pp:545-565 [Journal]
  83. Sariel Har-Peled
    Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:2, pp:217-231 [Journal]
  84. Sariel Har-Peled, Micha Sharir
    Online Point Location in Planar Arrangements and Its Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:19-40 [Journal]
  85. Sariel Har-Peled, Shakhar Smorodinsky
    Conflict-Free Coloring of Points and Simple Regions in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:1, pp:47-70 [Journal]
  86. Sariel Har-Peled, Kasturi R. Varadarajan
    High-Dimensional Shape Fitting in Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:2, pp:269-288 [Journal]
  87. Jeff Erickson, Sariel Har-Peled, David M. Mount
    On the Least Median Square Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:593-607 [Journal]
  88. Gill Barequet, Sariel Har-Peled
    Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:465-474 [Journal]
  89. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:6, pp:463-485 [Journal]
  90. Alon Efrat, Sariel Har-Peled
    Guarding galleries and terrains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:6, pp:238-245 [Journal]
  91. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
    Approximating shortest paths on a convex polytope in three dimensions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:4, pp:567-584 [Journal]
  92. Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
    Approximating extent measures of points. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:4, pp:606-635 [Journal]
  93. Gill Barequet, Sariel Har-Peled
    Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:91-109 [Journal]
  94. Shivani Agarwal, Thore Graepel, Ralf Herbrich, Sariel Har-Peled, Dan Roth
    Generalization Bounds for the Area Under the ROC Curve. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2005, v:6, n:, pp:393-425 [Journal]
  95. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
    Penetration Depth of Two Convex Polytopes in 3D. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:227-240 [Journal]
  96. Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella
    Approximating k-hop minimum-spanning trees. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:115-120 [Journal]
  97. Sariel Har-Peled
    Constructing Planar Cuttings in Theory and Practice. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:2016-2039 [Journal]
  98. Sariel Har-Peled
    Taking a Walk in a Planar Arrangement. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1341-1367 [Journal]
  99. Sariel Har-Peled
    Constructing Approximate Shortest Path Maps in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1182-1197 [Journal]
  100. Sariel Har-Peled, Manor Mendel
    Fast Construction of Nets in Low-Dimensional Metrics and Their Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1148-1184 [Journal]
  101. Sariel Har-Peled, Yusu Wang
    Shape Fitting with Outliers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:269-285 [Journal]
  102. Yehuda Afek, Anat Bremler-Barr, Sariel Har-Peled
    Routing with a clue. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2001, v:9, n:6, pp:693-705 [Journal]
  103. Sariel Har-Peled, Alper Üngör
    A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  104. Otfried Cheong, Alon Efrat, Sariel Har-Peled
    Finding a Guard that Sees Most and a Shop that Sells Most. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:4, pp:545-563 [Journal]
  105. Sariel Har-Peled, Akash Kushal
    Smaller Coresets for k-Median and k-Means Clustering. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:1, pp:3-19 [Journal]

  106. Approximation algorithms for maximum independent set of pseudo-disks. [Citation Graph (, )][DBLP]


  107. On the set multi-cover problem in geometric settings. [Citation Graph (, )][DBLP]


  108. New constructions of SSPDs and their applications. [Citation Graph (, )][DBLP]


  109. Approximating the Fréchet distance for realistic curves in near linear time. [Citation Graph (, )][DBLP]


  110. Range Medians. [Citation Graph (, )][DBLP]


  111. Approximation algorithm for the L1-fitting circle problem. [Citation Graph (, )][DBLP]


  112. Range Medians [Citation Graph (, )][DBLP]


  113. Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space [Citation Graph (, )][DBLP]


  114. Randomized Incremental Construction of Compressed Quadtrees [Citation Graph (, )][DBLP]


  115. Approximating Spanning Trees with Low Crossing Number [Citation Graph (, )][DBLP]


  116. Being Fat and Friendly is Not Enough [Citation Graph (, )][DBLP]


  117. Carnival of Samplings: Nets, Approximations, Relative and Sensitive [Citation Graph (, )][DBLP]


  118. On the Set Multi-Cover Problem in Geometric Settings [Citation Graph (, )][DBLP]


  119. Relative (p,epsilon)-Approximations in Geometry [Citation Graph (, )][DBLP]


  120. Approximating the Fréchet Distance for Realistic Curves in Near Linear Time [Citation Graph (, )][DBLP]


  121. Approximate Nearest Neighbor Search for Low Dimensional Queries [Citation Graph (, )][DBLP]


  122. Robust Shape Fitting via Peeling and Grating Coresets. [Citation Graph (, )][DBLP]


Search in 0.433secs, Finished in 0.439secs
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