1. Alt, M.; Aßmann, U; Someren, H: Cosy Compiler Phase Embedding with the CoSy Compiler Model, in Fritzson, P.A.: Compiler Construction, 5th International Conference, CC '94, Proceedings, Lecture Notes in Computer Science 786, pp. 278–293, Springer Verlag 1994
2. Battista, G.D.; Eades, P.; Tamassia, R.: Algorithms for Drawing Graphs: An Annotated Bibliography, avail. ftp at wilma.cs.brown.edu, /pub/gdbiblio.tex 1993; a prev. version was avail. as technical report CS-89-09, Brown University, Department of Computer Science, Providence RI, Oct. 1989
3. Bentley, J.L.; Ottmann, T.A.: Algorithms for Reporting and Counting Geometric Intersections, IEEE Trans. on Computers, Vol. C 28, No. 9, pp. 643–647, 1979
4. Brandenburg, F.J.: Nice Drawings of Graphs are Computationally Hard, Visualization in Human Computer Interaction, Lecture Notes in Computer Science 439, pp. 1–15, Springer Verlag 1990
5. Eades, P.; Wormald N.: The median heuristic for drawing 2-layers networks, technical report 69, Department of Computer Science, University of Queensland, 1986