Funder
NSF
National Science Foundation
Reference55 articles.
1. The art gallery problem is ∃R-complete;Abrahamsen;J. ACM,2022
2. On computing shortest external watchman routes for convex polygons;Absar,2006
3. A PTAS for Euclidean TSP with hyperplane neighborhoods;Antoniadis;ACM Trans. Algorithms,2020
4. Shortest path to a segment and quickest visibility queries;Arkin;J. Comput. Geom.,2016
5. Approximation algorithms for the geometric covering salesman problem;Arkin;Discrete Appl. Math.,1994