The following pages link to Bahareh Banyassady (Q2173454):
Displaying 7 items.
- Routing in polygonal domains (Q2173455) (← links)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
- Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682) (← links)
- Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)
- Improved Time-Space Trade-offs for Computing Voronoi Diagrams (Q4626292) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Unlabeled multi-robot motion planning with tighter separation bounds (Q6539529) (← links)
