Sariel Har-Peled

According to our database, Sariel Har-Peled authored at least 210 papers between 1995 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

The Fréchet Distance Unleashed: Approximating a Dog with a Frog.

Sariel Har-Peled, Benjamin Raichel, Eliot Wong Robson

CoRR, 2024

Dependable Spanners via Unreliable Edges.

Sariel Har-Peled, Maria C. Lusardi

CoRR, 2024

SPITE: Simple Polyhedral Intersection Techniques for modified Environments.

Stav Ashur, Maria C. Lusardi, Marta Markowicz, James Motes, Marco Morales, Sariel Har-Peled, Nancy M. Amato

CoRR, 2024

Approximating Densest Subgraph in Geometric Intersection Graphs.

Sariel Har-Peled, Saladi Rahul

CoRR, 2024

No-Dimensional Tverberg Partitions Revisited.

Sariel Har-Peled, Eliot Wong Robson

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Local Spanners Revisited.

Stav Ashur, Sariel Har-Peled

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Revisiting Random Points: Combinatorial Complexity and Algorithms.

Sariel Har-Peled, Elfarouk Harb

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Fast Approximation Algorithms for Piercing Boxes by Points.

Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Oracle-Augmented Prophet Inequalities.

Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Near Optimal Locality Sensitive Orderings in Euclidean Space.

Zhimeng Gao, Sariel Har-Peled

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

A Note on Stabbing Convex Bodies with Points, Lines, and Flats.

Sariel Har-Peled, Mitchell Jones

Discret. Comput. Geom., June, 2023

Few Cuts Meet Many Point Sets.

Sariel Har-Peled, Mitchell Jones

Algorithmica, April, 2023

Reliable Spanners for Metric Spaces.

Sariel Har-Peled, Manor Mendel, Dániel Oláh

ACM Trans. Algorithms, January, 2023

On the Rectangles Induced by Points.

Stav Ashur, Sariel Har-Peled

CoRR, 2023

Almost Optimal Locality Sensitive Orderings in Euclidean Space.

Zhimeng Gao, Sariel Har-Peled

CoRR, 2023

Approximately: Independence Implies Vertex Cover.

Sariel Har-Peled

CoRR, 2023

On the Width of the Regular n-Simplex.

Sariel Har-Peled, Eliot Wong Robson

CoRR, 2023

Halving by a Thousand Cuts or Punctures.

Sariel Har-Peled, Da Wei Zheng

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings.

Timothy M. Chan, Sariel Har-Peled

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Computing Instance-Optimal Kernels in Two Dimensions.

Pankaj K. Agarwal, Sariel Har-Peled

Proceedings of the 39th International Symposium on Computational Geometry, 2023

On the Budgeted Hausdorff Distance Problem.

Sariel Har-Peled, Benjamin Raichel

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All?

Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri

ACM Trans. Database Syst., 2022

Optimal Algorithms for Geometric Centers and Depth.

Timothy M. Chan, Sariel Har-Peled, Mitchell Jones

SIAM J. Comput., 2022

Sometimes reliable spanners of almost linear size.

Kevin Buchin, Sariel Har-Peled, Dániel Oláh

J. Comput. Geom., 2022

The Maximum-Level Vertex in an Arrangement of Lines.

Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir

Discret. Comput. Geom., 2022

Computing Optimal Kernels in Two Dimensions.

Pankaj K. Agarwal, Sariel Har-Peled

CoRR, 2022

Sparsifying Disk Intersection Graphs for Reliable Connectivity.

Sariel Har-Peled, Eliot Wong Robson

CoRR, 2022

Sampling near neighbors in search for fairness.

Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri

Commun. ACM, 2022

Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs.

Sariel Har-Peled, Everett Yang

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Journey to the Center of the Point Set.

Sariel Har-Peled, Mitchell Jones

ACM Trans. Algorithms, 2021

Fair near neighbor search via sampling.

Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri

SIGMOD Rec., 2021

Stabbing pairwise intersecting disks by five points.

Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert

Discret. Math., 2021

Smallest k-Enclosing Rectangle Revisited.

Timothy M. Chan, Sariel Har-Peled

Discret. Comput. Geom., 2021

On the Number of Incidences when Avoiding the Klan.

Sariel Har-Peled

CoRR, 2021

On Competitive Permutations for Set Cover by Intervals.

Sariel Har-Peled, Jiaqi Cheng

CoRR, 2021

On Clusters that are Separated but Large.

Sariel Har-Peled, Joseph Rogge

CoRR, 2021

How Packed Is It, Really?

Sariel Har-Peled, Timothy Zhou

CoRR, 2021

Active-Learning a Convex Body in Low Dimensions.

Sariel Har-Peled, Mitchell Jones, Saladi Rahul

Algorithmica, 2021

Improved Approximation Algorithms for Tverberg Partitions.

Sariel Har-Peled, Timothy Zhou

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Stabbing Convex Bodies with Lines and Flats.

Sariel Har-Peled, Mitchell Jones

Proceedings of the 37th International Symposium on Computational Geometry, 2021

On Undecided LP, Clustering and Active Learning.

Stav Ashur, Sariel Har-Peled

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Edge Estimation with Independent Set Oracles.

Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha

ACM Trans. Algorithms, 2020

On Locality-Sensitive Orderings and Their Applications.

Timothy M. Chan, Sariel Har-Peled, Mitchell Jones

SIAM J. Comput., 2020

Approximate greedy clustering and distance selection for graph metrics.

David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos

J. Comput. Geom., 2020

Grid Peeling and the Affine Curve-Shortening Flow.

David Eppstein, Sariel Har-Peled, Gabriel Nivasch

Exp. Math., 2020

On Separating Points by Lines.

Sariel Har-Peled, Mitchell Jones

Discret. Comput. Geom., 2020

Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location.

Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir

Discret. Comput. Geom., 2020

A Spanner for the Day After.

Kevin Buchin, Sariel Har-Peled, Dániel Oláh

Discret. Comput. Geom., 2020

Shortest Secure Path in a Voronoi Diagram.

Sariel Har-Peled, Rajgopal Varadharajan

CoRR, 2020

Reliable Spanners for Metric Spaces.

Sariel Har-Peled, Dániel Oláh

CoRR, 2020

Submodular Clustering in Low Dimensions.

Arturs Backurs, Sariel Har-Peled

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Fast LP-based Approximations for Geometric Packing and Covering Problems.

Chandra Chekuri, Sariel Har-Peled, Kent Quanrud

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Fast Algorithms for Geometric Consensuses.

Sariel Har-Peled, Mitchell Jones

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Some Geometric Applications of Anti-Chains.

Sariel Har-Peled, Mitchell Jones

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Sparse Approximation via Generating Point Sets.

Avrim Blum, Sariel Har-Peled, Benjamin Raichel

ACM Trans. Algorithms, 2019

Approximation Schemes for Independent Set and Sparse Subsets of Polygons.

Anna Adamaszek, Sariel Har-Peled, Andreas Wiese

J. ACM, 2019

Covering Polygons by Min-Area Convex Polygons.

Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu

CoRR, 2019

Proof of Dudley's Convex Approximation.

Sariel Har-Peled, Mitchell Jones

CoRR, 2019

Near Neighbor: Who is the Fairest of Them All?

Sariel Har-Peled, Sepideh Mahabadi

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Coresets for $k$-Means and $k$-Median Clustering and their Applications.

Sariel Har-Peled, Soham Mazumdar

CoRR, 2018

Two (Known) Results About Graphs with No Short Odd Cycles.

Sariel Har-Peled, Saladi Rahul

CoRR, 2018

Separators for Planar Graphs that are Almost Trees.

Linda Cai, Sariel Har-Peled, Simiao Ye

CoRR, 2018

Robust Proximity Search for Balls Using Sublinear Space.

Sariel Har-Peled, Nirman Kumar

Algorithmica, 2018

Approximate Sparse Linear Regression.

Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs.

Sariel Har-Peled, Kent Quanrud

SIAM J. Comput., 2017

Geometric Packing under Nonuniform Constraints.

Alina Ene, Sariel Har-Peled, Benjamin Raichel

SIAM J. Comput., 2017

How to Net a Convex Shape.

Sariel Har-Peled, Mitchell Jones

CoRR, 2017

A Simple Algorithm for Computing a Cycle Separator.

Sariel Har-Peled, Amir Nayyeri

CoRR, 2017

LSH on the Hypercube Revisited.

Sariel Har-Peled, Sepideh Mahabadi

CoRR, 2017

Approximating the Maximum Overlap of Polygons under Translation.

Sariel Har-Peled, Subhro Roy

Algorithmica, 2017

Convex Hulls Under Uncertainty.

Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang

Algorithmica, 2017

Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search.

Sariel Har-Peled, Sepideh Mahabadi

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

On the Expected Complexity of Voronoi Diagrams on Terrains.

Anne Driemel, Sariel Har-Peled, Benjamin Raichel

ACM Trans. Algorithms, 2016

Nearest-Neighbor Searching Under Uncertainty II.

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang

ACM Trans. Algorithms, 2016

Shortest path in a polygon using sublinear space.

Sariel Har-Peled

J. Comput. Geom., 2016

How to Walk Your Dog in the Mountains with No Magic Leash.

Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos

Discret. Comput. Geom., 2016

Space Exploration via Proximity Search.

Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel

Discret. Comput. Geom., 2016

From Proximity to Utility: A Voronoi Partition of Pareto Optima.

Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel

Discret. Comput. Geom., 2016

Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs.

Sariel Har-Peled, Kent Quanrud

CoRR, 2016

Approximating the $k$-Level in Three-Dimensional Plane Arrangements.

Sariel Har-Peled, Haim Kaplan, Micha Sharir

CoRR, 2016

Computing the k Nearest-Neighbors for all Vertices via Dijkstra.

Sariel Har-Peled

CoRR, 2016

Approximating the <i>k</i>-Level in Three-Dimensional Plane Arrangements.

Sariel Har-Peled, Haim Kaplan, Micha Sharir

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Towards Tight Bounds for the Streaming Set Cover Problem.

Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Separating a Voronoi Diagram via Local Search.

Vijay V. S. P. Bhattiprolu, Sariel Har-Peled

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Approximating Minimization Diagrams and Generalized Proximity Search.

Sariel Har-Peled, Nirman Kumar

SIAM J. Comput., 2015

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems.

Sariel Har-Peled, Benjamin Raichel

J. ACM, 2015

On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams.

Sariel Har-Peled, Benjamin Raichel

Discret. Comput. Geom., 2015

Approximation Algorithms for Low-Density Graphs.

Sariel Har-Peled, Kent Quanrud

CoRR, 2015

A Simple Algorithm for Maximum Margin Classification, Revisited.

Sariel Har-Peled

CoRR, 2015

On the Number of Edges of Fan-Crossing Free Graphs.

Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim

Algorithmica, 2015

2014

The fréchet distance revisited and extended.

Sariel Har-Peled, Benjamin Raichel

ACM Trans. Algorithms, 2014

Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space.

Sariel Har-Peled, Nirman Kumar

SIAM J. Comput., 2014

Minimum Convex Partitions and Maximum Empty Polytopes.

Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth

J. Comput. Geom., 2014

Union of Random Minkowski Sums and Network Vulnerability Analysis.

Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir

Discret. Comput. Geom., 2014

Epsilon-Nets for Halfspaces Revisited.

Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky

CoRR, 2014

Low Rank Matrix Approximation in Linear Time.

Sariel Har-Peled

CoRR, 2014

Separating a Voronoi Diagram.

Vijay V. S. P. Bhattiprolu, Sariel Har-Peled

CoRR, 2014

On the Complexity of Randomly Weighted Voronoi Diagrams.

Sariel Har-Peled, Benjamin Raichel

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons.

Sariel Har-Peled

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Peeling the Grid.

Sariel Har-Peled, Bernard Lidický

SIAM J. Discret. Math., 2013

Approximate Nearest Neighbor Search for Low-Dimensional Queries.

Sariel Har-Peled, Nirman Kumar

SIAM J. Comput., 2013

Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts.

Anne Driemel, Sariel Har-Peled

SIAM J. Comput., 2013

Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space.

Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu

SIAM J. Comput., 2013

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small

Alina Ene, Sariel Har-Peled, Benjamin Raichel

CoRR, 2013

Euclidean spanners in high dimensions.

Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality.

Sariel Har-Peled, Piotr Indyk, Rajeev Motwani

Theory Comput., 2012

On the set multicover problem in geometric settings.

Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled

ACM Trans. Algorithms, 2012

Weighted geometric set cover problems revisited.

Sariel Har-Peled, Mira Lee

J. Comput. Geom., 2012

Approximating the Fréchet Distance for Realistic Curves in Near Linear Time.

Anne Driemel, Sariel Har-Peled, Carola Wenk

Discret. Comput. Geom., 2012

Approximation Algorithms for Maximum Independent Set of Pseudo-Disks.

Timothy M. Chan, Sariel Har-Peled

Discret. Comput. Geom., 2012

Faster Approximate Distance Queries and Compact Routing in Sparse Graphs

Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled

CoRR, 2012

New constructions of SSPDs and their applications.

Mohammad Ali Abam, Sariel Har-Peled

Comput. Geom., 2012

Geometric packing under non-uniform constraints.

Alina Ene, Sariel Har-Peled, Benjamin Raichel

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Relative (<i>p</i>, <i>ε</i>)-Approximations in Geometry.

Sariel Har-Peled, Micha Sharir

Discret. Comput. Geom., 2011

On the Expected Complexity of Random Convex Hulls

Sariel Har-Peled

CoRR, 2011

Down the Rabbit Hole: Robust Proximity Search in Sublinear Space

Sariel Har-Peled, Nirman Kumar

CoRR, 2011

A Simple Proof of the Existence of a Planar Separator

Sariel Har-Peled

CoRR, 2011

Computing the Fréchet Distance between Folded Polygons.

Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Approximate distance queries and compact routing in sparse graphs.

Rachit Agarwal, Philip Brighten Godfrey, Sariel Har-Peled

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Hausdorff distance under translation for points and balls.

Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang

ACM Trans. Algorithms, 2010

2009

Covering Many or Few Points with Unit Disks.

Mark de Berg, Sergio Cabello, Sariel Har-Peled

Theory Comput. Syst., 2009

Relative (p,epsilon)-Approximations in Geometry

Sariel Har-Peled, Micha Sharir

CoRR, 2009

Carnival of Samplings: Nets, Approximations, Relative and Sensitive

Sariel Har-Peled

CoRR, 2009

Being Fat and Friendly is Not Enough

Sariel Har-Peled

CoRR, 2009

Approximating Spanning Trees with Low Crossing Number

Sariel Har-Peled

CoRR, 2009

Randomized Incremental Construction of Compressed Quadtrees

Sariel Har-Peled

CoRR, 2009

Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space

Amitabha Bagchi, Sariel Har-Peled, Achal Premi, Adit Madan

CoRR, 2009

On the set multi-cover problem in geometric settings.

Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

The Euclidean Orienteering Problem Revisited.

Ke Chen, Sariel Har-Peled

SIAM J. Comput., 2008

On Approximating the Depth and Related Problems.

Boris Aronov, Sariel Har-Peled

SIAM J. Comput., 2008

Robust Shape Fitting via Peeling and Grating Coresets.

Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu

Discret. Comput. Geom., 2008

Range Medians.

Sariel Har-Peled, S. Muthukrishnan

Proceedings of the Algorithms, 2008

2007

Smaller Coresets for k-Median and k-Means Clustering.

Sariel Har-Peled, Akash Kushal

Discret. Comput. Geom., 2007

Finding a Guard that Sees Most and a Shop that Sells Most.

Otfried Cheong, Alon Efrat, Sariel Har-Peled

Discret. Comput. Geom., 2007

How to get close to the median shape.

Sariel Har-Peled

Comput. Geom., 2007

Maximum Margin Coresets for Active and Noise Tolerant Learning.

Sariel Har-Peled, Dan Roth, Dav Zimak

Proceedings of the IJCAI 2007, 2007

On approximate halfspace range counting and relative epsilon-approximations.

Boris Aronov, Sariel Har-Peled, Micha Sharir

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Fast Construction of Nets in Low-Dimensional Metrics and Their Applications.

Sariel Har-Peled, Manor Mendel

SIAM J. Comput., 2006

Guarding galleries and terrains.

Alon Efrat, Sariel Har-Peled

Inf. Process. Lett., 2006

On the Least Median Square Problem.

Jeff Erickson, Sariel Har-Peled, David M. Mount

Discret. Comput. Geom., 2006

Coresets for Discrete Integration and Clustering.

Sariel Har-Peled

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Fréchet Distance for Curves, Revisited.

Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk

Proceedings of the Algorithms, 2006

The orienteering problem in the plane revisited.

Ke Chen, Sariel Har-Peled

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Approximating <i>k</i>-hop minimum-spanning trees.

Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella

Oper. Res. Lett., 2005

Generalization Bounds for the Area Under the ROC Curve.

Shivani Agarwal, Thore Graepel, Ralf Herbrich, Sariel Har-Peled, Dan Roth

J. Mach. Learn. Res., 2005

Conflict-Free Coloring of Points and Simple Regions in the Plane.

Sariel Har-Peled, Shakhar Smorodinsky

Discret. Comput. Geom., 2005

On the Fermat-Weber center of a convex object.

Paz Carmi, Sariel Har-Peled, Matthew J. Katz

Comput. Geom., 2005

How Fast Is the k-Means Method?

Sariel Har-Peled, Bardia Sadri

Algorithmica, 2005

Fast Algorithms for Computing the Smallest k-Enclosing Circle.

Sariel Har-Peled, Soham Mazumdar

Algorithmica, 2005

Geographic Quorum System Approximations.

Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal

Algorithmica, 2005

Near-Linear Time Approximation Algorithms for Curve Simplification.

Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang

Algorithmica, 2005

Separability with Outliers.

Sariel Har-Peled, Vladlen Koltun

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Approximation algorithm for the L1-fitting circle problem.

Sariel Har-Peled

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

A time-optimal delaunay refinement algorithm in two dimensions.

Sariel Har-Peled, Alper Üngör

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Dynamic Well-Separated Pair Decomposition Made Easy.

John Fischer, Sariel Har-Peled

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points.

Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Approximation algorithms for location problems in sensor networks.

Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell

Proceedings of the 2nd International Conference on Broadband Networks (BROADNETS 2005), 2005

A Uniform Convergence Bound for the Area Under the ROC Curve.

Shivani Agarwal, Sariel Har-Peled, Dan Roth

Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, 2005

2004

Shape Fitting with Outliers.

Sariel Har-Peled, Yusu Wang

SIAM J. Comput., 2004

Approximating extent measures of points.

Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan

J. ACM, 2004

High-Dimensional Shape Fitting in Linear Time.

Sariel Har-Peled, Kasturi R. Varadarajan

Discret. Comput. Geom., 2004

Clustering Motion.

Sariel Har-Peled

Discret. Comput. Geom., 2004

Optimally Cutting a Surface into a Disk.

Jeff Erickson, Sariel Har-Peled

Discret. Comput. Geom., 2004

The One-Round Voronoi Game.

Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek

Discret. Comput. Geom., 2004

On coresets for k-means and k-median clustering.

Sariel Har-Peled, Soham Mazumdar

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

No, Coreset, No Cry.

Sariel Har-Peled

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane.

Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled

Int. J. Comput. Geom. Appl., 2003

Fast Algorithms for Computing the Smallest k-Enclosing Disc.

Sariel Har-Peled, Soham Mazumdar

Proceedings of the Algorithms, 2003

Efficient algorithms for shared camera control.

Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping.

Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali

Discret. Comput. Geom., 2002

Algorithmic issues in modeling motion.

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

ACM Comput. Surv., 2002

Reporting intersecting pairs of convex polytopes in two and three dimensions.

Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold

Comput. Geom., 2002

Computing Approximate Shortest Paths on Convex Polytopes.

Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia

Algorithmica, 2002

Approximate clustering via core-sets.

Mihai Badoiu, Sariel Har-Peled, Piotr Indyk

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Constraint Classification for Multiclass Classification and Ranking.

Sariel Har-Peled, Dan Roth, Dav Zimak

Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002

On generalization bounds, projection profile, and margin distribution.

Ashutosh Garg, Sariel Har-Peled, Dan Roth

Proceedings of the Machine Learning, 2002

Projective clustering in high dimensions using core-sets.

Sariel Har-Peled, Kasturi R. Varadarajan

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

Constraint Classification: A New Approach to Multiclass Classification.

Sariel Har-Peled, Dan Roth, Dav Zimak

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects.

Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled

Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001

Routing with a clue.

Yehuda Afek, Anat Bremler-Barr, Sariel Har-Peled

IEEE/ACM Trans. Netw., 2001

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions.

Gill Barequet, Sariel Har-Peled

J. Algorithms, 2001

Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard.

Gill Barequet, Sariel Har-Peled

Int. J. Comput. Geom. Appl., 2001

Online Point Location in Planar Arrangements and Its Applications.

Sariel Har-Peled, Micha Sharir

Discret. Comput. Geom., 2001

Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.

Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Morphing between polylines.

Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Maintaining approximate extent measures of moving points.

Pankaj K. Agarwal, Sariel Har-Peled

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximate Shape Fitting via Linearization.

Sariel Har-Peled, Kasturi R. Varadarajan

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

A Replacement for Voronoi Diagrams of Near Linear Size.

Sariel Har-Peled

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

An On-line Occlusio-Culling Algorithm for FastWalkthrough in Urban Areas.

Yusu Wang, Pankaj K. Agarwal, Sariel Har-Peled

Proceedings of the 22nd Annual Conference of the European Association for Computer Graphics, 2001

A practical approach for computing the diameter of a point set.

Sariel Har-Peled

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Taking a Walk in a Planar Arrangement.

Sariel Har-Peled

SIAM J. Comput., 2000

Constructing Planar Cuttings in Theory and Practice.

Sariel Har-Peled

SIAM J. Comput., 2000

Penetration Depth of Two Convex Polytopes in 3D.

Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir

Nord. J. Comput., 2000

Approximation Algorithms for Minimum-Width Annuli and Shells.

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir

Discret. Comput. Geom., 2000

Computing the Penetration Depth of Two Convex Polytopes in 3D.

Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir

Proceedings of the Algorithm Theory, 2000

Sweeping simple polygons with a chain of guards.

Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

When crossings count - approximating the minimum spanning tree.

Sariel Har-Peled, Piotr Indyk

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Constructing Approximate Shortest Path Maps in Three Dimensions.

Sariel Har-Peled

SIAM J. Comput., 1999

Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions.

Sariel Har-Peled

Discret. Comput. Geom., 1999

Multicolor Combination Lemma.

Sariel Har-Peled

Comput. Geom., 1999

On-Line Zone Construction in Arrangements of Lines in the Plane.

Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart

Proceedings of the Algorithm Engineering, 1999

Approximation and Exact Algorithms for Minimum-Width Annuli and Shells.

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

An output sensitive algorithm for discrete convex hulls.

Sariel Har-Peled

Comput. Geom., 1998

Constructing Cuttings in Theory and Practice.

Sariel Har-Peled

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Fly Cheaply: On the Minimum Fuel-Consumption Problem.

Alon Efrat, Sariel Har-Peled

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Results on <i>k</i>-Sets and <i>j</i>-Facets via Continuous Motion.

Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Approximating shortest paths on a convex polytope in three dimensions.

Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan

J. ACM, 1997

Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions.

Sariel Har-Peled

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Approximating Shortest Paths on a Convex Polytope in Three Dimensions.

Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

The complexity of a single face of a minkowski sum.

Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995