Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Finding minimum hidden guard sets in polygons: tight approximability results
Computational Geometry: Theory and Applications
Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms
Solving some combinatorial problems in grid n-ogons
ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
Finding minimum hidden guard sets in polygons---tight approximability results
Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |