default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSariel Har-Peled
שריאל הר-פלד
Person information
- unicode name: שריאל הר-פלד
- affiliation: University of Illinois at Urbana-Champaign, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c131]Zhimeng Gao, Sariel Har-Peled:
Near Optimal Locality Sensitive Orderings in Euclidean Space. SoCG 2024: 60:1-60:14- [c130]Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos:
Oracle-Augmented Prophet Inequalities. ICALP 2024: 81:1-81:19 - [c129]Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos:
Fast Approximation Algorithms for Piercing Boxes by Points. SODA 2024: 4892-4908 - [c128]Sariel Har-Peled, Elfarouk Harb:
Revisiting Random Points: Combinatorial Complexity and Algorithms. SOSA 2024: 244-268 - [c127]Stav Ashur, Sariel Har-Peled:
Local Spanners Revisited. SWAT 2024: 2:1-2:15 - [c126]Sariel Har-Peled, Eliot Wong Robson:
No-Dimensional Tverberg Partitions Revisited. SWAT 2024: 26:1-26:14 - [i108]Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos:
Oracle-Augmented Prophet Inequalities. CoRR abs/2404.11853 (2024) - [i107]Sariel Har-Peled, Saladi Rahul:
Approximating Densest Subgraph in Geometric Intersection Graphs. CoRR abs/2405.18337 (2024) - [i106]Stav Ashur, Maria C. Lusardi, Marta Markowicz, James Motes, Marco Morales, Sariel Har-Peled, Nancy M. Amato:
SPITE: Simple Polyhedral Intersection Techniques for modified Environments. CoRR abs/2407.00259 (2024) - [i105]Sariel Har-Peled, Maria C. Lusardi:
Dependable Spanners via Unreliable Edges. CoRR abs/2407.01466 (2024) - [i104]Sariel Har-Peled, Benjamin Raichel, Eliot Wong Robson:
The Fréchet Distance Unleashed: Approximating a Dog with a Frog. CoRR abs/2407.03101 (2024) - 2023
- [j95]Sariel Har-Peled
, Mitchell Jones:
Few Cuts Meet Many Point Sets. Algorithmica 85(4): 965-975 (2023) - [j94]Sariel Har-Peled, Mitchell Jones:
A Note on Stabbing Convex Bodies with Points, Lines, and Flats. Discret. Comput. Geom. 69(4): 1241-1254 (2023) - [j93]Sariel Har-Peled, Manor Mendel, Dániel Oláh:
Reliable Spanners for Metric Spaces. ACM Trans. Algorithms 19(1): 7:1-7:27 (2023) - [c125]Sariel Har-Peled, Benjamin Raichel:
On the Budgeted Hausdorff Distance Problem. CCCG 2023: 169-173 - [c124]Pankaj K. Agarwal, Sariel Har-Peled:
Computing Instance-Optimal Kernels in Two Dimensions. SoCG 2023: 4:1-4:15 - [c123]Sariel Har-Peled, Da Wei Zheng:
Halving by a Thousand Cuts or Punctures. SODA 2023: 1385-1397 - [c122]Timothy M. Chan, Sariel Har-Peled:
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. SODA 2023: 1398-1413 - [i103]Sariel Har-Peled, Eliot Wong Robson:
On the Width of the Regular n-Simplex. CoRR abs/2301.02616 (2023) - [i102]Sariel Har-Peled, Eliot Wong Robson:
No-dimensional Tverberg Partitions Revisited. CoRR abs/2306.01678 (2023) - [i101]Sariel Har-Peled, Benjamin Raichel:
On the Budgeted Hausdorff Distance Problem. CoRR abs/2306.02151 (2023) - [i100]Sariel Har-Peled:
Approximately: Independence Implies Vertex Cover. CoRR abs/2308.00840 (2023) - [i99]Zhimeng Gao, Sariel Har-Peled:
Almost Optimal Locality Sensitive Orderings in Euclidean Space. CoRR abs/2310.12792 (2023) - [i98]Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos:
Fast Approximation Algorithms for Piercing Boxes by Points. CoRR abs/2311.02050 (2023) - [i97]Stav Ashur, Sariel Har-Peled:
On the Rectangles Induced by Points. CoRR abs/2311.10637 (2023) - 2022
- [j92]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling near neighbors in search for fairness. Commun. ACM 65(8): 83-90 (2022) - [j91]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. 67(2): 439-461 (2022) - [j90]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
Sometimes reliable spanners of almost linear size. J. Comput. Geom. 13(1): 178-196 (2022) - [j89]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
Optimal Algorithms for Geometric Centers and Depth. SIAM J. Comput. 51(3): 627-663 (2022) - [j88]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. 47(1): 4:1-4:40 (2022) - [c121]Sariel Har-Peled, Everett Yang:
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. SoCG 2022: 47:1-47:13 - [i96]Stav Ashur, Sariel Har-Peled:
Local Spanners Revisited. CoRR abs/2201.01715 (2022) - [i95]Sariel Har-Peled, Eliot Wong Robson:
Sparsifying Disk Intersection Graphs for Reliable Connectivity. CoRR abs/2201.01844 (2022) - [i94]Sariel Har-Peled, Everett Yang:
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. CoRR abs/2201.01849 (2022) - [i93]Pankaj K. Agarwal, Sariel Har-Peled:
Computing Optimal Kernels in Two Dimensions. CoRR abs/2207.07211 (2022) - [i92]Sariel Har-Peled, Elfarouk Harb:
Revisiting Random Points: Combinatorial Complexity and Algorithms. CoRR abs/2208.03829 (2022) - [i91]Sariel Har-Peled, Da Wei Zheng:
Halving by a Thousand Cuts or Punctures. CoRR abs/2208.11275 (2022) - 2021
- [j87]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active-Learning a Convex Body in Low Dimensions. Algorithmica 83(6): 1885-1917 (2021) - [j86]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. Discret. Comput. Geom. 66(2): 769-791 (2021) - [j85]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. Discret. Math. 344(7): 112403 (2021) - [j84]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Fair near neighbor search via sampling. SIGMOD Rec. 50(1): 42-49 (2021) - [j83]Sariel Har-Peled, Mitchell Jones:
Journey to the Center of the Point Set. ACM Trans. Algorithms 17(1): 9:1-9:21 (2021) - [c120]Stav Ashur, Sariel Har-Peled:
On Undecided LP, Clustering and Active Learning. SoCG 2021: 12:1-12:15 - [c119]Sariel Har-Peled, Mitchell Jones:
Stabbing Convex Bodies with Lines and Flats. SoCG 2021: 42:1-42:12 - [c118]Sariel Har-Peled, Manor Mendel, Dániel Oláh:
Reliable Spanners for Metric Spaces. SoCG 2021: 43:1-43:13 - [c117]Sariel Har-Peled, Timothy Zhou:
Improved Approximation Algorithms for Tverberg Partitions. ESA 2021: 51:1-51:15 - [i90]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? CoRR abs/2101.10905 (2021) - [i89]Stav Ashur, Sariel Har-Peled:
On Undecided LP, Clustering and Active Learning. CoRR abs/2103.09308 (2021) - [i88]Sariel Har-Peled, Timothy Zhou:
How Packed Is It, Really? CoRR abs/2105.10776 (2021) - [i87]Sariel Har-Peled, Joseph Rogge:
On Clusters that are Separated but Large. CoRR abs/2106.05363 (2021) - [i86]Sariel Har-Peled, Jiaqi Cheng:
On Competitive Permutations for Set Cover by Intervals. CoRR abs/2110.14528 (2021) - [i85]Sariel Har-Peled:
On the Number of Incidences when Avoiding the Klan. CoRR abs/2112.14829 (2021) - 2020
- [j82]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. Discret. Comput. Geom. 63(3): 705-730 (2020) - [j81]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. 64(1): 109-173 (2020) - [j80]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. Discret. Comput. Geom. 64(4): 1167-1191 (2020) - [j79]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid Peeling and the Affine Curve-Shortening Flow. Exp. Math. 29(3): 306-316 (2020) - [j78]David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos:
Approximate greedy clustering and distance selection for graph metrics. J. Comput. Geom. 11(1): 629-652 (2020) - [j77]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. SIAM J. Comput. 49(3): 583-600 (2020) - [j76]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ACM Trans. Algorithms 16(4): 52:1-52:27 (2020) - [c116]Sariel Har-Peled, Mitchell Jones:
Some Geometric Applications of Anti-Chains. CCCG 2020: 326-331 - [c115]Sariel Har-Peled, Mitchell Jones:
Fast Algorithms for Geometric Consensuses. SoCG 2020: 50:1-50:16 - [c114]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
Sometimes Reliable Spanners of Almost Linear Size. ESA 2020: 27:1-27:15 - [c113]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active Learning a Convex Body in Low Dimensions. ICALP 2020: 64:1-64:17 - [c112]Chandra Chekuri, Sariel Har-Peled, Kent Quanrud:
Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA 2020: 1019-1038 - [c111]Arturs Backurs, Sariel Har-Peled:
Submodular Clustering in Low Dimensions. SWAT 2020: 8:1-8:14 - [i84]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. CoRR abs/2003.00518 (2020) - [i83]Arturs Backurs, Sariel Har-Peled:
Submodular Clustering in Low Dimensions. CoRR abs/2004.05494 (2020) - [i82]Sariel Har-Peled, Timothy Zhou:
Improved Approximation Algorithms for Tverberg Partitions. CoRR abs/2007.08717 (2020) - [i81]Sariel Har-Peled, Dániel Oláh:
Reliable Spanners for Metric Spaces. CoRR abs/2007.08738 (2020) - [i80]Sariel Har-Peled, Rajgopal Varadharajan:
Shortest Secure Path in a Voronoi Diagram. CoRR abs/2007.09773 (2020) - [i79]Sariel Har-Peled, Mitchell Jones:
Stabbing Convex Bodies with Lines and Flats. CoRR abs/2007.09874 (2020)
2010 – 2019
- 2019
- [j75]Anna Adamaszek, Sariel Har-Peled, Andreas Wiese:
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66(4): 29:1-29:40 (2019) - [j74]Avrim Blum, Sariel Har-Peled, Benjamin Raichel:
Sparse Approximation via Generating Point Sets. ACM Trans. Algorithms 15(3): 32:1-32:16 (2019) - [c110]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. SoCG 2019: 19:1-19:15 - [c109]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. SoCG 2019: 23:1-23:15 - [c108]Sariel Har-Peled, Mitchell Jones:
Journey to the Center of the Point Set. SoCG 2019: 41:1-41:14 - [c107]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. ITCS 2019: 21:1-21:17 - [c106]Sariel Har-Peled, Sepideh Mahabadi:
Near Neighbor: Who is the Fairest of Them All? NeurIPS 2019: 13176-13187 - [i78]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active Learning a Convex Body in Low Dimensions. CoRR abs/1903.03693 (2019) - [i77]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. CoRR abs/1903.06785 (2019) - [i76]Sariel Har-Peled, Sepideh Mahabadi:
Near Neighbor: Who is the Fairest of Them All? CoRR abs/1906.02640 (2019) - [i75]Sariel Har-Peled, Mitchell Jones:
Some Geometric Applications of Anti-Chains. CoRR abs/1910.07586 (2019) - [i74]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
Sometimes Reliable Spanners of Almost Linear Size. CoRR abs/1912.01547 (2019) - [i73]Sariel Har-Peled, Mitchell Jones:
Fast Algorithms for Geometric Consensuses. CoRR abs/1912.01639 (2019) - [i72]Sariel Har-Peled, Mitchell Jones:
Proof of Dudley's Convex Approximation. CoRR abs/1912.01977 (2019) - [i71]Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu:
Covering Polygons by Min-Area Convex Polygons. CoRR abs/1912.03429 (2019) - 2018
- [j73]Sariel Har-Peled, Nirman Kumar:
Robust Proximity Search for Balls Using Sublinear Space. Algorithmica 80(1): 279-299 (2018) - [c105]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid peeling and the affine curve-shortening flow. ALENEX 2018: 109-116 - [c104]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi:
Approximate Sparse Linear Regression. ICALP 2018: 77:1-77:14 - [c103]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ITCS 2018: 38:1-38:21 - [c102]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC 2018: 50:1-50:12 - [c101]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. SODA 2018: 918-932 - [i70]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. CoRR abs/1801.03158 (2018) - [i69]Linda Cai, Sariel Har-Peled, Simiao Ye:
Separators for Planar Graphs that are Almost Trees. CoRR abs/1808.02815 (2018) - [i68]Sariel Har-Peled, Mitchell Jones:
Few Cuts Meet Many Point Sets. CoRR abs/1808.03260 (2018) - [i67]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and their Applications. CoRR abs/1809.11147 (2018) - [i66]Sariel Har-Peled, Saladi Rahul:
Two (Known) Results About Graphs with No Short Odd Cycles. CoRR abs/1810.01832 (2018) - [i65]Sariel Har-Peled, Soham Mazumdar:
Coresets for $k$-Means and $k$-Median Clustering and their Applications. CoRR abs/1810.12826 (2018) - [i64]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. CoRR abs/1811.06898 (2018) - 2017
- [j72]Sariel Har-Peled, Subhro Roy:
Approximating the Maximum Overlap of Polygons under Translation. Algorithmica 78(1): 147-165 (2017) - [j71]Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls Under Uncertainty. Algorithmica 79(2): 340-367 (2017) - [j70]Sariel Har-Peled, Kent Quanrud:
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. SIAM J. Comput. 46(6): 1712-1744 (2017) - [j69]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric Packing under Nonuniform Constraints. SIAM J. Comput. 46(6): 1745-1784 (2017) - [c100]Sariel Har-Peled, Sepideh Mahabadi:
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. SODA 2017: 1-15 - [i63]Anna Adamaszek, Sariel Har-Peled, Andreas Wiese:
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR abs/1703.04758 (2017) - [i62]Sariel Har-Peled, Sepideh Mahabadi:
LSH on the Hypercube Revisited. CoRR abs/1704.02546 (2017) - [i61]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. CoRR abs/1706.02004 (2017) - [i60]Sariel Har-Peled, Amir Nayyeri:
A Simple Algorithm for Computing a Cycle Separator. CoRR abs/1709.08122 (2017) - [i59]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid peeling and the affine curve-shortening flow. CoRR abs/1710.03960 (2017) - [i58]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. CoRR abs/1711.07567 (2017) - [i57]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR abs/1712.02913 (2017) - [i56]Sariel Har-Peled, Mitchell Jones:
How to Net a Convex Shape. CoRR abs/1712.02949 (2017) - 2016
- [j68]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to Walk Your Dog in the Mountains with No Magic Leash. Discret. Comput. Geom. 55(1): 39-73 (2016) - [j67]Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel:
Space Exploration via Proximity Search. Discret. Comput. Geom. 56(2): 357-376 (2016) - [j66]Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel:
From Proximity to Utility: A Voronoi Partition of Pareto Optima. Discret. Comput. Geom. 56(3): 631-656 (2016) - [j65]Sariel Har-Peled:
Shortest path in a polygon using sublinear space. J. Comput. Geom. 7(2): 19-45 (2016) - [j64]Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the Expected Complexity of Voronoi Diagrams on Terrains. ACM Trans. Algorithms 12(3): 37:1-37:20 (2016) - [j63]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty II. ACM Trans. Algorithms 13(1): 3:1-3:25 (2016) - [c99]Vijay V. S. P. Bhattiprolu, Sariel Har-Peled:
Separating a Voronoi Diagram via Local Search. SoCG 2016: 18:1-18:16 - [c98]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
Towards Tight Bounds for the Streaming Set Cover Problem. PODS 2016: 371-383 - [c97]Avrim Blum, Sariel Har-Peled, Benjamin Raichel:
Sparse Approximation via Generating Point Sets. SODA 2016: 548-557 - [c96]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the k-Level in Three-Dimensional Plane Arrangements. SODA 2016: 1193-1212 - [i55]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the $k$-Level in Three-Dimensional Plane Arrangements. CoRR abs/1601.04755 (2016) - [i54]Sariel Har-Peled, Kent Quanrud:
Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. CoRR abs/1603.03098 (2016) - [i53]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty II. CoRR abs/1606.00112 (2016) - [i52]Sariel Har-Peled:
Computing the k Nearest-Neighbors for all Vertices via Dijkstra. CoRR abs/1607.07818 (2016) - [i51]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi:
Approximate Sparse Linear Regression. CoRR abs/1609.08739 (2016) - 2015
- [j62]Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. Algorithmica 73(4): 673-695 (2015) - [j61]Sariel Har-Peled, Benjamin Raichel:
On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams. Discret. Comput. Geom. 53(3): 547-568 (2015) - [j60]Sariel Har-Peled, Benjamin Raichel:
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. J. ACM 62(6): 44:1-44:35 (2015) - [j59]Sariel Har-Peled, Nirman Kumar:
Approximating Minimization Diagrams and Generalized Proximity Search. SIAM J. Comput. 44(4): 944-974 (2015) - [c95]Sariel Har-Peled:
Shortest Path in a Polygon using Sublinear Space. SoCG 2015: 111-125 - [c94]Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel:
Space Exploration via Proximity Search. SoCG 2015: 374-389 - [c93]Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel:
From Proximity to Utility: A Voronoi Partition of Pareto Optima. SoCG 2015: 689-703 - [c92]Sariel Har-Peled, Kent Quanrud:
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. ESA 2015: 717-728 - [i50]Sariel Har-Peled, Kent Quanrud:
Approximation Algorithms for Low-Density Graphs. CoRR abs/1501.00721 (2015) - [i49]Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk:
Fréchet Distance for Curves, Revisited. CoRR abs/1504.07685 (2015) - [i48]David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos:
Approximate Greedy Clustering and Distance Selection for Graph Metrics. CoRR abs/1507.01555 (2015) - [i47]Sariel Har-Peled:
A Simple Algorithm for Maximum Margin Classification, Revisited. CoRR abs/1507.01563 (2015) - [i46]Avrim Blum, Sariel Har-Peled, Benjamin Raichel:
Sparse Approximation via Generating Point Sets. CoRR abs/1507.02574 (2015) - [i45]Sariel Har-Peled, Sepideh Mahabadi:
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. CoRR abs/1511.07357 (2015) - 2014
- [j58]Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Union of Random Minkowski Sums and Network Vulnerability Analysis. Discret. Comput. Geom. 52(3): 551-582 (2014) - [j57]Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. J. Comput. Geom. 5(1): 86-103 (2014) - [j56]Sariel Har-Peled, Nirman Kumar:
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space. SIAM J. Comput. 43(4): 1486-1511 (2014) - [j55]Sariel Har-Peled, Benjamin Raichel:
The fréchet distance revisited and extended. ACM Trans. Algorithms 10(1): 3:1-3:22 (2014) - [c91]Sariel Har-Peled:
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons. SoCG 2014: 120 - [c90]Sariel Har-Peled, Benjamin Raichel:
On the Complexity of Randomly Weighted Voronoi Diagrams. SoCG 2014: 232 - [c89]Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls under Uncertainty. ESA 2014: 37-48 - [c88]Sariel Har-Peled, Subhro Roy:
Approximating the Maximum Overlap of Polygons under Translation. ESA 2014: 542-553 - [c87]Sariel Har-Peled, Nirman Kumar:
Robust Proximity Search for Balls Using Sublinear Space. FSTTCS 2014: 315-326 - [i44]Vijay V. S. P. Bhattiprolu, Sariel Har-Peled:
Separating a Voronoi Diagram. CoRR abs/1401.0174 (2014) - [i43]Sariel Har-Peled, Nirman Kumar:
Robust Proximity Search for Balls using Sublinear Space. CoRR abs/1401.1472 (2014) - [i42]Sariel Har-Peled, Benjamin Raichel:
On the Complexity of Randomly Weighted Voronoi Diagrams. CoRR abs/1401.1477 (2014) - [i41]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to Walk Your Dog in the Mountains with No Magic Leash. CoRR abs/1401.7042 (2014) - [i40]Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel:
From Proximity to Utility: A Voronoi Partition of Pareto Optima. CoRR abs/1404.3403 (2014) - [i39]Sariel Har-Peled, Subhro Roy:
Approximating the Maximum Overlap of Polygons under Translation. CoRR abs/1406.5778 (2014) - [i38]Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls under Uncertainty. CoRR abs/1406.6599 (2014) - [i37]Sariel Har-Peled, Benjamin Raichel:
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. CoRR abs/1409.7425 (2014) - [i36]Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky:
Epsilon-Nets for Halfspaces Revisited. CoRR abs/1410.3154 (2014) - [i35]Sariel Har-Peled:
Low Rank Matrix Approximation in Linear Time. CoRR abs/1410.8802 (2014) - [i34]Sariel Har-Peled:
Shortest Path in a Polygon using Sublinear Space. CoRR abs/1412.0779 (2014) - [i33]Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel:
Space Exploration via Proximity Search. CoRR abs/1412.1398 (2014) - 2013
- [j54]Sariel Har-Peled, Nirman Kumar:
Approximate Nearest Neighbor Search for Low-Dimensional Queries. SIAM J. Comput. 42(1): 138-159 (2013) - [j53]Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu:
Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space. SIAM J. Comput. 42(2): 442-458 (2013) - [j52]Anne Driemel, Sariel Har-Peled:
Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts. SIAM J. Comput. 42(5): 1830-1866 (2013) - [j51]Sariel Har-Peled, Bernard Lidický:
Peeling the Grid. SIAM J. Discret. Math. 27(2): 650-655 (2013) - [c86]Sariel Har-Peled, Nirman Kumar:
Approximating Minimization Diagrams and Generalized Proximity Search. FOCS 2013: 717-726 - [c85]Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. ISAAC 2013: 163-173 - [c84]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest neighbor searching under uncertainty II. PODS 2013: 115-126 - [c83]Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos:
Euclidean spanners in high dimensions. SODA 2013: 804-809 - [c82]Sariel Har-Peled, Benjamin Adam Raichel:
Net and prune: a linear time algorithm for euclidean distance problems. STOC 2013: 605-614 - [i32]Sariel Har-Peled, Bernard Lidický:
Peeling the Grid. CoRR abs/1302.3200 (2013) - [i31]Sariel Har-Peled, Nirman Kumar:
Approximating Minimization Diagrams and Generalized Proximity Search. CoRR abs/1304.0393 (2013) - [i30]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small. CoRR abs/1304.7318 (2013) - [i29]Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Union of Random Minkowski Sums and Network Vulnerability Analysis. CoRR abs/1310.5647 (2013) - [i28]Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. CoRR abs/1311.1976 (2013) - [i27]Sariel Har-Peled:
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons. CoRR abs/1312.1369 (2013) - 2012
- [j50]Mohammad Ali Abam, Sariel Har-Peled:
New constructions of SSPDs and their applications. Comput. Geom. 45(5-6): 200-214 (2012) - [j49]Anne Driemel, Sariel Har-Peled, Carola Wenk:
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. Discret. Comput. Geom. 48(1): 94-127 (2012) - [j48]Timothy M. Chan, Sariel Har-Peled:
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. Discret. Comput. Geom. 48(2): 373-392 (2012) - [j47]Sariel Har-Peled, Mira Lee:
Weighted geometric set cover problems revisited. J. Comput. Geom. 3(1): 65-85 (2012) - [j46]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multicover problem in geometric settings. ACM Trans. Algorithms 9(1): 9:1-9:17 (2012) - [j45]Sariel Har-Peled, Piotr Indyk, Rajeev Motwani:
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Theory Comput. 8(1): 321-350 (2012) - [c81]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric packing under non-uniform constraints. SCG 2012: 11-20 - [c80]Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the expected complexity of voronoi diagrams on terrains. SCG 2012: 101-110 - [c79]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to walk your dog in the mountains with no magic leash. SCG 2012: 121-130 - [c78]Sariel Har-Peled, Nirman Kumar:
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space. FOCS 2012: 430-439 - [c77]Anne Driemel, Sariel Har-Peled:
Jaywalking your dog: computing the Fréchet distance with shortcuts. SODA 2012: 318-337 - [c76]Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. SWAT 2012: 213-224 - [i26]Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled:
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs. CoRR abs/1201.2703 (2012) - [i25]Sariel Har-Peled, Benjamin Raichel:
Fréchet Distance Revisited and Extended. CoRR abs/1202.5610 (2012) - 2011
- [j44]Sariel Har-Peled, Micha Sharir:
Relative (p, ε)-Approximations in Geometry. Discret. Comput. Geom. 45(3): 462-496 (2011) - [c75]Sariel Har-Peled, Benjamin Raichel:
The frechet distance revisited and extended. SCG 2011: 448-457 - [c74]Rachit Agarwal, Philip Brighten Godfrey, Sariel Har-Peled:
Approximate distance queries and compact routing in sparse graphs. INFOCOM 2011: 1754-1762 - [c73]Sariel Har-Peled, Nirman Kumar:
Approximate Nearest Neighbor Search for Low Dimensional Queries. SODA 2011: 854-867 - [c72]Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk:
Computing the Fréchet Distance between Folded Polygons. WADS 2011: 267-278 - [i24]Timothy M. Chan, Sariel Har-Peled:
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. CoRR abs/1103.1431 (2011) - [i23]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) - [i22]Sariel Har-Peled:
A Simple Proof of the Existence of a Planar Separator. CoRR abs/1105.0103 (2011) - [i21]Anne Driemel, Sariel Har-Peled:
Jaywalking your Dog - Computing the Fréchet Distance with Shortcuts. CoRR abs/1107.1720 (2011) - [i20]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric Packing under Non-uniform Constraints. CoRR abs/1107.2949 (2011) - [i19]Sariel Har-Peled, Nirman Kumar:
Down the Rabbit Hole: Robust Proximity Search in Sublinear Space. CoRR abs/1111.2942 (2011) - [i18]Sariel Har-Peled:
On the Expected Complexity of Random Convex Hulls. CoRR abs/1111.5340 (2011) - [i17]Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the Expected Complexity of Voronoi Diagrams on Terrains. CoRR abs/1112.0695 (2011) - [i16]Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. CoRR abs/1112.1124 (2011) - 2010
- [j43]Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang:
Hausdorff distance under translation for points and balls. ACM Trans. Algorithms 6(4): 71:1-71:26 (2010) - [c71]Mohammad Ali Abam, Sariel Har-Peled:
New constructions of SSPDs and their applications. SCG 2010: 192-200 - [c70]Anne Driemel, Sariel Har-Peled, Carola Wenk:
Approximating the Fréchet distance for realistic curves in near linear time. SCG 2010: 365-374 - [i15]Anne Driemel, Sariel Har-Peled, Carola Wenk:
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. CoRR abs/1003.0460 (2010) - [i14]Sariel Har-Peled, Nirman Kumar:
Approximate Nearest Neighbor Search for Low Dimensional Queries. CoRR abs/1007.3296 (2010)
2000 – 2009
- 2009
- [j42]Mark de Berg, Sergio Cabello, Sariel Har-Peled:
Covering Many or Few Points with Unit Disks. Theory Comput. Syst. 45(3): 446-469 (2009) - [c69]Timothy M. Chan, Sariel Har-Peled:
Approximation algorithms for maximum independent set of pseudo-disks. SCG 2009: 333-340 - [c68]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multi-cover problem in geometric settings. SCG 2009: 341-350 - [i13]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) - [i12]Sariel Har-Peled:
Randomized Incremental Construction of Compressed Quadtrees. CoRR abs/0907.0907 (2009) - [i11]Sariel Har-Peled:
Approximating Spanning Trees with Low Crossing Number. CoRR abs/0907.1131 (2009) - [i10]Sariel Har-Peled:
Being Fat and Friendly is Not Enough. CoRR abs/0908.2369 (2009) - [i9]Sariel Har-Peled:
Carnival of Samplings: Nets, Approximations, Relative and Sensitive. CoRR abs/0908.3716 (2009) - [i8]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the Set Multi-Cover Problem in Geometric Settings. CoRR abs/0909.0537 (2009) - [i7]Sariel Har-Peled, Micha Sharir:
Relative (p,epsilon)-Approximations in Geometry. CoRR abs/0909.0717 (2009) - 2008
- [j41]Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu:
Robust Shape Fitting via Peeling and Grating Coresets. Discret. Comput. Geom. 39(1-3): 38-58 (2008) - [j40]Ke Chen, Sariel Har-Peled:
The Euclidean Orienteering Problem Revisited. SIAM J. Comput. 38(1): 385-397 (2008) - [j39]Boris Aronov, Sariel Har-Peled:
On Approximating the Depth and Related Problems. SIAM J. Comput. 38(3): 899-921 (2008) - [c67]Sariel Har-Peled, S. Muthukrishnan:
Range Medians. ESA 2008: 503-514 - [i6]Sariel Har-Peled, S. Muthukrishnan:
Range Medians. CoRR abs/0807.0222 (2008) - 2007
- [j38]Sariel Har-Peled:
How to get close to the median shape. Comput. Geom. 36(1): 39-51 (2007) - [j37]Sariel Har-Peled, Akash Kushal:
Smaller Coresets for k-Median and k-Means Clustering. Discret. Comput. Geom. 37(1): 3-19 (2007) - [j36]Otfried Cheong, Alon Efrat, Sariel Har-Peled:
Finding a Guard that Sees Most and a Shop that Sells Most. Discret. Comput. Geom. 37(4): 545-563 (2007) - [c66]Boris Aronov, Sariel Har-Peled, Micha Sharir:
On approximate halfspace range counting and relative epsilon-approximations. SCG 2007: 327-336 - [c65]Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu:
Embeddings of surfaces, curves, and moving points in euclidean space. SCG 2007: 381-389 - [c64]Sariel Har-Peled, Dan Roth, Dav Zimak:
Maximum Margin Coresets for Active and Noise Tolerant Learning. IJCAI 2007: 836-841 - 2006
- [j35]Jeff Erickson, Sariel Har-Peled, David M. Mount:
On the Least Median Square Problem. Discret. Comput. Geom. 36(4): 593-607 (2006) - [j34]Alon Efrat, Sariel Har-Peled:
Guarding galleries and terrains. Inf. Process. Lett. 100(6): 238-245 (2006) - [j33]Sariel Har-Peled, Manor Mendel:
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications. SIAM J. Comput. 35(5): 1148-1184 (2006) - [c63]Ke Chen, Sariel Har-Peled:
The orienteering problem in the plane revisited. SCG 2006: 247-254 - [c62]Sariel Har-Peled:
How to get close to the median shape. SCG 2006: 402-410 - [c61]Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk:
Fréchet Distance for Curves, Revisited. ESA 2006: 52-63 - [c60]Sariel Har-Peled:
Coresets for Discrete Integration and Clustering. FSTTCS 2006: 33-44 - [c59]Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu:
Robust shape fitting via peeling and grating coresets. SODA 2006: 182-191 - [c58]Mark de Berg, Sergio Cabello, Sariel Har-Peled:
Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68 - 2005
- [j32]Sariel Har-Peled, Soham Mazumdar:
Fast Algorithms for Computing the Smallest k-Enclosing Circle. Algorithmica 41(3): 147-157 (2005) - [j31]Sariel Har-Peled, Bardia Sadri:
How Fast Is the k-Means Method? Algorithmica 41(3): 185-202 (2005) - [j30]Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal:
Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005) - [j29]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) - [j28]Paz Carmi, Sariel Har-Peled, Matthew J. Katz:
On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005) - [j27]Sariel Har-Peled, Shakhar Smorodinsky:
Conflict-Free Coloring of Points and Simple Regions in the Plane. Discret. Comput. Geom. 34(1): 47-70 (2005) - [j26]Shivani Agarwal, Thore Graepel, Ralf Herbrich, Sariel Har-Peled, Dan Roth:
Generalization Bounds for the Area Under the ROC Curve. J. Mach. Learn. Res. 6: 393-425 (2005) - [j25]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) - [c57]Shivani Agarwal, Sariel Har-Peled, Dan Roth:
A Uniform Convergence Bound for the Area Under the ROC Curve. AISTATS 2005: 1-8 - [c56]Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell:
Approximation algorithms for location problems in sensor networks. BROADNETS 2005: 767-776 - [c55]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 - [c54]John Fischer, Sariel Har-Peled:
Dynamic Well-Separated Pair Decomposition Made Easy. CCCG 2005: 235-238 - [c53]Sariel Har-Peled, Akash Kushal:
Smaller coresets for k-median and k-means clustering. SCG 2005: 126-134 - [c52]Sariel Har-Peled, Manor Mendel:
Fast construction of nets in low dimensional metrics, and their applications. SCG 2005: 150-158 - [c51]Sariel Har-Peled, Alper Üngör:
A time-optimal delaunay refinement algorithm in two dimensions. SCG 2005: 228-236 - [c50]Sariel Har-Peled, Vladlen Koltun:
Separability with Outliers. ISAAC 2005: 28-39 - [c49]Sariel Har-Peled, Bardia Sadri:
How fast is the k-means method? SODA 2005: 877-885 - [c48]Boris Aronov, Sariel Har-Peled:
On approximating the depth and related problems. SODA 2005: 886-894 - [i5]Sariel Har-Peled:
Approximation algorithm for the L1-fitting circle problem. EuroCG 2005: 103-106 - [i4]Sariel Har-Peled, Alper Üngör:
A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions. CoRR abs/cs/0501007 (2005) - 2004
- [j24]Jeff Erickson, Sariel Har-Peled:
Optimally Cutting a Surface into a Disk. Discret. Comput. Geom. 31(1): 37-59 (2004) - [j23]Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek:
The One-Round Voronoi Game. Discret. Comput. Geom. 31(1): 125-138 (2004) - [j22]Sariel Har-Peled:
Clustering Motion. Discret. Comput. Geom. 31(4): 545-565 (2004) - [j21]Sariel Har-Peled, Kasturi R. Varadarajan:
High-Dimensional Shape Fitting in Linear Time. Discret. Comput. Geom. 32(2): 269-288 (2004) - [j20]Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan:
Approximating extent measures of points. J. ACM 51(4): 606-635 (2004) - [j19]Sariel Har-Peled, Yusu Wang:
Shape Fitting with Outliers. SIAM J. Comput. 33(2): 269-285 (2004) - [c47]Jeff Erickson, Sariel Har-Peled, David M. Mount:
On the least median square problem. SCG 2004: 273-279 - [c46]Sariel Har-Peled:
No, Coreset, No Cry. FSTTCS 2004: 324-335 - [c45]Otfried Cheong, Alon Efrat, Sariel Har-Peled:
On finding a guard that sees most and a shop that sells most. SODA 2004: 1098-1107 - [c44]Sariel Har-Peled, Soham Mazumdar:
On coresets for k-means and k-median clustering. STOC 2004: 291-300 - [i3]Sariel Har-Peled, Manor Mendel:
Fast Construction of Nets in Low Dimensional Metrics, and Their Applications. CoRR cs.DS/0409057 (2004) - 2003
- [j18]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. Geom. Appl. 13(6): 463-485 (2003) - [c43]Sariel Har-Peled, Yusu Wang:
Shape fitting with outliers. SCG 2003: 29-38 - [c42]Sariel Har-Peled, Kasturi R. Varadarajan:
High-dimensional shape fitting in linear time. SCG 2003: 39-47 - [c41]Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg:
Efficient algorithms for shared camera control. SCG 2003: 68-77 - [c40]Sariel Har-Peled, Shakhar Smorodinsky:
On conflict-free coloring of points and simple regions in the plane. SCG 2003: 114-123 - [c39]Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang:
Hausdorff distance under translation for points and balls. SCG 2003: 282-291 - [c38]Sariel Har-Peled, Soham Mazumdar:
Fast Algorithms for Computing the Smallest k-Enclosing Disc. ESA 2003: 278-288 - [i2]Sariel Har-Peled, Piotr Indyk:
When Crossings Count - Approximating the Minimum Spanning Tree. CoRR cs.CG/0303001 (2003) - 2002
- [j17]Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia:
Computing Approximate Shortest Paths on Convex Polytopes. Algorithmica 33(2): 227-242 (2002) - [j16]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) - [j15]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) - [j14]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. Discret. Comput. Geom. 28(4): 535-569 (2002) - [c37]Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled:
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. ALENEX 2002: 178-193 - [c36]Sariel Har-Peled, Dan Roth, Dav Zimak:
Constraint Classification: A New Approach to Multiclass Classification. ALT 2002: 365-379 - [c35]Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek:
The one-round Voronoi game. SCG 2002: 97-101 - [c34]Jeff Erickson, Sariel Har-Peled:
Optimally cutting a surface into a disk. SCG 2002: 244-253 - [c33]Sariel Har-Peled, Kasturi R. Varadarajan:
Projective clustering in high dimensions using core-sets. SCG 2002: 312-318 - [c32]Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang:
Near-Linear Time Approximation Algorithms for Curve Simplification. ESA 2002: 29-41 - [c31]Ashutosh Garg, Sariel Har-Peled, Dan Roth:
On generalization bounds, projection profile, and margin distribution. ICML 2002: 171-178 - [c30]Alon Efrat, Sariel Har-Peled:
Guarding Galleries and Terrains. IFIP TCS 2002: 181-192 - [c29]Sariel Har-Peled, Dan Roth, Dav Zimak:
Constraint Classification for Multiclass Classification and Ranking. NIPS 2002: 785-792 - [c28]Mihai Badoiu, Sariel Har-Peled, Piotr Indyk:
Approximate clustering via core-sets. STOC 2002: 250-257 - [i1]Jeff Erickson, Sariel Har-Peled:
Optimally cutting a surface into a disk. CoRR cs.CG/0207004 (2002) - 2001
- [j13]Sariel Har-Peled, Micha Sharir:
Online Point Location in Planar Arrangements and Its Applications. Discret. Comput. Geom. 26(1): 19-40 (2001) - [j12]Gill Barequet, Sariel Har-Peled:
Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. Int. J. Comput. Geom. Appl. 11(4): 465-474 (2001) - [j11]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) - [j10]Yehuda Afek, Anat Bremler-Barr, Sariel Har-Peled:
Routing with a clue. IEEE/ACM Trans. Netw. 9(6): 693-705 (2001) - [c27]Sariel Har-Peled:
A practical approach for computing the diameter of a point set. SCG 2001: 177-186 - [c26]Yusu Wang, Pankaj K. Agarwal, Sariel Har-Peled:
An On-line Occlusio-Culling Algorithm for FastWalkthrough in Urban Areas. Eurographics (Short Presentations) 2001 - [c25]Sariel Har-Peled, Kasturi R. Varadarajan:
Approximate Shape Fitting via Linearization. FOCS 2001: 66-73 - [c24]Sariel Har-Peled:
Clustering Motion. FOCS 2001: 84-93 - [c23]Sariel Har-Peled:
A Replacement for Voronoi Diagrams of Near Linear Size. FOCS 2001: 94-103 - [c22]Sariel Har-Peled, Micha Sharir:
Online point location in planar arrangements and its applications. SODA 2001: 57-66 - [c21]Pankaj K. Agarwal, Sariel Har-Peled:
Maintaining approximate extent measures of moving points. SODA 2001: 148-157 - [c20]Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali:
Morphing between polylines. SODA 2001: 680-689 - [c19]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 - 2000
- [j9]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir:
Approximation Algorithms for Minimum-Width Annuli and Shells. Discret. Comput. Geom. 24(4): 687-705 (2000) - [j8]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) - [j7]Sariel Har-Peled:
Constructing Planar Cuttings in Theory and Practice. SIAM J. Comput. 29(6): 2016-2039 (2000) - [j6]Sariel Har-Peled:
Taking a Walk in a Planar Arrangement. SIAM J. Comput. 30(4): 1341-1367 (2000) - [c18]Sariel Har-Peled, Piotr Indyk:
When crossings count - approximating the minimum spanning tree. SCG 2000: 166-175 - [c17]Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia:
Computing approximate shortest paths on convex polytopes. SCG 2000: 270-279 - [c16]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 - [c15]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
1990 – 1999
- 1999
- [j5]Sariel Har-Peled:
Multicolor Combination Lemma. Comput. Geom. 12(3-4): 155-176 (1999) - [j4]Sariel Har-Peled:
Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions. Discret. Comput. Geom. 21(2): 217-231 (1999) - [j3]Sariel Har-Peled:
Constructing Approximate Shortest Path Maps in Three Dimensions. SIAM J. Comput. 28(4): 1182-1197 (1999) - [c14]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir:
Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. SCG 1999: 380-389 - [c13]Sariel Har-Peled:
Taking a Walk in a Planar Arrangement. FOCS 1999: 100-111 - [c12]Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled:
Routing with a Clue. SIGCOMM 1999: 203-214 - [c11]Gill Barequet, Sariel Har-Peled:
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. SODA 1999: 82-91 - [c10]Gill Barequet, Sariel Har-Peled:
Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. SODA 1999: 862-863 - [c9]Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart:
On-Line Zone Construction in Arrangements of Lines in the Plane. WAE 1999: 139-153 - 1998
- [j2]Sariel Har-Peled:
An output sensitive algorithm for discrete convex hulls. Comput. Geom. 10(2): 125-138 (1998) - [c8]Alon Efrat, Sariel Har-Peled:
Fly Cheaply: On the Minimum Fuel-Consumption Problem. SCG 1998: 143-145 - [c7]Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl:
Results on k-Sets and j-Facets via Continuous Motion. SCG 1998: 192-199 - [c6]Sariel Har-Peled:
Constructing Cuttings in Theory and Practice. SCG 1998: 327-336 - [c5]Sariel Har-Peled:
An Output Sensitive Algorithm for Discrete Convex Hulls. SCG 1998: 357-364 - [c4]Sariel Har-Peled:
Constructing Approximate Shortest Path Maps in Three Dimensions. SCG 1998: 383-391 - 1997
- [j1]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) - [c3]Sariel Har-Peled:
Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions. SCG 1997: 359-365 - 1996
- [c2]Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan:
Approximating Shortest Paths on a Convex Polytope in Three Dimensions. SCG 1996: 329-338 - 1995
- [c1]Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink:
The complexity of a single face of a minkowski sum. CCCG 1995: 91-96
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
