| 2026 | ESA | On Small Pair Decompositions for Point Sets. | Kevin Buchin, Jacobus Conradi, Sariel Har-Peled, Antonia Kalb, Abhiruk Lahiri, Lukas Pltz, Carolin Rehs, Sampson Wong |
| 2026 | ESA | The Prophet and the Voronoi Diagram. | Sariel Har-Peled |
| 2025 | STACS | Approximating Densest Subgraph in Geometric Intersection Graphs. | Sariel Har-Peled, Saladi Rahul |
| 2024 | ICALP | Oracle-Augmented Prophet Inequalities. | Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos |
| 2024 | SODA | Fast Approximation Algorithms for Piercing Boxes by Points. | Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos |
| 2023 | SODA | On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. | Timothy M. Chan, Sariel Har-Peled |
| 2023 | SODA | Halving by a Thousand Cuts or Punctures. | Sariel Har-Peled, Da Wei Zheng |
| 2021 | ESA | Improved Approximation Algorithms for Tverberg Partitions. | Sariel Har-Peled, Timothy Zhou |
| 2020 | ESA | Sometimes Reliable Spanners of Almost Linear Size. | Kevin Buchin, Sariel Har-Peled, Dniel Olh |
| 2020 | ICALP | Active Learning a Convex Body in Low Dimensions. | Sariel Har-Peled, Mitchell Jones, Saladi Rahul |
| 2020 | SODA | Fast LP-based Approximations for Geometric Packing and Covering Problems. | Chandra Chekuri, Sariel Har-Peled, Kent Quanrud |
| 2018 | ALENEX | Grid peeling and the affine curve-shortening flow. | David Eppstein, Sariel Har-Peled, Gabriel Nivasch |
| 2018 | ICALP | Approximate Sparse Linear Regression. | Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi |
| 2018 | ISAAC | Stabbing Pairwise Intersecting Disks by Five Points. | Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert |
| 2018 | SODA | On Separating Points by Lines. | Sariel Har-Peled, Mitchell Jones |
| 2017 | SODA | Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. | Sariel Har-Peled, Sepideh Mahabadi |
| 2016 | PODS | Towards Tight Bounds for the Streaming Set Cover Problem. | Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian |
| 2016 | SODA | Sparse Approximation via Generating Point Sets. | Avrim Blum, Sariel Har-Peled, Benjamin Raichel |
| 2016 | SODA | Approximating the | Sariel Har-Peled, Haim Kaplan, Micha Sharir |
| 2015 | ESA | Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. | Sariel Har-Peled, Kent Quanrud |
| 2014 | ESA | Convex Hulls under Uncertainty. | Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang |
| 2014 | ESA | Approximating the Maximum Overlap of Polygons under Translation. | Sariel Har-Peled, Subhro Roy |
| 2013 | FOCS | Approximating Minimization Diagrams and Generalized Proximity Search. | Sariel Har-Peled, Nirman Kumar |
| 2013 | ISAAC | On the Number of Edges of Fan-Crossing Free Graphs. | Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim |
| 2013 | PODS | Nearest neighbor searching under uncertainty II. | Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang |
| 2013 | SODA | Euclidean spanners in high dimensions. | Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos |
| 2013 | STOC | Net and prune: a linear time algorithm for euclidean distance problems. | Sariel Har-Peled, Benjamin Adam Raichel |
| 2012 | FOCS | Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space. | Sariel Har-Peled, Nirman Kumar |
| 2012 | SODA | Jaywalking your dog: computing the Frchet distance with shortcuts. | Anne Driemel, Sariel Har-Peled |
| 2011 | INFOCOM | Approximate distance queries and compact routing in sparse graphs. | Rachit Agarwal, Philip Brighten Godfrey, Sariel Har-Peled |
| 2011 | SODA | Approximate Nearest Neighbor Search for Low Dimensional Queries. | Sariel Har-Peled, Nirman Kumar |
| 2011 | WADS | Computing the Frchet Distance between Folded Polygons. | Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk |
| 2008 | ESA | Range Medians. | Sariel Har-Peled, S. Muthukrishnan |
| 2007 | IJCAI | Maximum Margin Coresets for Active and Noise Tolerant Learning. | Sariel Har-Peled, Dan Roth, Dav Zimak |
| 2006 | ESA | Frchet Distance for Curves, Revisited. | Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk |
| 2006 | SODA | Robust shape fitting via peeling and grating coresets. | Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu |
| 2006 | WAOA | Covering Many or Few Points with Unit Disks. | Mark de Berg, Sergio Cabello, Sariel Har-Peled |
| 2005 | AISTATS | A Uniform Convergence Bound for the Area Under the ROC Curve. | Shivani Agarwal, Sariel Har-Peled, Dan Roth |
| 2005 | Broadnets | Approximation algorithms for location problems in sensor networks. | Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell |
| 2005 | ISAAC | Separability with Outliers. | Sariel Har-Peled, Vladlen Koltun |
| 2005 | SODA | On approximating the depth and related problems. | Boris Aronov, Sariel Har-Peled |
| 2005 | SODA | How fast is the k-means method? | Sariel Har-Peled, Bardia Sadri |
| 2004 | SODA | On finding a guard that sees most and a shop that sells most. | Otfried Cheong, Alon Efrat, Sariel Har-Peled |
| 2004 | STOC | On coresets for k-means and k-median clustering. | Sariel Har-Peled, Soham Mazumdar |
| 2003 | ESA | Fast Algorithms for Computing the Smallest k-Enclosing Disc. | Sariel Har-Peled, Soham Mazumdar |
| 2002 | ALENEX | STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. | Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled |
| 2002 | ALT | Constraint Classification: A New Approach to Multiclass Classification. | Sariel Har-Peled, Dan Roth, Dav Zimak |
| 2002 | ESA | Near-Linear Time Approximation Algorithms for Curve Simplification. | Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang |
| 2002 | ICML | On generalization bounds, projection profile, and margin distribution. | Ashutosh Garg, Sariel Har-Peled, Dan Roth |
| 2002 | STOC | Approximate clustering via core-sets. | Mihai Badoiu, Sariel Har-Peled, Piotr Indyk |
| 2001 | FOCS | Clustering Motion. | Sariel Har-Peled |
| 2001 | FOCS | A Replacement for Voronoi Diagrams of Near Linear Size. | Sariel Har-Peled |
| 2001 | FOCS | Approximate Shape Fitting via Linearization. | Sariel Har-Peled, Kasturi R. Varadarajan |
| 2001 | SODA | Maintaining approximate extent measures of moving points. | Pankaj K. Agarwal, Sariel Har-Peled |
| 2001 | SODA | Morphing between polylines. | Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali |
| 2001 | SODA | Online point location in planar arrangements and its applications. | Sariel Har-Peled, Micha Sharir |
| 2001 | WADS | 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 |
| 2000 | SODA | 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 |
| 1999 | FOCS | Taking a Walk in a Planar Arrangement. | Sariel Har-Peled |
| 1999 | SODA | Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. | Gill Barequet, Sariel Har-Peled |
| 1999 | SODA | Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. | Gill Barequet, Sariel Har-Peled |
| 1999 | SIGCOMM | Routing with a Clue. | Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled |