The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. - Rinat Ben Avraham; Omrit Filtser; Haim Kaplan; Matthew J. Katz; Micha Sharir (CoRR, 2013)

The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. - Rinat Ben Avraham; Omrit Filtser; Haim Kaplan; Matthew J. Katz; Micha Sharir (SoCG, 2014)

A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. - Stephane Durocher; Omrit Filtser; Robert Fraser; Ali D. Mehrabi; Saeed Mehrabi 001 (LATIN, 2014)

On the Chain Pair Simplification Problem. - Omrit Filtser; Matthew J. Katz; Tim Wylie; Binhai Zhu (CoRR, 2014)

On the Chain Pair Simplification Problem. - Chenglin Fan; Omrit Filtser; Matthew J. Katz; Tim Wylie; Binhai Zhu (WADS, 2015)

The Discrete Fréchet Gap. - Omrit Filtser; Matthew J. Katz (CoRR, 2015)

The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. - Rinat Ben Avraham; Omrit Filtser; Haim Kaplan; Matthew J. Katz; Micha Sharir (ACM Trans. Algorithms, 2015)

On the General Chain Pair Simplification Problem. - Chenglin Fan; Omrit Filtser; Matthew J. Katz; Binhai Zhu (MFCS, 2016)

Guarding orthogonal art galleries with sliding cameras. - Stephane Durocher; Omrit Filtser; Robert Fraser; Ali D. Mehrabi; Saeed Mehrabi 001 (Comput. Geom., 2017)

Algorithms for the Discrete Fréchet Distance Under Translation. - Omrit Filtser; Matthew J. Katz (SWAT, 2018)

Universal approximate simplification under the discrete Fréchet distance. - Omrit Filtser (Inf. Process. Lett., 2018)

Bipartite Diameter and Other Measures Under Translation. - Boris Aronov; Omrit Filtser; Matthew J. Katz; Khadijeh Sheikhan (STACS, 2019)

Efficient Nearest-Neighbor Query and Clustering of Planar Curves. - Boris Aronov; Omrit Filtser; Michael Horton 001; Matthew J. Katz; Khadijeh Sheikhan (WADS, 2019)

Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains. - Stav Ashur; Omrit Filtser; Matthew J. Katz; Rachel Saban (WAOA, 2019)

Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. - Arnold Filtser; Omrit Filtser; Matthew J. Katz (ICALP, 2020)

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. - Stav Ashur; Omrit Filtser; Matthew J. Katz (WAOA, 2020)

Condorcet Relaxation In Spatial Voting. - Arnold Filtser; Omrit Filtser (AAAI, 2021)

Static and Streaming Data Structures for Fréchet Distance Queries. - Arnold Filtser; Omrit Filtser (SODA, 2021)

Minimum-Complexity Graph Simplification under Fréchet-Like Distances. - Omrit Filtser; Majid Mirzanezhad; Carola Wenk (CoRR, 2021)

How to Stay Socially Distant: A Geometric Approach. - Omrit Filtser; Mayank Goswami 001; Joseph S. B. Mitchell; Valentin Polishchuk (CoRR, 2022)

On Flipping the Fréchet Distance. - Omrit Filtser; Mayank Goswami 001; Joseph S. B. Mitchell; Valentin Polishchuk (ITCS, 2023)

Minimum k-Hop Dominating Sets in Grid Graphs. - Omrit Filtser; Erik Krohn; Bengt J. Nilsson; Christian Rieck; Christiane Schmidt 001 (CoRR, 2023)

Robustly Guarding Polygons. - Rathish Das; Omrit Filtser; Matthew J. Katz; Joseph S. B. Mitchell (SoCG, 2024)

Guarding Polyominoes Under k-Hop Visibility. - Omrit Filtser; Erik Krohn; Bengt J. Nilsson; Christian Rieck; Christiane Schmidt 001 (LATIN (1), 2024)

A tour of general Hanoi graphs. - Daniel Berend; Liat Cohen; Omrit Filtser (Theor. Comput. Sci., 2024)

On Two Simple[st] Learning Tasks. - Omrit Filtser; Kien C. Huynh; Anastasia Lemetti; Joseph S. B. Mitchell; Tatiana Polishchuk; Valentin Polishchuk (CIAC (1), 2025)

Minimum-Complexity Graph Simplification Under the Fréchet-Like Distance. - Omrit Filtser; Majid Mirzanezhad; Carola Wenk (IWOCA, 2025)

Plurality in Spatial Voting Games with Constant β. - Arnold Filtser; Omrit Filtser (Discret. Comput. Geom., 2025)