1. The Design and Analysis of Computer Algorithms;Aho,1973
2. A better heuristic for orthogonal graph drawings;Biedl,1994
3. Does cubicity help to solve problems;Calamoneri,1997
4. T. Calamoneri, S. Jannelli, R. Petreschi, Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs, Tech. Rep. Dept. Comp. Sci. Univ. of Rome “La Sapienza,” 1988
5. A parallel algorithm for orthogonal grid drawings of cubic graphs;Calamoneri,1995