1. Multilayer grid embeddings for VLSI;Aggarwal;Algorithmica,1991
2. Universal 3-dimensional visibility representations for graphs;Alt;Comput. Geom.,1998
3. B. Baetz, D.R. Wood, Brooks’ vertex-colouring theorem in linear time, See Technical Report CS-AAG-2001-05, Basser Department of Computer Science, The University of Sydney, 2001, submitted for publication.
4. T.C. Biedl, Heuristics for 3D-orthogonal graph drawings, Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, Universiteit Twente, Netherlands, 1995, pp. 41–44.
5. Three approaches to 3D-orthogonal box-drawings;Biedl,1998