The following pages link to Alireza Zarei (Q255266):
Displaying 22 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Touring convex polygons in polygonal domain fences (Q1708597) (← links)
- Kinetic Euclidean minimum spanning tree in the plane (Q1932347) (← links)
- A simple, faster method for kinetic proximity problems (Q2344057) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Connecting guards with minimum Steiner points inside simple polygons (Q2419109) (← links)
- Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- Visibility Graphs of Anchor Polygons (Q2798021) (← links)
- Touring Disjoint Polygons Problem Is NP-Hard (Q2867133) (← links)
- Touring Polygons: An Approximation Algorithm (Q2876565) (← links)
- Kinetic Pie Delaunay Graph and Its Applications (Q2904542) (← links)
- Visibility Testing and Counting (Q3004687) (← links)
- Kinetic Euclidean Minimum Spanning Tree in the Plane (Q3111656) (← links)
- (Q3401225) (← links)
- Visibility Graphs of Anchor Polygons (Q5084702) (← links)
- Recognizing Visibility Graphs of Triangulated Irregular Networks (Q5164862) (← links)
- Efficient computation of query point visibility in polygons with holes (Q5370627) (← links)
- Streaming algorithms for line simplification (Q5901404) (← links)
- Streaming algorithms for line simplification (Q5919922) (← links)
- A better LP rounding for feedback arc set on tournaments (Q6614011) (← links)
