Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Power of Non-Rectilinear Holes
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Decomposing a polygon into its convex parts
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
SCG '86 Proceedings of the second annual symposium on Computational geometry
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
A single-exponential upper bound for finding shortest paths in three dimensions
Journal of the ACM (JACM)
Minimum strictly convex quadrangulations of convex polygons
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Small Convex Quadrangulations of Point Sets
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Guarding curvilinear art galleries with vertex or point guards
Computational Geometry: Theory and Applications
An “Art Gallery Theorem” for pyramids
Information Processing Letters
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
Computing convex quadrangulations
Discrete Applied Mathematics
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.00 |