| The Fréchet distance revisited and extended S Har-Peled, B Raichel ACM Transactions on Algorithms (TALG) 10 (1), 1-22, 2014 | 128 | 2014 |
| 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 | 62 | 2015 |
| Sparse approximation via generating point sets A Blum, S Har-Peled, B Raichel ACM Transactions on Algorithms (TALG) 15 (3), 1-16, 2019 | 39 | 2019 |
| 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 | 19 | 2015 |
| 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 | 17 | 2018 |
| 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 | 16 | 2013 |
| Fault tolerant clustering revisited N Kumar, B Raichel arXiv preprint arXiv:1307.2520, 2013 | 15 | 2013 |
| Avoiding the global sort: A faster contour tree algorithm B Raichel, C Seshadhri Discrete & Computational Geometry 58 (4), 946-985, 2017 | 13* | 2017 |
| 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 | 12 | 2023 |
| 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 | 12 | 2021 |
| From proximity to utility: A Voronoi partition of Pareto optima HC Chang, S Har-Peled, B Raichel Discrete & Computational Geometry 56, 631-656, 2016 | 12 | 2016 |
| 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 | 11 | 2017 |
| Computing the Fréchet gap distance C Fan, B Raichel Discrete & Computational Geometry 65, 1244-1274, 2021 | 10 | 2021 |
| Generalized metric repair on graphs C Fan, AC Gilbert, B Raichel, R Sonthalia, G Van Buskirk arXiv preprint arXiv:1908.08411, 2019 | 9 | 2019 |
| 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 | 8 | 2016 |
| 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 | 8 | 2012 |
| Sparse approximate conic hulls G Van Buskirk, B Raichel, N Ruozzi Advances in Neural Information Processing Systems 30, 2017 | 7 | 2017 |
| How can classical multidimensional scaling go wrong? R Sonthalia, G Van Buskirk, B Raichel, A Gilbert Advances in Neural Information Processing Systems 34, 12304-12315, 2021 | 6 | 2021 |
