Stav Ashur

Orcid: 0000-0003-0533-8978

According to our database1, Stav Ashur authored at least 17 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Serialized Red-Green-Gray: Quicker Heuristic Validation of Edges in Dynamic Roadmap Graphs.
CoRR, March, 2026

Quick Heuristic Validation of Edges in Dynamic Roadmap Graphs.
CoRR, January, 2026

2025
Faster Motion Planning via Restarts.
CoRR, June, 2025

Edge Nearest Neighbor in Sampling-Based Motion Planning.
CoRR, June, 2025

Quickly Avoiding a Random Catastrophe.
CoRR, March, 2025

2024
SPITE: Simple Polyhedral Intersection Techniques for modified Environments.
CoRR, 2024

A Framework for Guided Motion Planning.
CoRR, 2024

Local Spanners Revisited.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023
On the Rectangles Induced by Points.
CoRR, 2023

A 4-approximation of the 2π3-MST.
Comput. Geom., 2023

2022
Evaluating Guiding Spaces for Motion Planning.
CoRR, 2022

2021
A 4-Approximation of the $\frac{2\pi }{3}$-MST.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

On Undecided LP, Clustering and Active Learning.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
A 4-Approximation of the $\frac{2π}{3}$-MST.
CoRR, 2020

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule.
Algorithmica, 2020

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon.
Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

2019
Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019


  Loading...