Before revision:  Since such issues can be solved by scaling up the drawingby a suitable factor , we present constructive techniques that yield more compact upper bounds for the area requirements of disk-link drawings for several (planar and nonplanar) graph classes, including proper level, bounded bandwidth, complete, planar and outerplanar graphs .
After revision:  Since such issues can be solved by scaling up the drawingby a suitable factor , we present constructive techniques that yield more compact upper bounds for the area requirements of disk-link drawings for several (planar and nonplanar) graph classes, including bounded bandwidth, complete, planar and outerplanar graphs .