I agree that this site is using cookies. You can find further informations here.
X
Filtser, Omrit
7  results:
Bookchapter (Online) X
Search for persons X
?
1

Guarding Polyominoes Under k-Hop Visibility:

, In: Lecture Notes in Computer Science; LATIN 2024: Theoretical Informatics,
Filtser, Omrit ; Krohn, Erik ; Nilsson, Bengt J... - p. 288-302 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Static and Streaming Data Structures for Fréchet Distance Q..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Filtser, Arnold ; Filtser, Omrit - p. 1150-1170 , 2021
Link: https://doi.org/10.1137/..
 
?
3

A Constant-Factor Approximation Algorithm for Vertex Guardi..:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,
Ashur, Stav ; Filtser, Omrit ; Katz, Matthew J. - p. 81-96 , 2021
Link: https://doi.org/10.1007/..
 
?
4

Static and streaming data structures for Fréchet distance q..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Filtser, Arnold ; Filtser, Omrit - p. 1150-1170 , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Poly..:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,
Ashur, Stav ; Filtser, Omrit ; Katz, Matthew J.. - p. 1-17 , 2020
Link: https://doi.org/10.1007/..
 
?
6

Efficient Nearest-Neighbor Query and Clustering of Planar C..:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Aronov, Boris ; Filtser, Omrit ; Horton, Michael.. - p. 28-42 , 2019
Link: https://doi.org/10.1007/..
 
?
7

The Discrete Fréchet Distance with Shortcuts via Approximat..:

, In: Proceedings of the thirtieth annual symposium on Computational geometry,
Avraham, Rinat Ben ; Filtser, Omrit ; Kaplan, Haim.. - p. 377-386 , 2014
Link: https://dl.acm.org/doi/1..
 
1-7