1. Aho, A., Hopcroft, J. K. Ullman, J. D.: The design and analysis of computer algorithms. Addison Wesley, Reading,MA, (1973)
2. Biedl, T., Kant, G.: A Better Euristic for Orthogonal Graph Drawings. Algorithms — ESA '94. Proceedings, Lectures Notes in Computer Science, Springer-Verlag 855 (1994) 24–35
3. Bjorken, J.D., Drell, S.D.: Quantum Electrodynamics. Mc-Graw Hill
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. the MIT Press, Cambridge,MA, (1990)
5. Di Battista, G., Liotta, G., Vargiu, F.: Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs. Lectures Notes in Computer Science, Springer-Verlag 709 (1993) 151–162