The drawability problem for minimum weight triangulations
Theoretical Computer Science
Computational Geometry: Theory and Applications
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Subdivision Drawings of Hypergraphs
Graph Drawing
Perturbations for Delaunay and weighted Delaunay 3D triangulations
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
An experimental study on generating planar graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Competitive routing in the half-θ6-graph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The three dimensional logic engine
GD'04 Proceedings of the 12th international conference on Graph Drawing
Approximate proximity drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Outerplanar graphs and delaunay triangulations
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Hi-index | 0.89 |