I agree that this site is using cookies. You can find further informations here.
X
Raichel, Benjamin
63  results:
Search for persons X
?
1

Clustering with faulty centers:

Fox, Emily ; Huang, Hongyao ; Raichel, Benjamin
Computational Geometry.  117 (2024)  - p. 102052 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Fréchet Distance for Uncertain Curves:

Buchin, Kevin ; Fan, Chenglin ; Löffler, Maarten...
ACM Transactions on Algorithms.  19 (2023)  3 - p. 1-47 , 2023
Link: https://doi.org/10.1145/..
 
?
3

Correction to: Avoiding the Global Sort: A Faster Contour T..:

Raichel, Benjamin ; Seshadhri, C.
Discrete & Computational Geometry.  69 (2022)  1 - p. 1-3 , 2022
Link: https://doi.org/10.1007/..
 
?
4

Metric Violation Distance: Hardness and Approximation:

Fan, Chenglin ; Raichel, Benjamin ; Buskirk, Gregory Van
Algorithmica.  84 (2022)  5 - p. 1441-1465 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Approximation Algorithms for Multi-Robot Patrol-Scheduling ..:

, In: Algorithmic Foundations of Robotics XIV; Springer Proceedings in Advanced Robotics,
Afshani, Peyman ; de Berg, Mark ; Buchin, Kevin... - p. 107-123 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Sparse convex hull coverage:

Klimenko, Georgiy ; Raichel, Benjamin ; Van Buskirk, Gregory
Computational Geometry.  98 (2021)  - p. 101787 , 2021
Link: https://doi.org/10.1016/..
 
?
7

Computing the Fréchet Gap Distance:

Fan, Chenglin ; Raichel, Benjamin
Discrete & Computational Geometry.  65 (2020)  4 - p. 1244-1274 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Sparse Approximation via Generating Point Sets:

Blum, Avrim ; Har-Peled, Sariel ; Raichel, Benjamin
ACM Transactions on Algorithms (TALG).  15 (2019)  3 - p. 1-16 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

Sparse Approximation via Generating Point Sets:

Blum, Avrim ; Har-Peled, Sariel ; Raichel, Benjamin
ACM Transactions on Algorithms.  15 (2019)  3 - p. 1-16 , 2019
Link: https://doi.org/10.1145/..
 
?
10

Viewing the rings of a tree : minimum distortion embeddi..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Nayyeri, Amir ; Raichel, Benjamin - p. 2380-2399 , 2019
Link: https://dl.acm.org/doi/1..
 
?
11

Metric violation distance : hardness and approximation:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Fan, Chenglin ; Raichel, Benjamin ; Van Buskirk, Gregory - p. 196-209 , 2018
Link: https://dl.acm.org/doi/1..
 
?
12

A treehouse with custom windows : minimum distortion emb..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Nayyeri, Amir ; Raichel, Benjamin - p. 724-736 , 2017
Link: https://dl.acm.org/doi/1..
 
?
13

Avoiding the Global Sort: A Faster Contour Tree Algorithm:

Raichel, Benjamin ; Seshadhri, C.
Discrete & Computational Geometry.  58 (2017)  4 - p. 946-985 , 2017
Link: https://doi.org/10.1007/..
 
?
14

Geometric Packing under Nonuniform Constraints:

Ene, Alina ; Har-Peled, Sariel ; Raichel, Benjamin
SIAM Journal on Computing.  46 (2017)  6 - p. 1745-1784 , 2017
Link: https://doi.org/10.1137/..
 
?
15

Sparse approximation via generating point sets:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Blum, Avrim ; Har-Peled, Sariel ; Raichel, Benjamin - p. 548-557 , 2016
Link: https://dl.acm.org/doi/1..
 
1-15