The Fréchet distance revisited and extended S Har-Peled, B Raichel ACM Transactions on Algorithms (TALG) 10 (1), 1-22, 2014 | 91 | 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 | 36 | 2015 |

Sparse approximation via generating point sets A Blum, S Har-Peled, B Raichel ACM Transactions on Algorithms (TALG) 15 (3), 1-16, 2019 | 24 | 2019 |

Geometric packing under non-uniform constraints A Ene, S Har-Peled, B Raichel Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012 | 22* | 2012 |

On the complexity of randomly weighted multiplicative voronoi diagrams S Har-Peled, B Raichel Discrete & Computational Geometry 53 (3), 547-568, 2015 | 20* | 2015 |

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 | 15 | 2015 |

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 | 12 | 2013 |

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 | 10 | 2017 |

From proximity to utility: A Voronoi partition of Pareto optima HC Chang, S Har-Peled, B Raichel Discrete & Computational Geometry 56 (3), 631-656, 2016 | 9 | 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 | 9 | 2012 |

Avoiding the global sort: A faster contour tree algorithm B Raichel, C Seshadhri Discrete & Computational Geometry 58 (4), 946-985, 2017 | 8* | 2017 |

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 | 6 | 2018 |

Sparse approximate conic hulls G Van Buskirk, B Raichel, N Ruozzi Advances in Neural Information Processing Systems, 2534-2544, 2017 | 6 | 2017 |

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 | 6 | 2016 |

Computing the Fréchet gap distance C Fan, B Raichel Discrete & Computational Geometry, 1-31, 2020 | 5 | 2020 |

Fault tolerant clustering revisited N Kumar, B Raichel arXiv preprint arXiv:1307.2520, 2013 | 5 | 2013 |

Fast clustering with lower bounds: No customer too far, no shop too small. In submission A Ene, B Raichel, S Har-Peled | 5 | 2012 |

Metric violation distance: Revisited and extended C Fan, B Raichel, G Van Buskirk arXiv preprint arXiv:1807.08078, 2018 | 3 | 2018 |

Space exploration via proximity search S Har-Peled, N Kumar, DM Mount, B Raichel Discrete & Computational Geometry 56 (2), 357-376, 2016 | 3 | 2016 |

On the expected complexity of Voronoi diagrams on terrains A Driemel, S Har-Peled, B Raichel ACM Transactions on Algorithms (TALG) 12 (3), 1-20, 2016 | 2 | 2016 |