Follow
Benjamin Adam Raichel
Title
Cited by
Cited by
Year
The Fréchet distance revisited and extended
S Har-Peled, B Raichel
ACM Transactions on Algorithms (TALG) 10 (1), 1-22, 2014
1252014
Net and prune: A linear time algorithm for euclidean distance problems
S Har-Peled, B Raichel
Journal of the ACM (JACM) 62 (6), 1-35, 2015
622015
Sparse approximation via generating point sets
A Blum, S Har-Peled, B Raichel
ACM Transactions on Algorithms (TALG) 15 (3), 1-16, 2019
382019
On the complexity of randomly weighted multiplicative Voronoi diagrams
S Har-Peled, B Raichel
Discrete & Computational Geometry 53, 547-568, 2015
28*2015
Geometric packing under non-uniform constraints
A Ene, S Har-Peled, B Raichel
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
24*2012
Reality distortion: Exact and approximate algorithms for embedding into the line
A Nayyeri, B Raichel
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 729-747, 2015
192015
Metric violation distance: Hardness and approximation
C Fan, B Raichek, G Van Buskirk
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
172018
Fast clustering with lower bounds: No customer too far, no shop too small
A Ene, S Har-Peled, B Raichel
arXiv preprint arXiv:1304.7318, 2013
162013
Fault tolerant clustering revisited
N Kumar, B Raichel
arXiv preprint arXiv:1307.2520, 2013
152013
Avoiding the global sort: A faster contour tree algorithm
B Raichel, C Seshadhri
Discrete & Computational Geometry 58 (4), 946-985, 2017
13*2017
From proximity to utility: A Voronoi partition of Pareto optima
HC Chang, S Har-Peled, B Raichel
Discrete & Computational Geometry 56, 631-656, 2016
122016
A treehouse with custom windows: Minimum distortion embeddings into bounded treewidth graphs
A Nayyeri, B Raichel
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
112017
Approximation algorithms for multi-robot patrol-scheduling with min-max latency
P Afshani, M De Berg, K Buchin, J Gao, M Löffler, A Nayyeri, B Raichel, ...
Algorithmic Foundations of Robotics XIV: Proceedings of the Fourteenth …, 2021
102021
Fréchet distance for uncertain curves
K Buchin, C Fan, M Löffler, A Popov, B Raichel, M Roeloffzen
ACM Transactions on Algorithms 19 (3), 1-47, 2023
92023
Computing the Fréchet gap distance
C Fan, B Raichel
Discrete & Computational Geometry 65, 1244-1274, 2021
92021
Generalized metric repair on graphs
C Fan, AC Gilbert, B Raichel, R Sonthalia, G Van Buskirk
arXiv preprint arXiv:1908.08411, 2019
92019
Most likely voronoi diagrams in higher dimensions
N Kumar, B Raichel, S Suri, K Verbeek
36th IARCS Annual Conference on Foundations of Software Technology and …, 2016
82016
On the expected complexity of Voronoi diagrams on terrains
A Driemel, S Har-Peled, B Raichel
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
82012
Sparse approximate conic hulls
G Van Buskirk, B Raichel, N Ruozzi
Advances in Neural Information Processing Systems 30, 2017
72017
Fast clustering with lower bounds: No customer too far, no shop too small. In submission
A Ene, B Raichel, S Har-Peled
62012
The system can't perform the operation now. Try again later.
Articles 1–20