default search action
Benjamin Raichel
Person information
- affiliation: University of Texas at Dallas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j16]Chenglin Fan, Benjamin Raichel
:
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. Discret. Comput. Geom. 73(1): 1-24 (2025) - [c35]Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson:
The Fréchet Distance Unleashed: Approximating a Dog with a Frog. SoCG 2025: 54:1-54:13 - [c34]Md. Billal Hossain, Benjamin Raichel:
Clustering Point Sets Revisited. WADS 2025: 38:1-38:16 - [i26]Maarten Löffler, Benjamin Raichel:
Preprocessing Disks for Convex Hulls, Revisited. CoRR abs/2502.03633 (2025) - [i25]Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson:
Well-Separated Pairs Decomposition Revisited. CoRR abs/2509.05997 (2025) - [i24]Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson:
The Road to the Closest Point is Paved by Good Neighbors. CoRR abs/2509.23966 (2025) - 2024
- [j15]Emily Fox, Hongyao Huang, Benjamin Raichel
Clustering with faulty centers. Comput. Geom. 117: 102052 (2024) - [c33]Jonathan James Perry, Benjamin Raichel:
Local Frechet Permutation. CCCG 2024: 279-286 - [c32]Emily Fox, Amir Nayyeri
Fréchet Edit Distance. SoCG 2024: 58:1-58:15 - [i23]Emily Fox, Amir Nayyeri, Jonathan James Perry, Benjamin Raichel:
Fréchet Edit Distance. CoRR abs/2403.12878 (2024) - [i22]Sariel Har-Peled, Benjamin Raichel, Eliot Wong Robson:
The Fréchet Distance Unleashed: Approximating a Dog with a Frog. CoRR abs/2407.03101 (2024) - 2023
- [j14]Benjamin Raichel, Seshadhri Comandur:
Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm. Discret. Comput. Geom. 69(1): 1-3 (2023) - [j13]Kevin Buchin
Fréchet Distance for Uncertain Curves. ACM Trans. Algorithms 19(3): 29:1-29:47 (2023) - [c31]Georgiy Klimenko, Benjamin Raichel:
Square Hardness for Clustering with Neighborhoods. CCCG 2023: 123-127 - [c30]Sariel Har-Peled, Benjamin Raichel:
On the Budgeted Hausdorff Distance Problem. CCCG 2023: 169-173 - [i21]Sariel Har-Peled
On the Budgeted Hausdorff Distance Problem. CoRR abs/2306.02151 (2023) - 2022
- [j12]Chenglin Fan, Benjamin Raichel
Metric Violation Distance: Hardness and Approximation. Algorithmica 84(5): 1441-1465 (2022) - [c29]Peyman Afshani, Mark de Berg, Kevin Buchin
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. SoCG 2022: 2:1-2:14 - [c28]Kyle Fox, Hongyao Huang, Benjamin Raichel:
Clustering with Faulty Centers. ISAAC 2022: 10:1-10:14 - [i20]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. CoRR abs/2203.07280 (2022) - 2021
- [j11]Georgiy Klimenko, Benjamin Raichel
Sparse convex hull coverage. Comput. Geom. 98: 101787 (2021) - [j10]Chenglin Fan, Benjamin Raichel
Computing the Fréchet Gap Distance. Discret. Comput. Geom. 65(4): 1244-1274 (2021) - [c27]Georgiy Klimenko, Benjamin Raichel:
Fast and Exact Convex Hull Simplification. FSTTCS 2021: 26:1-26:17 - [c26]Hongyao Huang, Georgiy Klimenko, Benjamin Raichel:
Clustering with Neighborhoods. ISAAC 2021: 6:1-6:17 - [c25]Rishi Sonthalia, Greg Van Buskirk, Benjamin Raichel, Anna C. Gilbert:
How can classical multidimensional scaling go wrong? NeurIPS 2021: 12304-12315 - [c24]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. WAFR 2021: 107-123 - [i19]Hongyao Huang, Georgiy Klimenko, Benjamin Raichel:
Clustering with Neighborhoods. CoRR abs/2109.13302 (2021) - [i18]Georgiy Klimenko, Benjamin Raichel:
Fast and Exact Convex Hull Simplification. CoRR abs/2110.00671 (2021) - [i17]Rishi Sonthalia, Gregory Van Buskirk, Benjamin Raichel, Anna C. Gilbert:
How can classical multidimensional scaling go wrong? CoRR abs/2110.11430 (2021) - 2020
- [c23]Hongyao Huang, Benjamin Raichel:
Convex Hull Complexity of Uncertain Points. CCCG 2020: 6-14 - [c22]Georgiy Klimenko, Benjamin Raichel, Gregory Van Buskirk:
Sparse Convex Hull Coverage. CCCG 2020: 15-25 - [c21]Chenglin Fan, Benjamin Raichel:
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. ESA 2020: 45:1-45:18 - [c20]Kevin Buchin
Fréchet Distance for Uncertain Curves. ICALP 2020: 20:1-20:20 - [c19]Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk:
Generalized Metric Repair on Graphs. SWAT 2020: 25:1-25:22 - [i16]Chenglin Fan, Benjamin Raichel:
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. CoRR abs/2004.09385 (2020) - [i15]Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov
Fréchet Distance for Uncertain Curves. CoRR abs/2004.11862 (2020) - [i14]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. CoRR abs/2005.02530 (2020)
2010 – 2019
- 2019
- [j9]Avrim Blum, Sariel Har-Peled
Sparse Approximation via Generating Point Sets. ACM Trans. Algorithms 15(3): 32:1-32:16 (2019) - [c18]Nirman Kumar, Benjamin Raichel, Stavros Sintos, Gregory Van Buskirk:
Approximating Distance Measures for the Skyline. ICDT 2019: 10:1-10:20 - [c17]Amir Nayyeri
Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees. SODA 2019: 2380-2399 - [i13]Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk:
Generalized Metric Repair on Graphs. CoRR abs/1908.08411 (2019) - 2018
- [c16]Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk:
Metric Violation Distance: Hardness and Approximation. SODA 2018: 196-209 - [i12]Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk:
Metric Violation Distance: Revisited and Extended. CoRR abs/1807.08078 (2018) - 2017
- [j8]Benjamin Raichel
Avoiding the Global Sort: A Faster Contour Tree Algorithm. Discret. Comput. Geom. 58(4): 946-985 (2017) - [j7]Alina Ene, Sariel Har-Peled
Geometric Packing under Nonuniform Constraints. SIAM J. Comput. 46(6): 1745-1784 (2017) - [c15]Chenglin Fan, Benjamin Raichel:
Computing the Fréchet Gap Distance. SoCG 2017: 42:1-42:16 - [c14]Greg Van Buskirk, Benjamin Raichel, Nicholas Ruozzi
Sparse Approximate Conic Hulls. NIPS 2017: 2534-2544 - [c13]Amir Nayyeri, Benjamin Raichel:
A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs. SODA 2017: 724-736 - 2016
- [j6]Sariel Har-Peled
Space Exploration via Proximity Search. Discret. Comput. Geom. 56(2): 357-376 (2016) - [j5]Hsien-Chih Chang, Sariel Har-Peled
From Proximity to Utility: A Voronoi Partition of Pareto Optima. Discret. Comput. Geom. 56(3): 631-656 (2016) - [j4]Anne Driemel
On the Expected Complexity of Voronoi Diagrams on Terrains. ACM Trans. Algorithms 12(3): 37:1-37:20 (2016) - [c12]Benjamin Raichel, C. Seshadhri:
Avoiding the Global Sort: A Faster Contour Tree Algorithm. SoCG 2016: 57:1-57:14 - [c11]Nirman Kumar, Benjamin Raichel, Subhash Suri, Kevin Verbeek
Most Likely Voronoi Diagrams in Higher Dimensions. FSTTCS 2016: 31:1-31:14 - [c10]Avrim Blum, Sariel Har-Peled
Sparse Approximation via Generating Point Sets. SODA 2016: 548-557 - 2015
- [b1]Benjamin Raichel:
In pursuit of linear complexity in discrete and computational geometry. University of Illinois Urbana-Champaign, USA, 2015 - [j3]Sariel Har-Peled
On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams. Discret. Comput. Geom. 53(3): 547-568 (2015) - [j2]Sariel Har-Peled
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. J. ACM 62(6): 44:1-44:35 (2015) - [c9]Sariel Har-Peled
Space Exploration via Proximity Search. SoCG 2015: 374-389 - [c8]Hsien-Chih Chang, Sariel Har-Peled
From Proximity to Utility: A Voronoi Partition of Pareto Optima. SoCG 2015: 689-703 - [c7]Amir Nayyeri
Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line. FOCS 2015: 729-747 - [i11]Avrim Blum, Sariel Har-Peled
Sparse Approximation via Generating Point Sets. CoRR abs/1507.02574 (2015) - 2014
- [j1]Sariel Har-Peled
The fréchet distance revisited and extended. ACM Trans. Algorithms 10(1): 3:1-3:22 (2014) - [c6]Sariel Har-Peled
On the Complexity of Randomly Weighted Voronoi Diagrams. SoCG 2014: 232 - [i10]Sariel Har-Peled, Benjamin Raichel:
On the Complexity of Randomly Weighted Voronoi Diagrams. CoRR abs/1401.1477 (2014) - [i9]Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel:
From Proximity to Utility: A Voronoi Partition of Pareto Optima. CoRR abs/1404.3403 (2014) - [i8]Sariel Har-Peled, Benjamin Raichel:
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. CoRR abs/1409.7425 (2014) - [i7]Benjamin Raichel, C. Seshadhri:
A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm. CoRR abs/1411.2689 (2014) - [i6]Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel:
Space Exploration via Proximity Search. CoRR abs/1412.1398 (2014) - 2013
- [c5]Nirman Kumar, Benjamin Raichel:
Fault Tolerant Clustering Revisited. CCCG 2013 - [c4]Sariel Har-Peled
Net and prune: a linear time algorithm for euclidean distance problems. STOC 2013: 605-614 - [i5]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small. CoRR abs/1304.7318 (2013) - [i4]Nirman Kumar, Benjamin Raichel:
Fault Tolerant Clustering Revisited. CoRR abs/1307.2520 (2013) - 2012
- [c3]Alina Ene, Sariel Har-Peled
Geometric packing under non-uniform constraints. SCG 2012: 11-20 - [c2]Anne Driemel
On the expected complexity of voronoi diagrams on terrains. SCG 2012: 101-110 - [i3]Sariel Har-Peled, Benjamin Raichel:
Fréchet Distance Revisited and Extended. CoRR abs/1202.5610 (2012) - 2011
- [c1]Sariel Har-Peled
The frechet distance revisited and extended. SCG 2011: 448-457 - [i2]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric Packing under Non-uniform Constraints. CoRR abs/1107.2949 (2011) - [i1]Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the Expected Complexity of Voronoi Diagrams on Terrains. CoRR abs/1112.0695 (2011)
Coauthor Index
aka: Greg Van Buskirk
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-28 23:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: