Drawings of planar graphs with few slopes and segments
Computational Geometry: Theory and Applications
Tree Drawings on the Hexagonal Grid
Graph Drawing
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Minimum-segment convex drawings of 3-connected cubic plane graphs
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Drawing ordered (k - 1)-ary trees on k-grids
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Optimal polygonal representation of planar graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Hexagonal grid drawings: algorithms and lower bounds
GD'04 Proceedings of the 12th international conference on Graph Drawing
Drawing unordered trees on k-grids
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Orthogonal cartograms with at most 12 corners per face
Computational Geometry: Theory and Applications
Hi-index | 0.00 |