Approximate nearest neighbor for curves: simple, efficient, and deterministic A Filtser, O Filtser, MJ Katz
Algorithmica 85 (5), 1490-1519, 2023
32 2023 The discrete and semicontinuous Fréchet distance with shortcuts via approximate distance counting and selection RB Avraham, O Filtser, H Kaplan, MJ Katz, M Sharir
ACM Transactions on Algorithms (TALG) 11 (4), 1-29, 2015
23 2015 The discrete Fréchet distance with shortcuts via approximate distance counting and selection RB Avraham, O Filtser, H Kaplan, MJ Katz, M Sharir
Proceedings of the thirtieth annual symposium on Computational geometry, 377-386, 2014
17 2014 Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains S Ashur, O Filtser, MJ Katz, R Saban
Computational Geometry 101, 101832, 2022
14 2022 Static and streaming data structures for Fréchet distance queries A Filtser, O Filtser
ACM Transactions on Algorithms 19 (4), 1-36, 2023
11 2023 Algorithms for the discrete Fréchet distance under translation O Filtser, M Katz
Journal of Computational Geometry 11 (1), 156–175-156–175, 2020
9 2020 A constant-factor approximation algorithm for vertex guarding a WV-polygon S Ashur, O Filtser, MJ Katz
Approximation and Online Algorithms: 18th International Workshop, WAOA 2020 …, 2021
8 2021 On the chain pair simplification problem C Fan, O Filtser, MJ Katz, T Wylie, B Zhu
Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015
8 2015 Universal approximate simplification under the discrete Fréchet distance O Filtser
Information Processing Letters 132, 22-27, 2018
7 2018 Guarding orthogonal art galleries with sliding cameras S Durocher, O Filtser, R Fraser, AD Mehrabi, S Mehrabi
Computational Geometry 65, 12-26, 2017
7 2017 Efficient nearest-neighbor query and clustering of planar curves B Aronov, O Filtser, M Horton, MJ Katz, K Sheikhan
Workshop on Algorithms and Data Structures, 28-42, 2019
6 2019 On the general chain pair simplification problem C Fan, O Filtser, MJ Katz, B Zhu
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
5 2016 The Discrete Fr\'echet Gap O Filtser, MJ Katz
arXiv preprint arXiv:1506.04861, 2015
5 2015 Plurality in Spatial Voting Games with Constant A Filtser, O Filtser
Discrete & Computational Geometry, 1-16, 2024
3 2024 Condorcet relaxation in spatial voting A Filtser, O Filtser
Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5407-5414, 2021
2 2021 Terrain-like and non-jumping graphs S Ashur, O Filtser, R Sababn
Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019
2 2019 Robustly Guarding Polygons R Das, O Filtser, MJ Katz, JSB Mitchell
arXiv preprint arXiv:2403.11861, 2024
2024 Guarding Polyominoes Under k -Hop Visibility O Filtser, E Krohn, BJ Nilsson, C Rieck, C Schmidt
Latin American Symposium on Theoretical Informatics, 288-302, 2024
2024 A tour of general Hanoi graphs D Berend, L Cohen, O Filtser
Theoretical Computer Science 983, 114289, 2024
2024 Minimum -Hop Dominating Sets in Grid Graphs O Filtser, E Krohn, BJ Nilsson, C Rieck, C Schmidt
arXiv preprint arXiv:2308.00334, 2023
2023