Sariel Har-Peled

362 papers A* 57A 15B 7C 2Journal 227Unranked 54

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	An Output Sensitive Algorithm for Discrete Convex Hulls. CoRR Sariel Har-Peled
2026	J	`jnl`	Graph-Based Nearest-Neighbor Search without the Spread. CoRR Jeff Giliberti, Sariel Har-Peled, Jonas Sauer, Ali Vakilian
2026	J	`jnl`	How to Get Close to the Median Shape. CoRR Sariel Har-Peled
2026	J	`jnl`	In the Search for Good Neck Cuts. CoRR Sam Ruggerio, Sariel Har-Peled
2026	J	`jnl`	On Small Pair Decompositions for Point Sets. CoRR Kevin Buchin, Jacobus Conradi, Sariel Har-Peled, Antonia Kalb, Abhiruk Lahiri, Lukas Plätz, Carolin Rehs
2026	—	`conf`	The Road to the Closest Point is Paved by Good Neighbors. SOSA Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson
2025	J	`jnl`	A Practical Approach for Computing the Diameter of a Point Set. CoRR Sariel Har-Peled
2025	J	`jnl`	An Easy Proof of a Weak Version of Chernoff inequality. CoRR Sariel Har-Peled
2025	A	`conf`	Approximating Densest Subgraph in Geometric Intersection Graphs. STACS Sariel Har-Peled, Saladi Rahul
2025	J	`jnl`	Bifurcation: How to Explore a Tree. CoRR Sariel Har-Peled
2025	J	`jnl`	Computing Instance-Optimal Kernels in Two Dimensions. Discret. Comput. Geom. Pankaj K. Agarwal, Sariel Har-Peled
2025	J	`jnl`	Edge Nearest Neighbor in Sampling-Based Motion Planning. CoRR Stav Ashur, Nancy M. Amato, Sariel Har-Peled
2025	J	`jnl`	Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. CoRR Gill Barequet, Sariel Har-Peled
2025	J	`jnl`	Faster Motion Planning via Restarts. CoRR Nancy M. Amato, Stav Ashur, Sariel Har-Peled
2025	J	`jnl`	How Packed Is It, Really? Comput. Geom. Topol. Sariel Har-Peled, Timothy Zhou
2025	J	`jnl`	Improving the average dilation of a metric graph by adding edges. CoRR Sariel Har-Peled, Eliot W. Robson
2025	J	`jnl`	New Constructions of SSPDs and their Applications. CoRR Mohammad Ali Abam, Sariel Har-Peled
2025	J	`jnl`	On the Budgeted Hausdorff Distance Problem. Comput. Geom. Topol. Sariel Har-Peled, Benjamin Raichel
2025	J	`jnl`	On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. Discret. Comput. Geom. Timothy M. Chan, Sariel Har-Peled
2025	J	`jnl`	Orthogonal Emptiness Queries for Random Points. CoRR Jonathan E. Dullerud, Sariel Har-Peled
2025	J	`jnl`	Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard. CoRR Gill Barequet, Sariel Har-Peled
2025	J	`jnl`	Quickly Avoiding a Random Catastrophe. CoRR Stav Ashur, Sariel Har-Peled
2025	J	`jnl`	The Complexity of One or Many Faces in the Overlay of Many Arrangements. CoRR Sariel Har-Peled
2025	A*	`conf`	The Fréchet Distance Unleashed: Approximating a Dog with a Frog. SoCG Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson
2025	J	`jnl`	The Road to the Closest Point is Paved by Good Neighbors. CoRR Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson
2025	J	`jnl`	Well-Separated Pairs Decomposition Revisited. CoRR Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson
2024	J	`jnl`	Approximating Densest Subgraph in Geometric Intersection Graphs. CoRR Sariel Har-Peled, Saladi Rahul
2024	J	`jnl`	Dependable Spanners via Unreliable Edges. CoRR Sariel Har-Peled, Maria C. Lusardi
2024	A*	`conf`	Fast Approximation Algorithms for Piercing Boxes by Points. SODA Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos
2024	—	`conf`	Local Spanners Revisited. SWAT Stav Ashur, Sariel Har-Peled
2024	A*	`conf`	Near Optimal Locality Sensitive Orderings in Euclidean Space. SoCG Zhimeng Gao, Sariel Har-Peled
2024	J	`jnl`	Near-optimal Euclidean locality-sensitive orderings. J. Comput. Geom. Zhimeng Gao, Sariel Har-Peled
2024	—	`conf`	No-Dimensional Tverberg Partitions Revisited. SWAT Sariel Har-Peled, Eliot Wong Robson
2024	A*	`conf`	Oracle-Augmented Prophet Inequalities. ICALP Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos
2024	J	`jnl`	Oracle-Augmented Prophet Inequalities. CoRR Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos
2024	—	`conf`	Revisiting Random Points: Combinatorial Complexity and Algorithms. SOSA Sariel Har-Peled, Elfarouk Harb
2024	J	`jnl`	SPITE: Simple Polyhedral Intersection Techniques for modified Environments. CoRR Stav Ashur, Maria C. Lusardi, Marta Markowicz, James Motes, Marco Morales, Sariel Har-Peled, Nancy M. Amato
2024	J	`jnl`	Sparsifying Disk Intersection Graphs for Reliable Connectivity. Comput. Geom. Topol. Eliot W. Robson, Sariel Har-Peled
2024	J	`jnl`	The Fréchet Distance Unleashed: Approximating a Dog with a Frog. CoRR Sariel Har-Peled, Benjamin Raichel, Eliot Wong Robson
2023	J	`jnl`	A Note on Stabbing Convex Bodies with Points, Lines, and Flats. Discret. Comput. Geom. Sariel Har-Peled, Mitchell Jones
2023	J	`jnl`	Almost Optimal Locality Sensitive Orderings in Euclidean Space. CoRR Zhimeng Gao, Sariel Har-Peled
2023	J	`jnl`	Approximately: Independence Implies Vertex Cover. CoRR Sariel Har-Peled
2023	A*	`conf`	Computing Instance-Optimal Kernels in Two Dimensions. SoCG Pankaj K. Agarwal, Sariel Har-Peled
2023	J	`jnl`	Fast Approximation Algorithms for Piercing Boxes by Points. CoRR Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos
2023	J	`jnl`	Few Cuts Meet Many Point Sets. Algorithmica Sariel Har-Peled, Mitchell Jones
2023	A*	`conf`	Halving by a Thousand Cuts or Punctures. SODA Sariel Har-Peled, Da Wei Zheng
2023	J	`jnl`	No-dimensional Tverberg Partitions Revisited. CoRR Sariel Har-Peled, Eliot Wong Robson
2023	—	`conf`	On the Budgeted Hausdorff Distance Problem. CCCG Sariel Har-Peled, Benjamin Raichel
2023	J	`jnl`	On the Budgeted Hausdorff Distance Problem. CoRR Sariel Har-Peled, Benjamin Raichel
2023	A*	`conf`	On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. SODA Timothy M. Chan, Sariel Har-Peled
2023	J	`jnl`	On the Rectangles Induced by Points. CoRR Stav Ashur, Sariel Har-Peled
2023	J	`jnl`	On the Width of the Regular n-Simplex. CoRR Sariel Har-Peled, Eliot Wong Robson
2023	J	`jnl`	Reliable Spanners for Metric Spaces. ACM Trans. Algorithms Sariel Har-Peled, Manor Mendel, Dániel Oláh
2022	A*	`conf`	Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. SoCG Sariel Har-Peled, Everett Yang
2022	J	`jnl`	Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. CoRR Sariel Har-Peled, Everett Yang
2022	J	`jnl`	Computing Optimal Kernels in Two Dimensions. CoRR Pankaj K. Agarwal, Sariel Har-Peled
2022	J	`jnl`	Halving by a Thousand Cuts or Punctures. CoRR Sariel Har-Peled, Da Wei Zheng
2022	J	`jnl`	Local Spanners Revisited. CoRR Stav Ashur, Sariel Har-Peled
2022	J	`jnl`	Optimal Algorithms for Geometric Centers and Depth. SIAM J. Comput. Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
2022	J	`jnl`	Revisiting Random Points: Combinatorial Complexity and Algorithms. CoRR Sariel Har-Peled, Elfarouk Harb
2022	J	`jnl`	Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2022	J	`jnl`	Sampling near neighbors in search for fairness. Commun. ACM Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2022	J	`jnl`	Sometimes reliable spanners of almost linear size. J. Comput. Geom. Kevin Buchin, Sariel Har-Peled, Dániel Oláh
2022	J	`jnl`	Sparsifying Disk Intersection Graphs for Reliable Connectivity. CoRR Sariel Har-Peled, Eliot Wong Robson
2022	J	`jnl`	The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2021	J	`jnl`	Active-Learning a Convex Body in Low Dimensions. Algorithmica Sariel Har-Peled, Mitchell Jones, Saladi Rahul
2021	J	`jnl`	Fair near neighbor search via sampling. SIGMOD Rec. Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2021	J	`jnl`	How Packed Is It, Really? CoRR Sariel Har-Peled, Timothy Zhou
2021	A	`conf`	Improved Approximation Algorithms for Tverberg Partitions. ESA Sariel Har-Peled, Timothy Zhou
2021	J	`jnl`	Journey to the Center of the Point Set. ACM Trans. Algorithms Sariel Har-Peled, Mitchell Jones
2021	J	`jnl`	On Clusters that are Separated but Large. CoRR Sariel Har-Peled, Joseph Rogge
2021	J	`jnl`	On Competitive Permutations for Set Cover by Intervals. CoRR Sariel Har-Peled, Jiaqi Cheng
2021	A*	`conf`	On Undecided LP, Clustering and Active Learning. SoCG Stav Ashur, Sariel Har-Peled
2021	J	`jnl`	On Undecided LP, Clustering and Active Learning. CoRR Stav Ashur, Sariel Har-Peled
2021	J	`jnl`	On the Number of Incidences when Avoiding the Klan. CoRR Sariel Har-Peled
2021	A*	`conf`	Reliable Spanners for Metric Spaces. SoCG Sariel Har-Peled, Manor Mendel, Dániel Oláh
2021	J	`jnl`	Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? CoRR Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2021	J	`jnl`	Smallest k-Enclosing Rectangle Revisited. Discret. Comput. Geom. Timothy M. Chan, Sariel Har-Peled
2021	A*	`conf`	Stabbing Convex Bodies with Lines and Flats. SoCG Sariel Har-Peled, Mitchell Jones
2021	J	`jnl`	Stabbing pairwise intersecting disks by five points. Discret. Math. Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2020	J	`jnl`	A Spanner for the Day After. Discret. Comput. Geom. Kevin Buchin, Sariel Har-Peled, Dániel Oláh
2020	A*	`conf`	Active Learning a Convex Body in Low Dimensions. ICALP Sariel Har-Peled, Mitchell Jones, Saladi Rahul
2020	J	`jnl`	Approximate greedy clustering and distance selection for graph metrics. J. Comput. Geom. David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos
2020	J	`jnl`	Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Edge Estimation with Independent Set Oracles. ACM Trans. Algorithms Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2020	A*	`conf`	Fast Algorithms for Geometric Consensuses. SoCG Sariel Har-Peled, Mitchell Jones
2020	A*	`conf`	Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA Chandra Chekuri, Sariel Har-Peled, Kent Quanrud
2020	J	`jnl`	Grid Peeling and the Affine Curve-Shortening Flow. Exp. Math. David Eppstein, Sariel Har-Peled, Gabriel Nivasch
2020	J	`jnl`	Improved Approximation Algorithms for Tverberg Partitions. CoRR Sariel Har-Peled, Timothy Zhou
2020	J	`jnl`	On Locality-Sensitive Orderings and Their Applications. SIAM J. Comput. Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
2020	J	`jnl`	On Separating Points by Lines. Discret. Comput. Geom. Sariel Har-Peled, Mitchell Jones
2020	J	`jnl`	Reliable Spanners for Metric Spaces. CoRR Sariel Har-Peled, Dániel Oláh
2020	J	`jnl`	Shortest Secure Path in a Voronoi Diagram. CoRR Sariel Har-Peled, Rajgopal Varadharajan
2020	—	`conf`	Some Geometric Applications of Anti-Chains. CCCG Sariel Har-Peled, Mitchell Jones
2020	A	`conf`	Sometimes Reliable Spanners of Almost Linear Size. ESA Kevin Buchin, Sariel Har-Peled, Dániel Oláh
2020	J	`jnl`	Stabbing Convex Bodies with Lines and Flats. CoRR Sariel Har-Peled, Mitchell Jones
2020	—	`conf`	Submodular Clustering in Low Dimensions. SWAT Arturs Backurs, Sariel Har-Peled
2020	J	`jnl`	Submodular Clustering in Low Dimensions. CoRR Arturs Backurs, Sariel Har-Peled
2020	J	`jnl`	The Maximum-Level Vertex in an Arrangement of Lines. CoRR Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2019	A*	`conf`	A Spanner for the Day After. SoCG Kevin Buchin, Sariel Har-Peled, Dániel Oláh
2019	J	`jnl`	Active Learning a Convex Body in Low Dimensions. CoRR Sariel Har-Peled, Mitchell Jones, Saladi Rahul
2019	J	`jnl`	Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
2019	J	`jnl`	Covering Polygons by Min-Area Convex Polygons. CoRR Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu
2019	J	`jnl`	Fast Algorithms for Geometric Consensuses. CoRR Sariel Har-Peled, Mitchell Jones
2019	A*	`conf`	Journey to the Center of the Point Set. SoCG Sariel Har-Peled, Mitchell Jones
2019	A*	`conf`	Near Neighbor: Who is the Fairest of Them All? NeurIPS Sariel Har-Peled, Sepideh Mahabadi
2019	J	`jnl`	Near Neighbor: Who is the Fairest of Them All? CoRR Sariel Har-Peled, Sepideh Mahabadi
2019	A	`conf`	On Locality-Sensitive Orderings and Their Applications. ITCS Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
2019	J	`jnl`	Proof of Dudley's Convex Approximation. CoRR Sariel Har-Peled, Mitchell Jones
2019	A*	`conf`	Smallest k-Enclosing Rectangle Revisited. SoCG Timothy M. Chan, Sariel Har-Peled
2019	J	`jnl`	Smallest k-Enclosing Rectangle Revisited. CoRR Timothy M. Chan, Sariel Har-Peled
2019	J	`jnl`	Some Geometric Applications of Anti-Chains. CoRR Sariel Har-Peled, Mitchell Jones
2019	J	`jnl`	Sometimes Reliable Spanners of Almost Linear Size. CoRR Kevin Buchin, Sariel Har-Peled, Dániel Oláh
2019	J	`jnl`	Sparse Approximation via Generating Point Sets. ACM Trans. Algorithms Avrim Blum, Sariel Har-Peled, Benjamin Raichel
2018	J	`jnl`	A Spanner for the Day After. CoRR Kevin Buchin, Sariel Har-Peled, Dániel Oláh
2018	A*	`conf`	Approximate Sparse Linear Regression. ICALP Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
2018	J	`jnl`	Coresets for $k$-Means and $k$-Median Clustering and their Applications. CoRR Sariel Har-Peled, Soham Mazumdar
2018	A	`conf`	Edge Estimation with Independent Set Oracles. ITCS Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2018	J	`jnl`	Few Cuts Meet Many Point Sets. CoRR Sariel Har-Peled, Mitchell Jones
2018	A	`conf`	Grid peeling and the affine curve-shortening flow. ALENEX David Eppstein, Sariel Har-Peled, Gabriel Nivasch
2018	J	`jnl`	On Locality-Sensitive Orderings and their Applications. CoRR Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
2018	A*	`conf`	On Separating Points by Lines. SODA Sariel Har-Peled, Mitchell Jones
2018	J	`jnl`	Robust Proximity Search for Balls Using Sublinear Space. Algorithmica Sariel Har-Peled, Nirman Kumar
2018	J	`jnl`	Separators for Planar Graphs that are Almost Trees. CoRR Linda Cai, Sariel Har-Peled, Simiao Ye
2018	B	`conf`	Stabbing Pairwise Intersecting Disks by Five Points. ISAAC Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	J	`jnl`	Stabbing pairwise intersecting disks by five points. CoRR Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	J	`jnl`	Two (Known) Results About Graphs with No Short Odd Cycles. CoRR Sariel Har-Peled, Saladi Rahul
2017	J	`jnl`	A Simple Algorithm for Computing a Cycle Separator. CoRR Sariel Har-Peled, Amir Nayyeri
2017	J	`jnl`	Approximating the Maximum Overlap of Polygons under Translation. Algorithmica Sariel Har-Peled, Subhro Roy
2017	J	`jnl`	Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. SIAM J. Comput. Sariel Har-Peled, Kent Quanrud
2017	J	`jnl`	Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
2017	J	`jnl`	Convex Hulls Under Uncertainty. Algorithmica Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang
2017	J	`jnl`	Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2017	J	`jnl`	Edge Estimation with Independent Set Oracles. CoRR Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2017	J	`jnl`	Geometric Packing under Nonuniform Constraints. SIAM J. Comput. Alina Ene, Sariel Har-Peled, Benjamin Raichel
2017	J	`jnl`	Grid peeling and the affine curve-shortening flow. CoRR David Eppstein, Sariel Har-Peled, Gabriel Nivasch
2017	J	`jnl`	How to Net a Convex Shape. CoRR Sariel Har-Peled, Mitchell Jones
2017	J	`jnl`	LSH on the Hypercube Revisited. CoRR Sariel Har-Peled, Sepideh Mahabadi
2017	J	`jnl`	On Separating Points by Lines. CoRR Sariel Har-Peled, Mitchell Jones
2017	A*	`conf`	Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. SODA Sariel Har-Peled, Sepideh Mahabadi
2016	J	`jnl`	Approximate Sparse Linear Regression. CoRR Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
2016	A*	`conf`	Approximating the SODA Sariel Har-Peled, Haim Kaplan, Micha Sharir
2016	J	`jnl`	Approximating the $k$-Level in Three-Dimensional Plane Arrangements. CoRR Sariel Har-Peled, Haim Kaplan, Micha Sharir
2016	J	`jnl`	Computing the k Nearest-Neighbors for all Vertices via Dijkstra. CoRR Sariel Har-Peled
2016	J	`jnl`	From Proximity to Utility: A Voronoi Partition of Pareto Optima. Discret. Comput. Geom. Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel
2016	J	`jnl`	How to Walk Your Dog in the Mountains with No Magic Leash. Discret. Comput. Geom. Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
2016	J	`jnl`	Nearest-Neighbor Searching Under Uncertainty II. CoRR Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang
2016	J	`jnl`	Nearest-Neighbor Searching Under Uncertainty II. ACM Trans. Algorithms Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang
2016	J	`jnl`	Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. CoRR Sariel Har-Peled, Kent Quanrud
2016	J	`jnl`	On the Expected Complexity of Voronoi Diagrams on Terrains. ACM Trans. Algorithms Anne Driemel, Sariel Har-Peled, Benjamin Raichel
2016	A*	`conf`	Separating a Voronoi Diagram via Local Search. SoCG Vijay V. S. P. Bhattiprolu, Sariel Har-Peled
2016	J	`jnl`	Shortest path in a polygon using sublinear space. J. Comput. Geom. Sariel Har-Peled
2016	J	`jnl`	Space Exploration via Proximity Search. Discret. Comput. Geom. Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
2016	A*	`conf`	Sparse Approximation via Generating Point Sets. SODA Avrim Blum, Sariel Har-Peled, Benjamin Raichel
2016	A*	`conf`	Towards Tight Bounds for the Streaming Set Cover Problem. PODS Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2015	J	`jnl`	A Simple Algorithm for Maximum Margin Classification, Revisited. CoRR Sariel Har-Peled
2015	J	`jnl`	Approximate Greedy Clustering and Distance Selection for Graph Metrics. CoRR David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos
2015	J	`jnl`	Approximating Minimization Diagrams and Generalized Proximity Search. SIAM J. Comput. Sariel Har-Peled, Nirman Kumar
2015	J	`jnl`	Approximation Algorithms for Low-Density Graphs. CoRR Sariel Har-Peled, Kent Quanrud
2015	A	`conf`	Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. ESA Sariel Har-Peled, Kent Quanrud
2015	A*	`conf`	From Proximity to Utility: A Voronoi Partition of Pareto Optima. SoCG Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel
2015	J	`jnl`	Fréchet Distance for Curves, Revisited. CoRR Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
2015	J	`jnl`	Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. J. ACM Sariel Har-Peled, Benjamin Raichel
2015	J	`jnl`	On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams. Discret. Comput. Geom. Sariel Har-Peled, Benjamin Raichel
2015	J	`jnl`	On the Number of Edges of Fan-Crossing Free Graphs. Algorithmica Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim
2015	J	`jnl`	Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. CoRR Sariel Har-Peled, Sepideh Mahabadi
2015	A*	`conf`	Shortest Path in a Polygon using Sublinear Space. SoCG Sariel Har-Peled
2015	A*	`conf`	Space Exploration via Proximity Search. SoCG Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
2015	J	`jnl`	Sparse Approximation via Generating Point Sets. CoRR Avrim Blum, Sariel Har-Peled, Benjamin Raichel
2014	A	`conf`	Approximating the Maximum Overlap of Polygons under Translation. ESA Sariel Har-Peled, Subhro Roy
2014	J	`jnl`	Approximating the Maximum Overlap of Polygons under Translation. CoRR Sariel Har-Peled, Subhro Roy
2014	A	`conf`	Convex Hulls under Uncertainty. ESA Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang
2014	J	`jnl`	Convex Hulls under Uncertainty. CoRR Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang
2014	J	`jnl`	Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space. SIAM J. Comput. Sariel Har-Peled, Nirman Kumar
2014	J	`jnl`	Epsilon-Nets for Halfspaces Revisited. CoRR Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky
2014	J	`jnl`	From Proximity to Utility: A Voronoi Partition of Pareto Optima. CoRR Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel
2014	J	`jnl`	How to Walk Your Dog in the Mountains with No Magic Leash. CoRR Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
2014	J	`jnl`	Low Rank Matrix Approximation in Linear Time. CoRR Sariel Har-Peled
2014	J	`jnl`	Minimum Convex Partitions and Maximum Empty Polytopes. J. Comput. Geom. Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth
2014	J	`jnl`	Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. CoRR Sariel Har-Peled, Benjamin Raichel
2014	A*	`conf`	On the Complexity of Randomly Weighted Voronoi Diagrams. SoCG Sariel Har-Peled, Benjamin Raichel
2014	J	`jnl`	On the Complexity of Randomly Weighted Voronoi Diagrams. CoRR Sariel Har-Peled, Benjamin Raichel
2014	A*	`conf`	Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons. SoCG Sariel Har-Peled
2014	—	`conf`	Robust Proximity Search for Balls Using Sublinear Space. FSTTCS Sariel Har-Peled, Nirman Kumar
2014	J	`jnl`	Robust Proximity Search for Balls using Sublinear Space. CoRR Sariel Har-Peled, Nirman Kumar
2014	J	`jnl`	Separating a Voronoi Diagram. CoRR Vijay V. S. P. Bhattiprolu, Sariel Har-Peled
2014	J	`jnl`	Shortest Path in a Polygon using Sublinear Space. CoRR Sariel Har-Peled
2014	J	`jnl`	Space Exploration via Proximity Search. CoRR Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
2014	J	`jnl`	The fréchet distance revisited and extended. ACM Trans. Algorithms Sariel Har-Peled, Benjamin Raichel
2014	J	`jnl`	Union of Random Minkowski Sums and Network Vulnerability Analysis. Discret. Comput. Geom. Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2013	J	`jnl`	Approximate Nearest Neighbor Search for Low-Dimensional Queries. SIAM J. Comput. Sariel Har-Peled, Nirman Kumar
2013	J	`jnl`	Approximating Minimization Diagrams and Generalized Proximity Search CoRR Sariel Har-Peled, Nirman Kumar
2013	A*	`conf`	Approximating Minimization Diagrams and Generalized Proximity Search. FOCS Sariel Har-Peled, Nirman Kumar
2013	J	`jnl`	Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space. SIAM J. Comput. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
2013	A*	`conf`	Euclidean spanners in high dimensions. SODA Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos
2013	J	`jnl`	Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small CoRR Alina Ene, Sariel Har-Peled, Benjamin Raichel
2013	J	`jnl`	Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts. SIAM J. Comput. Anne Driemel, Sariel Har-Peled
2013	A*	`conf`	Nearest neighbor searching under uncertainty II. PODS Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang
2013	A*	`conf`	Net and prune: a linear time algorithm for euclidean distance problems. STOC Sariel Har-Peled, Benjamin Adam Raichel
2013	B	`conf`	On the Number of Edges of Fan-Crossing Free Graphs. ISAAC Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim
2013	J	`jnl`	On the Number of Edges of Fan-Crossing Free Graphs. CoRR Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim
2013	J	`jnl`	Peeling the Grid CoRR Sariel Har-Peled, Bernard Lidický
2013	J	`jnl`	Peeling the Grid. SIAM J. Discret. Math. Sariel Har-Peled, Bernard Lidický
2013	J	`jnl`	Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons. CoRR Sariel Har-Peled
2013	J	`jnl`	Union of Random Minkowski Sums and Network Vulnerability Analysis. CoRR Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2012	J	`jnl`	Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Theory Comput. Sariel Har-Peled, Piotr Indyk, Rajeev Motwani
2012	J	`jnl`	Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. Discret. Comput. Geom. Anne Driemel, Sariel Har-Peled, Carola Wenk
2012	J	`jnl`	Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. Discret. Comput. Geom. Timothy M. Chan, Sariel Har-Peled
2012	A*	`conf`	Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space. FOCS Sariel Har-Peled, Nirman Kumar
2012	J	`jnl`	Faster Approximate Distance Queries and Compact Routing in Sparse Graphs CoRR Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
2012	J	`jnl`	Fréchet Distance Revisited and Extended CoRR Sariel Har-Peled, Benjamin Raichel
2012	—	`conf`	Geometric packing under non-uniform constraints. SCG Alina Ene, Sariel Har-Peled, Benjamin Raichel
2012	—	`conf`	How to walk your dog in the mountains with no magic leash. SCG Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
2012	A*	`conf`	Jaywalking your dog: computing the Fréchet distance with shortcuts. SODA Anne Driemel, Sariel Har-Peled
2012	—	`conf`	Minimum Convex Partitions and Maximum Empty Polytopes. SWAT Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth
2012	J	`jnl`	New constructions of SSPDs and their applications. Comput. Geom. Mohammad Ali Abam, Sariel Har-Peled
2012	—	`conf`	On the expected complexity of voronoi diagrams on terrains. SCG Anne Driemel, Sariel Har-Peled, Benjamin Raichel
2012	J	`jnl`	On the set multicover problem in geometric settings. ACM Trans. Algorithms Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2012	J	`jnl`	Weighted geometric set cover problems revisited. J. Comput. Geom. Sariel Har-Peled, Mira Lee
2011	J	`jnl`	A Simple Proof of the Existence of a Planar Separator CoRR Sariel Har-Peled
2011	A*	`conf`	Approximate Nearest Neighbor Search for Low Dimensional Queries. SODA Sariel Har-Peled, Nirman Kumar
2011	A*	`conf`	Approximate distance queries and compact routing in sparse graphs. INFOCOM Rachit Agarwal, Philip Brighten Godfrey, Sariel Har-Peled
2011	J	`jnl`	Approximation Algorithms for Maximum Independent Set of Pseudo-Disks CoRR Timothy M. Chan, Sariel Har-Peled
2011	J	`jnl`	Computing the Fréchet Distance Between Folded Polygons CoRR Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk
2011	B	`conf`	Computing the Fréchet Distance between Folded Polygons. WADS Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk
2011	J	`jnl`	Down the Rabbit Hole: Robust Proximity Search in Sublinear Space CoRR Sariel Har-Peled, Nirman Kumar
2011	J	`jnl`	Geometric Packing under Non-uniform Constraints CoRR Alina Ene, Sariel Har-Peled, Benjamin Raichel
2011	J	`jnl`	Jaywalking your Dog - Computing the Fréchet Distance with Shortcuts CoRR Anne Driemel, Sariel Har-Peled
2011	J	`jnl`	Minimum Convex Partitions and Maximum Empty Polytopes CoRR Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth
2011	J	`jnl`	On the Expected Complexity of Random Convex Hulls CoRR Sariel Har-Peled
2011	J	`jnl`	On the Expected Complexity of Voronoi Diagrams on Terrains CoRR Anne Driemel, Sariel Har-Peled, Benjamin Raichel
2011	J	`jnl`	Relative ( Discret. Comput. Geom. Sariel Har-Peled, Micha Sharir
2011	—	`conf`	The frechet distance revisited and extended. SCG Sariel Har-Peled, Benjamin Raichel
2010	J	`jnl`	Approximate Nearest Neighbor Search for Low Dimensional Queries CoRR Sariel Har-Peled, Nirman Kumar
2010	J	`jnl`	Approximating the Fréchet Distance for Realistic Curves in Near Linear Time CoRR Anne Driemel, Sariel Har-Peled, Carola Wenk
2010	—	`conf`	Approximating the Fréchet distance for realistic curves in near linear time. SCG Anne Driemel, Sariel Har-Peled, Carola Wenk
2010	J	`jnl`	Hausdorff distance under translation for points and balls. ACM Trans. Algorithms Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang
2010	—	`conf`	New constructions of SSPDs and their applications. SCG Mohammad Ali Abam, Sariel Har-Peled
2009	J	`jnl`	Approximating Spanning Trees with Low Crossing Number CoRR Sariel Har-Peled
2009	—	`conf`	Approximation algorithms for maximum independent set of pseudo-disks. SCG Timothy M. Chan, Sariel Har-Peled
2009	J	`jnl`	Being Fat and Friendly is Not Enough CoRR Sariel Har-Peled
2009	J	`jnl`	Carnival of Samplings: Nets, Approximations, Relative and Sensitive CoRR Sariel Har-Peled
2009	J	`jnl`	Covering Many or Few Points with Unit Disks. Theory Comput. Syst. Mark de Berg, Sergio Cabello, Sariel Har-Peled
2009	J	`jnl`	Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space CoRR Amitabha Bagchi, Sariel Har-Peled, Achal Premi, Adit Madan
2009	J	`jnl`	On the Set Multi-Cover Problem in Geometric Settings CoRR Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2009	—	`conf`	On the set multi-cover problem in geometric settings. SCG Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2009	J	`jnl`	Randomized Incremental Construction of Compressed Quadtrees CoRR Sariel Har-Peled
2009	J	`jnl`	Relative (p,epsilon)-Approximations in Geometry CoRR Sariel Har-Peled, Micha Sharir
2008	J	`jnl`	On Approximating the Depth and Related Problems. SIAM J. Comput. Boris Aronov, Sariel Har-Peled
2008	J	`jnl`	Range Medians CoRR Sariel Har-Peled, S. Muthukrishnan
2008	A	`conf`	Range Medians. ESA Sariel Har-Peled, S. Muthukrishnan
2008	J	`jnl`	Robust Shape Fitting via Peeling and Grating Coresets. Discret. Comput. Geom. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
2008	J	`jnl`	The Euclidean Orienteering Problem Revisited. SIAM J. Comput. Ke Chen, Sariel Har-Peled
2007	—	`conf`	Embeddings of surfaces, curves, and moving points in euclidean space. SCG Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
2007	J	`jnl`	Finding a Guard that Sees Most and a Shop that Sells Most. Discret. Comput. Geom. Otfried Cheong, Alon Efrat, Sariel Har-Peled
2007	J	`jnl`	How to get close to the median shape. Comput. Geom. Sariel Har-Peled
2007	A*	`conf`	Maximum Margin Coresets for Active and Noise Tolerant Learning. IJCAI Sariel Har-Peled, Dan Roth, Dav Zimak
2007	—	`conf`	On approximate halfspace range counting and relative epsilon-approximations. SCG Boris Aronov, Sariel Har-Peled, Micha Sharir
2007	J	`jnl`	Smaller Coresets for k-Median and k-Means Clustering. Discret. Comput. Geom. Sariel Har-Peled, Akash Kushal
2006	—	`conf`	Coresets for Discrete Integration and Clustering. FSTTCS Sariel Har-Peled
2006	B	`conf`	Covering Many or Few Points with Unit Disks. WAOA Mark de Berg, Sergio Cabello, Sariel Har-Peled
2006	J	`jnl`	Fast Construction of Nets in Low-Dimensional Metrics and Their Applications. SIAM J. Comput. Sariel Har-Peled, Manor Mendel
2006	A	`conf`	Fréchet Distance for Curves, Revisited. ESA Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
2006	J	`jnl`	Guarding galleries and terrains. Inf. Process. Lett. Alon Efrat, Sariel Har-Peled
2006	—	`conf`	How to get close to the median shape. SCG Sariel Har-Peled
2006	J	`jnl`	On the Least Median Square Problem. Discret. Comput. Geom. Jeff Erickson, Sariel Har-Peled, David M. Mount
2006	A*	`conf`	Robust shape fitting via peeling and grating coresets. SODA Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
2006	—	`conf`	The orienteering problem in the plane revisited. SCG Ke Chen, Sariel Har-Peled
2005	J	`jnl`	A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions CoRR Sariel Har-Peled, Alper Üngör
2005	A	`conf`	A Uniform Convergence Bound for the Area Under the ROC Curve. AISTATS Shivani Agarwal, Sariel Har-Peled, Dan Roth
2005	—	`conf`	A time-optimal delaunay refinement algorithm in two dimensions. SCG Sariel Har-Peled, Alper Üngör
2005	J	`jnl`	Approximating Oper. Res. Lett. Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella
2005	C	`conf`	Approximation algorithm for the L1-fitting circle problem. EuroCG Sariel Har-Peled
2005	C	`conf`	Approximation algorithms for location problems in sensor networks. BROADNETS Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell
2005	J	`jnl`	Conflict-Free Coloring of Points and Simple Regions in the Plane. Discret. Comput. Geom. Sariel Har-Peled, Shakhar Smorodinsky
2005	—	`conf`	Dynamic Well-Separated Pair Decomposition Made Easy. CCCG John Fischer, Sariel Har-Peled
2005	J	`jnl`	Fast Algorithms for Computing the Smallest k-Enclosing Circle. Algorithmica Sariel Har-Peled, Soham Mazumdar
2005	—	`conf`	Fast construction of nets in low dimensional metrics, and their applications. SCG Sariel Har-Peled, Manor Mendel
2005	J	`jnl`	Generalization Bounds for the Area Under the ROC Curve. J. Mach. Learn. Res. Shivani Agarwal, Thore Graepel, Ralf Herbrich, Sariel Har-Peled, Dan Roth
2005	J	`jnl`	Geographic Quorum System Approximations. Algorithmica Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal
2005	J	`jnl`	How Fast Is the k-Means Method? Algorithmica Sariel Har-Peled, Bardia Sadri
2005	A*	`conf`	How fast is the k-means method? SODA Sariel Har-Peled, Bardia Sadri
2005	J	`jnl`	Near-Linear Time Approximation Algorithms for Curve Simplification. Algorithmica Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
2005	A*	`conf`	On approximating the depth and related problems. SODA Boris Aronov, Sariel Har-Peled
2005	J	`jnl`	On the Fermat-Weber center of a convex object. Comput. Geom. Paz Carmi, Sariel Har-Peled, Matthew J. Katz
2005	B	`conf`	Separability with Outliers. ISAAC Sariel Har-Peled, Vladlen Koltun
2005	—	`conf`	Smaller coresets for k-median and k-means clustering. SCG Sariel Har-Peled, Akash Kushal
2005	—	`conf`	Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. CCCG Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled
2004	J	`jnl`	Approximating extent measures of points. J. ACM Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
2004	J	`jnl`	Clustering Motion. Discret. Comput. Geom. Sariel Har-Peled
2004	J	`jnl`	Fast Construction of Nets in Low Dimensional Metrics, and Their Applications CoRR Sariel Har-Peled, Manor Mendel
2004	J	`jnl`	High-Dimensional Shape Fitting in Linear Time. Discret. Comput. Geom. Sariel Har-Peled, Kasturi R. Varadarajan
2004	—	`conf`	No, Coreset, No Cry. FSTTCS Sariel Har-Peled
2004	A*	`conf`	On coresets for k-means and k-median clustering. STOC Sariel Har-Peled, Soham Mazumdar
2004	A*	`conf`	On finding a guard that sees most and a shop that sells most. SODA Otfried Cheong, Alon Efrat, Sariel Har-Peled
2004	—	`conf`	On the least median square problem. SCG Jeff Erickson, Sariel Har-Peled, David M. Mount
2004	J	`jnl`	Optimally Cutting a Surface into a Disk. Discret. Comput. Geom. Jeff Erickson, Sariel Har-Peled
2004	J	`jnl`	Shape Fitting with Outliers. SIAM J. Comput. Sariel Har-Peled, Yusu Wang
2004	J	`jnl`	The One-Round Voronoi Game. Discret. Comput. Geom. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
2003	J	`jnl`	An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane. Int. J. Comput. Geom. Appl. Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled
2003	—	`conf`	Efficient algorithms for shared camera control. SCG Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg
2003	A	`conf`	Fast Algorithms for Computing the Smallest k-Enclosing Disc. ESA Sariel Har-Peled, Soham Mazumdar
2003	—	`conf`	Hausdorff distance under translation for points and balls. SCG Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang
2003	—	`conf`	High-dimensional shape fitting in linear time. SCG Sariel Har-Peled, Kasturi R. Varadarajan
2003	—	`conf`	On conflict-free coloring of points and simple regions in the plane. SCG Sariel Har-Peled, Shakhar Smorodinsky
2003	—	`conf`	Shape fitting with outliers. SCG Sariel Har-Peled, Yusu Wang
2003	J	`jnl`	When Crossings Count - Approximating the Minimum Spanning Tree CoRR Sariel Har-Peled, Piotr Indyk
2002	J	`jnl`	Algorithmic issues in modeling motion. ACM Comput. Surv. 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
2002	A*	`conf`	Approximate clustering via core-sets. STOC Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
2002	J	`jnl`	Computing Approximate Shortest Paths on Convex Polytopes. Algorithmica Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
2002	—	`conf`	Constraint Classification for Multiclass Classification and Ranking. NIPS Sariel Har-Peled, Dan Roth, Dav Zimak
2002	B	`conf`	Constraint Classification: A New Approach to Multiclass Classification. ALT Sariel Har-Peled, Dan Roth, Dav Zimak
2002	—	`conf`	Guarding Galleries and Terrains. IFIP TCS Alon Efrat, Sariel Har-Peled
2002	A	`conf`	Near-Linear Time Approximation Algorithms for Curve Simplification. ESA Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
2002	J	`jnl`	New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. Discret. Comput. Geom. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali
2002	A*	`conf`	On generalization bounds, projection profile, and margin distribution. ICML Ashutosh Garg, Sariel Har-Peled, Dan Roth
2002	J	`jnl`	Optimally cutting a surface into a disk CoRR Jeff Erickson, Sariel Har-Peled
2002	—	`conf`	Optimally cutting a surface into a disk. SCG Jeff Erickson, Sariel Har-Peled
2002	—	`conf`	Projective clustering in high dimensions using core-sets. SCG Sariel Har-Peled, Kasturi R. Varadarajan
2002	J	`jnl`	Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2002	A	`conf`	STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. ALENEX Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled
2002	—	`conf`	The one-round Voronoi game. SCG Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
2001	A*	`conf`	A Replacement for Voronoi Diagrams of Near Linear Size. FOCS Sariel Har-Peled
2001	—	`conf`	A practical approach for computing the diameter of a point set. SCG Sariel Har-Peled
2001	—	`conf`	An On-line Occlusio-Culling Algorithm for FastWalkthrough in Urban Areas. Eurographics (Short Presentations) Yusu Wang, Pankaj K. Agarwal, Sariel Har-Peled
2001	A*	`conf`	Approximate Shape Fitting via Linearization. FOCS Sariel Har-Peled, Kasturi R. Varadarajan
2001	A*	`conf`	Clustering Motion. FOCS Sariel Har-Peled
2001	J	`jnl`	Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. J. Algorithms Gill Barequet, Sariel Har-Peled
2001	A*	`conf`	Maintaining approximate extent measures of moving points. SODA Pankaj K. Agarwal, Sariel Har-Peled
2001	A*	`conf`	Morphing between polylines. SODA Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali
2001	J	`jnl`	Online Point Location in Planar Arrangements and Its Applications. Discret. Comput. Geom. Sariel Har-Peled, Micha Sharir
2001	A*	`conf`	Online point location in planar arrangements and its applications. SODA Sariel Har-Peled, Micha Sharir
2001	J	`jnl`	Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. Int. J. Comput. Geom. Appl. Gill Barequet, Sariel Har-Peled
2001	B	`conf`	Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2001	J	`jnl`	Routing with a clue. IEEE/ACM Trans. Netw. Yehuda Afek, Anat Bremler-Barr, Sariel Har-Peled
2000	J	`jnl`	Approximation Algorithms for Minimum-Width Annuli and Shells. Discret. Comput. Geom. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
2000	—	`conf`	Computing approximate shortest paths on convex polytopes. SCG Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
2000	—	`conf`	Computing the Penetration Depth of Two Convex Polytopes in 3D. SWAT Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
2000	J	`jnl`	Constructing Planar Cuttings in Theory and Practice. SIAM J. Comput. Sariel Har-Peled
2000	J	`jnl`	Penetration Depth of Two Convex Polytopes in 3D. Nord. J. Comput. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
2000	A*	`conf`	Sweeping simple polygons with a chain of guards. SODA Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali
2000	J	`jnl`	Taking a Walk in a Planar Arrangement. SIAM J. Comput. Sariel Har-Peled
2000	—	`conf`	When crossings count - approximating the minimum spanning tree. SCG Sariel Har-Peled, Piotr Indyk
1999	J	`jnl`	Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions. Discret. Comput. Geom. Sariel Har-Peled
1999	—	`conf`	Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. SCG Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
1999	J	`jnl`	Constructing Approximate Shortest Path Maps in Three Dimensions. SIAM J. Comput. Sariel Har-Peled
1999	A*	`conf`	Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. SODA Gill Barequet, Sariel Har-Peled
1999	J	`jnl`	Multicolor Combination Lemma. Comput. Geom. Sariel Har-Peled
1999	—	`conf`	On-Line Zone Construction in Arrangements of Lines in the Plane. WAE Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart
1999	A*	`conf`	Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. SODA Gill Barequet, Sariel Har-Peled
1999	A*	`conf`	Routing with a Clue. SIGCOMM Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
1999	A*	`conf`	Taking a Walk in a Planar Arrangement. FOCS Sariel Har-Peled
1998	—	`conf`	An Output Sensitive Algorithm for Discrete Convex Hulls. SCG Sariel Har-Peled
1998	J	`jnl`	An output sensitive algorithm for discrete convex hulls. Comput. Geom. Sariel Har-Peled
1998	—	`conf`	Constructing Approximate Shortest Path Maps in Three Dimensions. SCG Sariel Har-Peled
1998	—	`conf`	Constructing Cuttings in Theory and Practice. SCG Sariel Har-Peled
1998	—	`conf`	Fly Cheaply: On the Minimum Fuel-Consumption Problem. SCG Alon Efrat, Sariel Har-Peled
1998	—	`conf`	Results on SCG Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
1997	—	`conf`	Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions. SCG Sariel Har-Peled
1997	J	`jnl`	Approximating shortest paths on a convex polytope in three dimensions. J. ACM Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
1996	—	`conf`	Approximating Shortest Paths on a Convex Polytope in Three Dimensions. SCG Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
1995	—	`conf`	The complexity of a single face of a minkowski sum. CCCG Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink