REFERENCES 315
[Ma88] E. M¨akinen. On Circular Layouts. In Intl. Jrnl of Computer Mat hema tics ,
pages 29–37, 24(1988).
[Mit79] S. Mitchell. Linear algori th ms to recognize outerplanar and maximal out-
erplanar graph s. Information Processing Letters, pages 229–232, 9(5) 1979.
[MKNF87] S. Masu da, T. Kashiwabara, K. Nakajima, and T. Fujisawa. On the NP-
completeness of a computer network layout problem. In Proc. IEEE 1987
International Symposium on Circuits and Systems, Philadelph ia, PA, pages
292–295, 1987.
[PS85] F. P. Preparata and M. I . Shamos. Computationa l Geometry: An Intro-
duction. Springer-Verlag, New York, NY, 1985.
[Pur97] Helen Purchase. Which aesthetic has the greatest effect on human under-
standing? In GD ’97, LN CS 1353, pages 248–261, ...