default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmrit Filtser
Person information
- affiliation: Open University of Israel, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j10]Daniel Berend, Liat Cohen, Omrit Filtser
:
A tour of general Hanoi graphs. Theor. Comput. Sci. 983: 114289 (2024)- 2023
- [j9]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic. Algorithmica 85(5): 1490-1519 (2023) - [j8]Arnold Filtser, Omrit Filtser:
Static and Streaming Data Structures for Fréchet Distance Queries. ACM Trans. Algorithms 19(4): 39:1-39:36 (2023) - 2022
- [j7]Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban:
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains. Comput. Geom. 101: 101832 (2022) - [j6]Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan:
Bipartite Diameter and Other Measures Under Translation. Discret. Comput. Geom. 68(3): 647-663 (2022) - 2021
- [j5]Stav Ashur, Omrit Filtser, Matthew J. Katz:
A constant-factor approximation algorithm for vertex guarding a WV-polygon. J. Comput. Geom. 12(1): 128-144 (2021) - 2020
- [j4]Omrit Filtser, Matthew J. Katz:
Algorithms for the discrete Fréchet distance under translation. J. Comput. Geom. 11(1): 156-175 (2020) - 2018
- [j3]Omrit Filtser:
Universal approximate simplification under the discrete Fréchet distance. Inf. Process. Lett. 132: 22-27 (2018) - 2017
- [j2]Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
Guarding orthogonal art galleries with sliding cameras. Comput. Geom. 65: 12-26 (2017) - 2015
- [j1]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. ACM Trans. Algorithms 11(4): 29:1-29:29 (2015)
Conference and Workshop Papers
- 2024
- [c15]Rathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell:
Robustly Guarding Polygons. SoCG 2024: 47:1-47:17 - [c14]Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Guarding Polyominoes Under k-Hop Visibility. LATIN (1) 2024: 288-302 - 2023
- [c13]Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk:
On Flipping the Fréchet Distance. ITCS 2023: 51:1-51:22 - 2021
- [c12]Arnold Filtser, Omrit Filtser:
Condorcet Relaxation In Spatial Voting. AAAI 2021: 5407-5414 - [c11]Arnold Filtser, Omrit Filtser:
Static and Streaming Data Structures for Fréchet Distance Queries. SODA 2021: 1150-1170 - 2020
- [c10]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. ICALP 2020: 48:1-48:19 - [c9]Stav Ashur, Omrit Filtser, Matthew J. Katz:
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. WAOA 2020: 81-96 - 2019
- [c8]Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan:
Bipartite Diameter and Other Measures Under Translation. STACS 2019: 8:1-8:14 - [c7]Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan:
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. WADS 2019: 28-42 - [c6]Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban:
Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains. WAOA 2019: 1-17 - 2018
- [c5]Omrit Filtser, Matthew J. Katz:
Algorithms for the Discrete Fréchet Distance Under Translation. SWAT 2018: 20:1-20:14 - 2016
- [c4]Chenglin Fan, Omrit Filtser, Matthew J. Katz, Binhai Zhu:
On the General Chain Pair Simplification Problem. MFCS 2016: 37:1-37:14 - 2015
- [c3]Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu:
On the Chain Pair Simplification Problem. WADS 2015: 351-362 - 2014
- [c2]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. SoCG 2014: 377 - [c1]Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. LATIN 2014: 294-305
Informal and Other Publications
- 2024
- [i12]Rathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell:
Robustly Guarding Polygons. CoRR abs/2403.11861 (2024) - 2023
- [i11]Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Minimum k-Hop Dominating Sets in Grid Graphs. CoRR abs/2308.00334 (2023) - 2022
- [i10]Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk:
How to Stay Socially Distant: A Geometric Approach. CoRR abs/2203.04548 (2022) - 2021
- [i9]Omrit Filtser, Majid Mirzanezhad, Carola Wenk:
Minimum-Complexity Graph Simplification under Fréchet-Like Distances. CoRR abs/2111.02591 (2021) - 2020
- [i8]Arnold Filtser, Omrit Filtser:
Plurality in Spatial Voting Games with constant $β$. CoRR abs/2005.04799 (2020) - [i7]Arnold Filtser, Omrit Filtser:
Static and Streaming Data Structures for Fréchet Distance Queries. CoRR abs/2007.10898 (2020) - 2019
- [i6]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. CoRR abs/1902.07562 (2019) - [i5]Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan:
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. CoRR abs/1904.11026 (2019) - [i4]Stav Ashur, Omrit Filtser, Matthew J. Katz:
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. CoRR abs/1907.01228 (2019) - 2015
- [i3]Omrit Filtser, Matthew J. Katz:
The Discrete Fréchet Gap. CoRR abs/1506.04861 (2015) - 2014
- [i2]Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu:
On the Chain Pair Simplification Problem. CoRR abs/1409.2457 (2014) - 2013
- [i1]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. CoRR abs/1310.5245 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-07 20:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
