\begin{thebibliography}{10}

\bibitem{BLAZ64}
J.~Bla\u{z}ek and M.~Koman.
\newblock A minimal problem concerning complete plane graphs.
\newblock In M.~Fiedler, editor, {\em Theory of Graphs and its Applications},
  pages 113--117. Academic Press, New York, 1964.

\bibitem{CHAN87}
K.C. Chang.
\newblock Efficient algorithms for layer assignment problems.
\newblock {\em IEEE Trans. on Computer Aided Design of Integrated Circuits and
  Systems}, 6(1):67--71, January 1987.

\bibitem{CHAR86}
G.~Chartrand and L.~Lesniak.
\newblock {\em Graphs and Digraphs}.
\newblock Wadsworth \& Brooks/Cole Advanced Books \& Software, Monterey, CA,
  2nd. edition, 1986.

\bibitem{DAVI91}
L.~Davis, editor.
\newblock {\em Handbook of Genetic Algorithms}.
\newblock Van Nostrand Reinhold, New York, 1991.

\bibitem{exoo}
G.~Exoo.
\newblock Private Communication, results to be submitted for publication soon.

\bibitem{GARE82}
M.R. Garey and D.S. Johnson.
\newblock {\em Computers and Intractability: A Guide to the Theory of
  {NP-Completeness}}.
\newblock W.H. Freeman and Company, New York, 1982.

\bibitem{GOLD89}
D.E. Goldberg.
\newblock {\em Genetic Algorithms in Search, Optimization, and Machine
  Learning}.
\newblock Addison-Wesley, Reading, MA, 1989.

\bibitem{GUY72}
R.K. Guy.
\newblock A minimal problem concerning complete plane graphs.
\newblock In Y.~Alavi, D.R. Lick, and A.T. White, editors, {\em Graph Theory
  and Applications}, pages 111--124, Berlin, 1972. Springer-Verlag.

\bibitem{GUY92}
R.K. Guy, November 24, 1992.
\newblock Private Communication with R.P. Pargas.

\bibitem{HINE92}
J.~Hines, J.T. Thorpe, and K.B. Winiecki.
\newblock Solving quadratic assignment problems through parallel genetic
  algorithms.
\newblock Unpublished Tech Report, Clemson University, May 1992.

\bibitem{JOHN82}
D.S. Johnson.
\newblock The {NP-Completeness} column: an ongoing guide.
\newblock {\em Journal of Algorithms}, 3(1):89--99, March 1982.

\bibitem{WANG89}
Y.~Wang, R.C.T. Lee, and J.S. Chang.
\newblock The number of intersections between two rectangular paths.
\newblock {\em IEEE Trans. on Computers}, 38(11):1564--1571, November 1989.

\end{thebibliography}
