Efficient algorithms for Petersen's matching theorem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for terrain guarding
Information Processing Letters
Inapproximability Results for Guarding Polygons without Holes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
How Many People Can Hide in a Terrain?
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On the Planar Two-Watchtower Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
γ-Observable neighbours for vector quantization
Neural Networks - New developments in self-organizing maps
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Computational Geometry: Theory and Applications
A constant-factor approximation algorithm for optimal terrain guarding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On guarding the vertices of rectilinear domains
Computational Geometry: Theory and Applications
Polychromatic colorings of plane graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
A note on the lower bound of edge guards of polyhedral terrains
International Journal of Computer Mathematics
Parallel algorithm to find minimum vertex guard set in a triangulated irregular network
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
On guarding rectilinear domains
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Approximation algorithms for art gallery problems in polygons and terrains
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
| Hi-index | 0.01 |