Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
How Many People Can Hide in a Terrain?
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
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
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 |