Sariel Har-Peled

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The Fréchet distance unleashed: approximating a dog with a frog2026-08-11Paper
The road to the closest point is paved by good neighbors2026-07-08Paper
No-dimensional Tverberg partitions revisited
Discrete & Computational Geometry
2026-07-07Paper
Approximating densest subgraph in geometric intersection graphs2026-06-24Paper
Approximate shape fitting via linearization2026-05-08Paper
Clustering motion2026-05-08Paper
A replacement for Voronoi diagrams of near linear size2026-05-08Paper
Taking a walk in a planar arrangement2026-05-06Paper
On undecided LP, clustering and active learning2026-04-27Paper
Stabbing convex bodies with lines and flats2026-04-27Paper
Reliable spanners for metric spaces2026-04-27Paper
Active learning a convex body in low dimensions2026-03-18Paper
Oracle-augmented prophet inequalities2026-01-14Paper
No-dimensional Tverberg partitions revisited2025-12-02Paper
Local spanners revisited2025-12-02Paper
Near optimal locality sensitive orderings in Euclidean space2025-11-24Paper
On the budgeted Hausdorff distance problem
CGT. Computing in Geometry and Topology
2025-10-21Paper
How packed is it, really?
CGT. Computing in Geometry and Topology
2025-10-21Paper
Near-optimal Euclidean locality-sensitive orderings
Journal of Computational Geometry
2025-08-28Paper
Approximating minimization diagrams and generalized proximity search2025-05-20Paper
Down the rabbit hole: robust proximity search and density estimation in sublinear space2025-05-05Paper
Computing instance-optimal kernels in two dimensions
Discrete & Computational Geometry
2025-03-19Paper
On the number of incidences when avoiding an induced biclique in geometric settings
Discrete & Computational Geometry
2025-02-19Paper
Sparsifying disk intersection graphs for reliable connectivity
CGT. Computing in Geometry and Topology
2025-02-03Paper
An Easy Proof of a Weak Version of Chernoff inequality
(available as arXiv preprint)
2025-01-01Paper
Fast approximation algorithms for piercing boxes by points2024-11-28Paper
Computing instance-optimal kernels in two dimensions2024-10-16Paper
Revisiting random points: combinatorial complexity and algorithms2024-05-29Paper
Halving by a thousand cuts or punctures2024-05-14Paper
On the number of incidences when avoiding an induced biclique in geometric settings2024-05-14Paper
Approximation algorithms for maximum matchings in geometric intersection graphs2024-05-14Paper
Submodular clustering in low dimensions
(available as arXiv preprint)
2023-11-02Paper
Fast Algorithms for Geometric Consensuses
(available as arXiv preprint)
2023-11-02Paper
Reliable Spanners for Metric Spaces
ACM Transactions on Algorithms
2023-10-23Paper
Improved Approximation Algorithms for Tverberg Partitions
(available as arXiv preprint)
2023-09-20Paper
A note on stabbing convex bodies with points, lines, and flats
Discrete & Computational Geometry
2023-05-12Paper
Edge Estimation with Independent Set Oracles
ACM Transactions on Algorithms
2023-04-26Paper
Few cuts meet many point sets
Algorithmica
2023-04-11Paper
Sometimes Reliable Spanners of Almost Linear Size.2023-02-07Paper
Stabbing pairwise intersecting disks by five points2022-07-21Paper
A spanner for the day after2022-07-18Paper
Smallest k-enclosing rectangle revisited2022-07-18Paper
Journey to the Center of the Point Set2022-07-18Paper
On Locality-Sensitive Orderings and Their Applications2022-07-18Paper
Optimal algorithms for geometric centers and depth
SIAM Journal on Computing
2022-06-08Paper
Sometimes reliable spanners of almost linear size
(available as arXiv preprint)
2022-05-18Paper
The maximum-level vertex in an arrangement of lines
Discrete & Computational Geometry
2022-03-21Paper
Journey to the Center of the Point Set
ACM Transactions on Algorithms
2022-02-08Paper
Smallest \(k\)-enclosing rectangle revisited
Discrete & Computational Geometry
2021-08-18Paper
Approximate sparse linear regression
(available as arXiv preprint)
2021-07-28Paper
Edge estimation with independent set oracles
(available as arXiv preprint)
2021-06-15Paper
Stabbing pairwise intersecting disks by five points
Discrete Mathematics
2021-06-14Paper
Stabbing pairwise intersecting disks by five points
Discrete Mathematics
2021-06-14Paper
Active-learning a convex body in low dimensions
Algorithmica
2021-06-11Paper
Grid Peeling and the Affine Curve-Shortening Flow
Experimental Mathematics
2021-04-01Paper
Fast LP-based Approximations for Geometric Packing and Covering Problems
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
2021-02-02Paper
A spanner for the day after
Discrete & Computational Geometry
2021-01-29Paper
Approximate greedy clustering and distance selection for graph metrics
(available as arXiv preprint)
2021-01-12Paper
On locality-sensitive orderings and their applications
SIAM Journal on Computing
2020-08-03Paper
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
Discrete & Computational Geometry
2020-06-16Paper
On separating points by lines
Discrete & Computational Geometry
2020-04-07Paper
Approximation schemes for independent set and sparse subsets of polygons
Journal of the ACM
2020-02-11Paper
Sparse Approximation via Generating Point Sets
ACM Transactions on Algorithms
2019-11-25Paper
Grid peeling and the affine curve-shortening flow
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Euclidean spanners in high dimensions
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
Jaywalking your dog: computing the Fréchet distance with shortcuts2019-05-10Paper
The one-round Voronoi game
Proceedings of the eighteenth annual symposium on Computational geometry
2018-11-23Paper
Optimally cutting a surface into a disk
Proceedings of the eighteenth annual symposium on Computational geometry
2018-11-23Paper
Projective clustering in high dimensions using core-sets
Proceedings of the eighteenth annual symposium on Computational geometry
2018-11-23Paper
On the expected complexity of Voronoi diagrams on terrains
ACM Transactions on Algorithms
2018-11-05Paper
Nearest-neighbor searching under uncertainty. II
ACM Transactions on Algorithms
2018-11-05Paper
Net and prune: a linear time algorithm for Euclidean distance problems
Journal of the ACM
2018-08-02Paper
Sparse approximation via generating point sets
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Approximating the k-level in three-dimensional plane arrangements
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Proximity in the age of distraction: robust approximate nearest neighbor search
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Quasi-polynomial time approximation scheme for sparse subsets of polygons
Proceedings of the thirtieth annual symposium on Computational geometry
2018-04-23Paper
On the Complexity of Randomly Weighted Voronoi Diagrams
Proceedings of the thirtieth annual symposium on Computational geometry
2018-04-23Paper
scientific article; zbMATH DE number 6850368 (Why is no real title available?)2018-03-15Paper
Robust proximity search for balls using sublinear space
Algorithmica
2018-02-28Paper
Robust proximity search for balls using sublinear space
Algorithmica
2018-02-28Paper
Approximating the k-Level in Three-Dimensional Plane Arrangements
A Journey Through Discrete Mathematics
2018-02-26Paper
Separating a Voronoi diagram via local search
(available as arXiv preprint)
2018-01-30Paper
Approximation algorithms for polynomial-expansion and low-density graphs
SIAM Journal on Computing
2017-11-22Paper
Geometric Packing under Nonuniform Constraints
SIAM Journal on Computing
2017-11-22Paper
Smaller coresets for \(k\)-median and \(k\)-means clustering
Proceedings of the twenty-first annual symposium on Computational geometry
2017-10-20Paper
Fast construction of nets in low dimensional metrics, and their applications
Proceedings of the twenty-first annual symposium on Computational geometry
2017-10-20Paper
A time-optimal delaunay refinement algorithm in two dimensions
Proceedings of the twenty-first annual symposium on Computational geometry
2017-10-20Paper
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
2017-10-20Paper
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
2017-10-20Paper
Shortest Path in a Polygon using Sublinear Space.2017-10-10Paper
Space exploration via proximity search2017-10-10Paper
From proximity to utility: a Voronoi partition of Pareto optima2017-10-10Paper
Convex hulls under uncertainty
Algorithmica
2017-10-10Paper
When crossings count — approximating the minimum spanning tree
Proceedings of the sixteenth annual symposium on Computational geometry
2017-09-29Paper
Computing approximate shortest paths on convex polytopes
Proceedings of the sixteenth annual symposium on Computational geometry
2017-09-29Paper
A practical approach for computing the diameter of a point set
Proceedings of the seventeenth annual symposium on Computational geometry
2017-09-29Paper
Shape fitting with outliers
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
High-dimensional shape fitting in linear time
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
Efficient algorithms for shared camera control
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
On the least median square problem
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
← Previous 100   1   2   3   Next 100 →


Research outcomes over time


This page was built for person: Sariel Har-Peled