受强制性开放获取政策约束的文章 - Benjamin Adam Raichel了解详情
可在其他位置公开访问的文章：19 篇
Sparse approximation via generating point sets
A Blum, S Har-Peled, B Raichel
ACM Transactions on Algorithms (TALG) 15 (3), 1-16, 2019
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation, Netherlands Organisation for Scientific Research
Avoiding the global sort: A faster contour tree algorithm
B Raichel, C Seshadhri
Discrete & Computational Geometry 58 (4), 946-985, 2017
强制性开放获取政策： US National Science Foundation, US Department of Energy
From proximity to utility: A Voronoi partition of Pareto optima
HC Chang, S Har-Peled, B Raichel
Discrete & Computational Geometry 56, 631-656, 2016
强制性开放获取政策： US National Science Foundation
Computing the Fréchet gap distance
C Fan, B Raichel
Discrete & Computational Geometry 65, 1244-1274, 2021
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation, Netherlands Organisation for Scientific Research
Sparse convex hull coverage
G Klimenko, B Raichel, G Van Buskirk
Computational Geometry 98, 101787, 2021
强制性开放获取政策： US National Science Foundation
Sparse approximate conic hulls
G Van Buskirk, B Raichel, N Ruozzi
Advances in Neural Information Processing Systems 30, 2017
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation, Netherlands Organisation for Scientific Research
Linear expected complexity for directional and multiplicative Voronoi diagrams
C Fan, B Raichel
arXiv preprint arXiv:2004.09385, 2020
强制性开放获取政策： US National Science Foundation
Approximating distance measures for the skyline
N Kumar, B Raichel, S Sintos, G Van Buskirk
22nd International Conference on Database Theory (ICDT 2019), 2019
强制性开放获取政策： US National Science Foundation, US Department of Defense
Viewing the rings of a tree: Minimum distortion embeddings into trees
A Nayyeri, B Raichel
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
强制性开放获取政策： US National Science Foundation
Clustering with faulty centers
E Fox, H Huang, B Raichel
Computational Geometry 117, 102052, 2024
强制性开放获取政策： US National Science Foundation
Clustering with Neighborhoods is Hard for Squares
G Klimenko, B Raichel
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
强制性开放获取政策： US National Science Foundation
From Proximity to Utility
HC Chang, S Har-Peled, B Raichel
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定