default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStav Ashur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Stav Ashur, Sariel Har-Peled:
Local Spanners Revisited. SWAT 2024: 2:1-2:15- [i8]Amnon Attali, Stav Ashur, Isaac Burton Love, Courtney McBeth, James Motes, Marco Morales, Nancy M. Amato:
A Framework for Guided Motion Planning. CoRR abs/2404.03133 (2024) - [i7]Stav Ashur, Maria C. Lusardi, Marta Markowicz, James Motes, Marco Morales, Sariel Har-Peled, Nancy M. Amato:
SPITE: Simple Polyhedral Intersection Techniques for modified Environments. CoRR abs/2407.00259 (2024) - 2023
- [j4]Stav Ashur
, Matthew J. Katz:
A 4-approximation of the 2π3-MST. Comput. Geom. 108: 101914 (2023) - [i6]Stav Ashur, Sariel Har-Peled:
On the Rectangles Induced by Points. CoRR abs/2311.10637 (2023) - 2022
- [j3]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) - [i5]Stav Ashur, Sariel Har-Peled:
Local Spanners Revisited. CoRR abs/2201.01715 (2022) - [i4]Amnon Attali, Stav Ashur, Isaac Burton Love, Courtney McBeth, James Motes, Diane Uwacu, Marco Morales, Nancy M. Amato:
Evaluating Guiding Spaces for Motion Planning. CoRR abs/2210.08640 (2022) - 2021
- [j2]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) - [c4]Stav Ashur, Sariel Har-Peled:
On Undecided LP, Clustering and Active Learning. SoCG 2021: 12:1-12:15 - [c3]Stav Ashur, Matthew J. Katz:
A 4-Approximation of the $\frac{2\pi }{3}$-MST. WADS 2021: 129-143 - [i3]Stav Ashur, Sariel Har-Peled:
On Undecided LP, Clustering and Active Learning. CoRR abs/2103.09308 (2021) - 2020
- [j1]Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal:
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. Algorithmica 82(10): 2784-2808 (2020) - [c2]Stav Ashur, Omrit Filtser, Matthew J. Katz:
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. WAOA 2020: 81-96 - [i2]Stav Ashur, Matthew J. Katz:
A 4-Approximation of the $\frac{2π}{3}$-MST. CoRR abs/2010.11571 (2020)
2010 – 2019
- 2019
- [c1]Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban:
Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains. WAOA 2019: 1-17 - [i1]Stav Ashur, Omrit Filtser, Matthew J. Katz:
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. CoRR abs/1907.01228 (2019)
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-08-14 22:15 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:
