Geometric packing under non-uniform constraints. - Alina Ene; Sariel Har-Peled; Benjamin Raichel (SCG, 2012)

Fault Tolerant Clustering Revisited. - Nirman Kumar; Benjamin Raichel (CCCG, 2013)

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small - Alina Ene; Sariel Har-Peled; Benjamin Raichel (CoRR, 2013)

On the Complexity of Randomly Weighted Voronoi Diagrams. - Sariel Har-Peled; Benjamin Raichel (SoCG, 2014)

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm. - Benjamin Raichel; C. Seshadhri 001 (CoRR, 2014)

The fréchet distance revisited and extended. - Sariel Har-Peled; Benjamin Raichel (ACM Trans. Algorithms, 2014)

Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line. - Amir Nayyeri; Benjamin Raichel (FOCS, 2015)

On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams. - Sariel Har-Peled; Benjamin Raichel (Discret. Comput. Geom., 2015)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. - Sariel Har-Peled; Benjamin Raichel (J. ACM, 2015)

In pursuit of linear complexity in discrete and computational geometry - Benjamin Raichel (2015)

Most Likely Voronoi Diagrams in Higher Dimensions. - Nirman Kumar; Benjamin Raichel; Subhash Suri; Kevin Verbeek (FSTTCS, 2016)

From Proximity to Utility: A Voronoi Partition of Pareto Optima. - Hsien-Chih Chang; Sariel Har-Peled; Benjamin Raichel (Discret. Comput. Geom., 2016)

Space Exploration via Proximity Search. - Sariel Har-Peled; Nirman Kumar; David M. Mount; Benjamin Raichel (Discret. Comput. Geom., 2016)

On the Expected Complexity of Voronoi Diagrams on Terrains. - Anne Driemel; Sariel Har-Peled; Benjamin Raichel (ACM Trans. Algorithms, 2016)

Sparse Approximate Conic Hulls. - Greg Van Buskirk; Benjamin Raichel; Nicholas Ruozzi (NIPS, 2017)

A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs. - Amir Nayyeri; Benjamin Raichel (SODA, 2017)

Avoiding the Global Sort: A Faster Contour Tree Algorithm. - Benjamin Raichel; C. Seshadhri 001 (Discret. Comput. Geom., 2017)

Geometric Packing under Nonuniform Constraints. - Alina Ene; Sariel Har-Peled; Benjamin Raichel (SIAM J. Comput., 2017)

Metric Violation Distance: Revisited and Extended. - Chenglin Fan; Benjamin Raichel; Gregory Van Buskirk (CoRR, 2018)

Approximating Distance Measures for the Skyline. - Nirman Kumar; Benjamin Raichel; Stavros Sintos; Gregory Van Buskirk (ICDT, 2019)

Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees. - Amir Nayyeri; Benjamin Raichel (SODA, 2019)

Sparse Approximation via Generating Point Sets. - Avrim Blum; Sariel Har-Peled; Benjamin Raichel (ACM Trans. Algorithms, 2019)

Convex Hull Complexity of Uncertain Points. - Hongyao Huang; Benjamin Raichel (CCCG, 2020)

Generalized Metric Repair on Graphs. - Chenglin Fan; Anna C. Gilbert; Benjamin Raichel; Rishi Sonthalia; Gregory Van Buskirk (SWAT, 2020)

Fast and Exact Convex Hull Simplification. - Georgiy Klimenko; Benjamin Raichel (FSTTCS, 2021)

Clustering with Neighborhoods. - Hongyao Huang; Georgiy Klimenko; Benjamin Raichel (ISAAC, 2021)

How can classical multidimensional scaling go wrong? - Rishi Sonthalia; Greg Van Buskirk; Benjamin Raichel; Anna C. Gilbert (NeurIPS, 2021)

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. - Peyman Afshani; Mark de Berg; Kevin Buchin; Jie Gao 001; Maarten Löffler; Amir Nayyeri; Benjamin Raichel; Rik Sarkar; Haotian Wang 002; Hao-Tsung Yang (WAFR, 2021)

Sparse convex hull coverage. - Georgiy Klimenko; Benjamin Raichel; Gregory Van Buskirk (Comput. Geom., 2021)

Computing the Fréchet Gap Distance. - Chenglin Fan; Benjamin Raichel (Discret. Comput. Geom., 2021)

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. - Peyman Afshani; Mark de Berg; Kevin Buchin; Jie Gao 001; Maarten Löffler; Amir Nayyeri; Benjamin Raichel; Rik Sarkar; Haotian Wang 002; Hao-Tsung Yang (SoCG, 2022)

Clustering with Faulty Centers. - Kyle Fox; Hongyao Huang; Benjamin Raichel (ISAAC, 2022)

Metric Violation Distance: Hardness and Approximation. - Chenglin Fan; Benjamin Raichel; Gregory Van Buskirk (Algorithmica, 2022)

On the Budgeted Hausdorff Distance Problem. - Sariel Har-Peled; Benjamin Raichel (CCCG, 2023)

Square Hardness for Clustering with Neighborhoods. - Georgiy Klimenko; Benjamin Raichel (CCCG, 2023)

Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm. - Benjamin Raichel; Seshadhri Comandur (Discret. Comput. Geom., 2023)

Fréchet Distance for Uncertain Curves. - Kevin Buchin; Chenglin Fan; Maarten Löffler; Aleksandr Popov 001; Benjamin Raichel; Marcel Roeloffzen (ACM Trans. Algorithms, 2023)

Local Frechet Permutation. - Jonathan James Perry; Benjamin Raichel (CCCG, 2024)

Fréchet Edit Distance. - Emily Fox; Amir Nayyeri; Jonathan James Perry; Benjamin Raichel (SoCG, 2024)

Clustering with faulty centers. - Emily Fox; Hongyao Huang; Benjamin Raichel (Comput. Geom., 2024)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog. - Sariel Har-Peled; Benjamin Raichel; Eliot W. Robson (SoCG, 2025)

Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. - Chenglin Fan; Benjamin Raichel (Discret. Comput. Geom., 2025)

Preprocessing Disks for Convex Hulls, Revisited. - Maarten Löffler; Benjamin Raichel (CoRR, 2025)