Sariel Har-Peled

ORCID

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 129

Top Venues

CoRR

SoCG

Discret. Comput. Geom.

SIAM J. Comput.

Publications

Sariel Har-Peled, Da Wei Zheng
Halving by a Thousand Cuts or Punctures. SODA (2023)
Sariel Har-Peled, Benjamin Raichel
On the Budgeted Hausdorff Distance Problem. CoRR (2023)
Pankaj K. Agarwal, Sariel Har-Peled
Computing Instance-Optimal Kernels in Two Dimensions. SoCG (2023)
Zhimeng Gao, Sariel Har-Peled
Almost Optimal Locality Sensitive Orderings in Euclidean Space. CoRR (2023)
Sariel Har-Peled, Eliot Wong Robson
On the Width of the Regular n-Simplex. CoRR (2023)
Stav Ashur, Sariel Har-Peled
On the Rectangles Induced by Points. CoRR (2023)
Sariel Har-Peled, Mitchell Jones
A Note on Stabbing Convex Bodies with Points, Lines, and Flats. Discret. Comput. Geom. 69 (4) (2023)
Sariel Har-Peled, Mitchell Jones
Few Cuts Meet Many Point Sets. Algorithmica 85 (4) (2023)
Sariel Har-Peled, Eliot Wong Robson
No-dimensional Tverberg Partitions Revisited. CoRR (2023)
Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos
Fast Approximation Algorithms for Piercing Boxes by Points. CoRR (2023)
Sariel Har-Peled
Approximately: Independence Implies Vertex Cover. CoRR (2023)
Timothy M. Chan, Sariel Har-Peled
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. SODA (2023)
Sariel Har-Peled, Manor Mendel, Dániel Oláh
Reliable Spanners for Metric Spaces. ACM Trans. Algorithms 19 (1) (2023)
Sariel Har-Peled, Elfarouk Harb
Revisiting Random Points: Combinatorial Complexity and Algorithms. CoRR (2022)
Sariel Har-Peled, Eliot Wong Robson
Sparsifying Disk Intersection Graphs for Reliable Connectivity. CoRR (2022)
Sariel Har-Peled, Da Wei Zheng
Halving by a Thousand Cuts or Punctures. CoRR (2022)
Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
Optimal Algorithms for Geometric Centers and Depth. SIAM J. Comput. 51 (3) (2022)
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) (2022)
Stav Ashur, Sariel Har-Peled
Local Spanners Revisited. CoRR (2022)
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) (2022)
Kevin Buchin, Sariel Har-Peled, Dániel Oláh
Sometimes reliable spanners of almost linear size. J. Comput. Geom. 13 (1) (2022)
Pankaj K. Agarwal, Sariel Har-Peled
Computing Optimal Kernels in Two Dimensions. CoRR (2022)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Sampling near neighbors in search for fairness. Commun. ACM 65 (8) (2022)
Sariel Har-Peled, Everett Yang
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. CoRR (2022)
Sariel Har-Peled, Everett Yang
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. SoCG (2022)
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 (2021)
Sariel Har-Peled, Timothy Zhou
How Packed Is It, Really? CoRR (2021)
Sariel Har-Peled, Mitchell Jones
Journey to the Center of the Point Set. ACM Trans. Algorithms 17 (1) (2021)
Stav Ashur, Sariel Har-Peled
On Undecided LP, Clustering and Active Learning. CoRR (2021)
Timothy M. Chan, Sariel Har-Peled
Smallest k-Enclosing Rectangle Revisited. Discret. Comput. Geom. 66 (2) (2021)
Sariel Har-Peled, Joseph Rogge
On Clusters that are Separated but Large. CoRR (2021)
Sariel Har-Peled, Manor Mendel, Dániel Oláh
Reliable Spanners for Metric Spaces. SoCG (2021)
Sariel Har-Peled
On the Number of Incidences when Avoiding the Klan. CoRR (2021)
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) (2021)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Fair near neighbor search via sampling. SIGMOD Rec. 50 (1) (2021)
Sariel Har-Peled, Jiaqi Cheng
On Competitive Permutations for Set Cover by Intervals. CoRR (2021)
Stav Ashur, Sariel Har-Peled
On Undecided LP, Clustering and Active Learning. SoCG (2021)
Sariel Har-Peled, Mitchell Jones
Stabbing Convex Bodies with Lines and Flats. SoCG (2021)
Sariel Har-Peled, Mitchell Jones, Saladi Rahul
Active-Learning a Convex Body in Low Dimensions. Algorithmica 83 (6) (2021)
Sariel Har-Peled, Timothy Zhou
Improved Approximation Algorithms for Tverberg Partitions. ESA (2021)
Kevin Buchin, Sariel Har-Peled, Dániel Oláh
Sometimes Reliable Spanners of Almost Linear Size. ESA (2020)
Sariel Har-Peled, Mitchell Jones
Some Geometric Applications of Anti-Chains. CCCG (2020)
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
The Maximum-Level Vertex in an Arrangement of Lines. CoRR (2020)
Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
Edge Estimation with Independent Set Oracles. ACM Trans. Algorithms 16 (4) (2020)
Sariel Har-Peled, Mitchell Jones
Fast Algorithms for Geometric Consensuses. SoCG (2020)
Arturs Backurs, Sariel Har-Peled
Submodular Clustering in Low Dimensions. SWAT (2020)
Sariel Har-Peled, Mitchell Jones
Stabbing Convex Bodies with Lines and Flats. CoRR (2020)
Kevin Buchin, Sariel Har-Peled, Dániel Oláh
A Spanner for the Day After. Discret. Comput. Geom. 64 (4) (2020)
Sariel Har-Peled, Mitchell Jones, Saladi Rahul
Active Learning a Convex Body in Low Dimensions. ICALP (2020)
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) (2020)
Arturs Backurs, Sariel Har-Peled
Submodular Clustering in Low Dimensions. CoRR (2020)
Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
On Locality-Sensitive Orderings and Their Applications. SIAM J. Comput. 49 (3) (2020)
Sariel Har-Peled, Timothy Zhou
Improved Approximation Algorithms for Tverberg Partitions. CoRR (2020)
David Eppstein, Sariel Har-Peled, Gabriel Nivasch
Grid Peeling and the Affine Curve-Shortening Flow. Exp. Math. 29 (3) (2020)
Chandra Chekuri, Sariel Har-Peled, Kent Quanrud
Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA (2020)
Sariel Har-Peled, Dániel Oláh
Reliable Spanners for Metric Spaces. CoRR (2020)
Sariel Har-Peled, Rajgopal Varadharajan
Shortest Secure Path in a Voronoi Diagram. CoRR (2020)
David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos
Approximate greedy clustering and distance selection for graph metrics. J. Comput. Geom. 11 (1) (2020)
Sariel Har-Peled, Mitchell Jones
On Separating Points by Lines. Discret. Comput. Geom. 63 (3) (2020)
Sariel Har-Peled, Mitchell Jones
Journey to the Center of the Point Set. SoCG (2019)
Sariel Har-Peled, Sepideh Mahabadi
Near Neighbor: Who is the Fairest of Them All? NeurIPS (2019)
Kevin Buchin, Sariel Har-Peled, Dániel Oláh
Sometimes Reliable Spanners of Almost Linear Size. CoRR (2019)
Timothy M. Chan, Sariel Har-Peled
Smallest k-Enclosing Rectangle Revisited. CoRR (2019)
Sariel Har-Peled, Sepideh Mahabadi
Near Neighbor: Who is the Fairest of Them All? CoRR (2019)
Sariel Har-Peled, Mitchell Jones
Proof of Dudley's Convex Approximation. CoRR (2019)
Avrim Blum, Sariel Har-Peled, Benjamin Raichel
Sparse Approximation via Generating Point Sets. ACM Trans. Algorithms 15 (3) (2019)
Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu
Covering Polygons by Min-Area Convex Polygons. CoRR (2019)
Kevin Buchin, Sariel Har-Peled, Dániel Oláh
A Spanner for the Day After. SoCG (2019)
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66 (4) (2019)
Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
On Locality-Sensitive Orderings and Their Applications. ITCS (2019)
Timothy M. Chan, Sariel Har-Peled
Smallest k-Enclosing Rectangle Revisited. SoCG (2019)
Sariel Har-Peled, Mitchell Jones, Saladi Rahul
Active Learning a Convex Body in Low Dimensions. CoRR (2019)
Sariel Har-Peled, Mitchell Jones
Some Geometric Applications of Anti-Chains. CoRR (2019)
Sariel Har-Peled, Mitchell Jones
Fast Algorithms for Geometric Consensuses. CoRR (2019)
David Eppstein, Sariel Har-Peled, Gabriel Nivasch
Grid peeling and the affine curve-shortening flow. ALENEX (2018)
Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
Stabbing pairwise intersecting disks by five points. CoRR (2018)
Sariel Har-Peled, Mitchell Jones
On Separating Points by Lines. SODA (2018)
Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
Edge Estimation with Independent Set Oracles. ITCS (2018)
Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC (2018)
Sariel Har-Peled, Nirman Kumar
Robust Proximity Search for Balls Using Sublinear Space. Algorithmica 80 (1) (2018)
Sariel Har-Peled, Saladi Rahul
Two (Known) Results About Graphs with No Short Odd Cycles. CoRR (2018)
Kevin Buchin, Sariel Har-Peled, Dániel Oláh
A Spanner for the Day After. CoRR (2018)
Sariel Har-Peled, Mitchell Jones
Few Cuts Meet Many Point Sets. CoRR (2018)
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
Approximate Sparse Linear Regression. ICALP (2018)
Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
On Locality-Sensitive Orderings and their Applications. CoRR (2018)
Linda Cai, Sariel Har-Peled, Simiao Ye
Separators for Planar Graphs that are Almost Trees. CoRR (2018)
Sariel Har-Peled, Soham Mazumdar
Coresets for $k$-Means and $k$-Median Clustering and their Applications. CoRR (2018)
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR (2017)
Sariel Har-Peled, Mitchell Jones
On Separating Points by Lines. CoRR (2017)
Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR (2017)
Sariel Har-Peled, Sepideh Mahabadi
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. SODA (2017)
David Eppstein, Sariel Har-Peled, Gabriel Nivasch
Grid peeling and the affine curve-shortening flow. CoRR (2017)
Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang
Convex Hulls Under Uncertainty. Algorithmica 79 (2) (2017)
Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
Edge Estimation with Independent Set Oracles. CoRR (2017)
Sariel Har-Peled, Subhro Roy
Approximating the Maximum Overlap of Polygons under Translation. Algorithmica 78 (1) (2017)
Sariel Har-Peled, Kent Quanrud
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. SIAM J. Comput. 46 (6) (2017)
Sariel Har-Peled, Sepideh Mahabadi
LSH on the Hypercube Revisited. CoRR (2017)
Alina Ene, Sariel Har-Peled, Benjamin Raichel
Geometric Packing under Nonuniform Constraints. SIAM J. Comput. 46 (6) (2017)
Sariel Har-Peled, Mitchell Jones
How to Net a Convex Shape. CoRR (2017)
Sariel Har-Peled, Amir Nayyeri
A Simple Algorithm for Computing a Cycle Separator. CoRR (2017)

Sariel Har-Peled.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sariel Har-Peled