Minimum-Width Grid Drawings of Plane Graphs

Convex drawings of graphs in two and three dimensions (preliminary version)

Proceedings of the twelfth annual symposium on Computational geometry

A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs

Information Processing Letters

Graph drawing algorithms

Algorithms and theory of computation handbook

Orthogonal cartograms with few corners per face

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Orthogonal cartograms with at most 12 corners per face

Computational Geometry: Theory and Applications