E-LIB Suche - Ergebnisse für: Filtser, Omrit

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

A tour of general Hanoi graphs:

Berend, Daniel ; Cohen, Liat ; Filtser, Omrit
Theoretical Computer Science. 983 (2024) - p. 114289 , 2024

Link: https://doi.org/10.1016/..

3

Plurality in Spatial Voting Games with Constant $$\beta $$:

Filtser, Arnold ; Filtser, Omrit
Discrete & Computational Geometry. , 2024

Link: https://doi.org/10.1007/..

4

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

Filtser, Arnold ; Filtser, Omrit
ACM Transactions on Algorithms. 19 (2023) 4 - p. 1-36 , 2023

Link: https://doi.org/10.1145/..

5

Approximate Nearest Neighbor for Curves: Simple, Efficient,..:

Filtser, Arnold ; Filtser, Omrit ; Katz, Matthew J.
Algorithmica. 85 (2022) 5 - p. 1490-1519 , 2022

Link: https://doi.org/10.1007/..

6

Bipartite Diameter and Other Measures Under Translation:

Aronov, Boris ; Filtser, Omrit ; Katz, Matthew J..
Discrete & Computational Geometry. , 2022

Link: https://doi.org/10.1007/..

7

Terrain-like graphs: PTASs for guarding weakly-visible poly..:

Ashur, Stav ; Filtser, Omrit ; Katz, Matthew J..
Computational Geometry. 101 (2022) - p. 101832 , 2022

Link: https://doi.org/10.1016/..

8

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/..

9

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/..

10

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..

11

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/..

12

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/..

13

Universal approximate simplification under the discrete Fré..:

Filtser, Omrit
Information Processing Letters. 132 (2018) - p. 22-27 , 2018

Link: https://doi.org/10.1016/..

14

Guarding orthogonal art galleries with sliding cameras:

Durocher, Stephane ; Filtser, Omrit ; Fraser, Robert..
Computational Geometry. 65 (2017) - p. 12-26 , 2017

Link: https://doi.org/10.1016/..

15

The Discrete and Semicontinuous Fréchet Distance with Short..:

Avraham, Rinat Ben ; Filtser, Omrit ; Kaplan, Haim..
ACM Transactions on Algorithms (TALG). 11 (2015) 4 - p. 1-29 , 2015

Link: https://dl.acm.org/doi/1..