1. A. Avior, T. Calamoneri, S. Even, A. Litman, A.L. Rosenberg, A tight layout of the butterfly network, theory of computing systems, Math. Systems Theory 31 (1998) 475–487, Preliminary version in Proc. 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA ‘96), ACM Press, New York, 1996, pp. 170–175.
2. T. Biedl, Heuristic for 3D orthogonal graph drawings. Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, 1995, pp. 41–44.
3. T. Calamoneri, A. Sterbini, Drawing 2-, 3- and 4-colorable Graphs in O(n2) volume, Proc. Graph Drawing ‘96 (GD ‘96), Lectures Notes in Comp. Sci., Vol. 1190, Springer, Berlin, 1996, pp. 53–62. Preliminary version in Inform. Proc. Lett. 63 (1997) 97–102.