Omrit Filtser

Orcid: 0000-0002-3978-1428

Affiliations:
  • Open University of Israel, Israel


According to our database1, Omrit Filtser authored at least 26 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A tour of general Hanoi graphs.
Theor. Comput. Sci., February, 2024

Guarding Polyominoes Under k-Hop Visibility.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Robustly Guarding Polygons.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Static and Streaming Data Structures for Fréchet Distance Queries.
ACM Trans. Algorithms, October, 2023

Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic.
Algorithmica, May, 2023

Minimum k-Hop Dominating Sets in Grid Graphs.
CoRR, 2023

On Flipping the Fréchet Distance.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Bipartite Diameter and Other Measures Under Translation.
Discret. Comput. Geom., 2022

How to Stay Socially Distant: A Geometric Approach.
CoRR, 2022

Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains.
Comput. Geom., 2022

2021
A constant-factor approximation algorithm for vertex guarding a WV-polygon.
J. Comput. Geom., 2021

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

Condorcet Relaxation In Spatial Voting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Algorithms for the discrete Fréchet distance under translation.
J. Comput. Geom., 2020

Plurality in Spatial Voting Games with constant $β$.
CoRR, 2020

2019
Efficient Nearest-Neighbor Query and Clustering of Planar Curves.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018
Universal approximate simplification under the discrete Fréchet distance.
Inf. Process. Lett., 2018

2017
Guarding orthogonal art galleries with sliding cameras.
Comput. Geom., 2017

2016
On the General Chain Pair Simplification Problem.
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.
ACM Trans. Algorithms, 2015

The Discrete Fréchet Gap.
CoRR, 2015

On the Chain Pair Simplification Problem.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014
On the Chain Pair Simplification Problem.
CoRR, 2014

A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.
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.
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.
CoRR, 2013


  Loading...