SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computational geometry column 18
ACM SIGACT News
A necessary condition for a graph to be the visibility graph of simple polygon
Theoretical Computer Science
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms
Recognition and reconstruction of visibility graphs using a genetic algorithm
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
An improved algorithm for reconstructing a simple polygon from the visibility angles
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |