Omrit Filtser

According to our database, Omrit Filtser authored at least 28 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Plurality in Spatial Voting Games with Constant β.

Arnold Filtser, Omrit Filtser

Discret. Comput. Geom., June, 2025

Minimum-Complexity Graph Simplification Under the Fréchet-Like Distance.

Omrit Filtser, Majid Mirzanezhad, Carola Wenk

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

On Two Simple[st] Learning Tasks.

Omrit Filtser, Kien C. Huynh, Anastasia Lemetti, Joseph S. B. Mitchell, Tatiana Polishchuk, Valentin Polishchuk

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

A tour of general Hanoi graphs.

Daniel Berend, Liat Cohen, Omrit Filtser

Theor. Comput. Sci., February, 2024

Guarding Polyominoes Under k-Hop Visibility.

Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Robustly Guarding Polygons.

Rathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Minimum k-Hop Dominating Sets in Grid Graphs.

Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt

CoRR, 2023

On Flipping the Fréchet Distance.

Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

How to Stay Socially Distant: A Geometric Approach.

Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk

CoRR, 2022

2021

Minimum-Complexity Graph Simplification under Fréchet-Like Distances.

Omrit Filtser, Majid Mirzanezhad, Carola Wenk

CoRR, 2021

Static and Streaming Data Structures for Fréchet Distance Queries.

Arnold Filtser, Omrit Filtser

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Condorcet Relaxation In Spatial Voting.

Arnold Filtser, Omrit Filtser

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon.

Stav Ashur, Omrit Filtser, Matthew J. Katz

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic.

Arnold Filtser, Omrit Filtser, Matthew J. Katz

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains.

Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

Efficient Nearest-Neighbor Query and Clustering of Planar Curves.

Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Bipartite Diameter and Other Measures Under Translation.

Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Universal approximate simplification under the discrete Fréchet distance.

Omrit Filtser

Inf. Process. Lett., 2018

Algorithms for the Discrete Fréchet Distance Under Translation.

Omrit Filtser, Matthew J. Katz

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017

Guarding orthogonal art galleries with sliding cameras.

Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi

Comput. Geom., 2017

2016

On the General Chain Pair Simplification Problem.

Chenglin Fan, Omrit Filtser, Matthew J. Katz, Binhai Zhu

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

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

The Discrete Fréchet Gap.

Omrit Filtser, Matthew J. Katz

CoRR, 2015

On the Chain Pair Simplification Problem.

Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

On the Chain Pair Simplification Problem.

Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu

CoRR, 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

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

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

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

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