The following pages link to (Q4580094):
Displaying 12 items.
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Line segment visibility with sidedness constraints (Q2144449) (← links)
- Reachable region query and its applications (Q2201650) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- (Q5115778) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Minimizing visible edges in polyhedra (Q6083182) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- Topological art in simple galleries (Q6204773) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
- A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)
