\begin{thebibliography}{10}

\bibitem{bett99}
G.~Di Battista, R.~Eades, P.~Tamassia, and I.G. Tollis.
\newblock {\em Graph Drawing: Algorithms for Visualization of Graphs}.
\newblock Prentice Hall, Upper Saddle river, NJ, 1st edition, 1999.

\bibitem{CHAR96}
G.~Chartrand and L.~Lesniak.
\newblock {\em Graphs and Digraphs}.
\newblock Chapman \& Hall/CRC, Boca Raton, FL, 3nd. edition, 1996.

\bibitem{edmo60:crps}
J.~Edmonds.
\newblock A combinatorial representation for polyhedral surfaces.
\newblock {\em Notices of the American Mathematical Society}, {\bf 7}:646,
  1960.

\bibitem{fort96:gip}
Scott Fortin.
\newblock The graph isomorphism problem.
\newblock Technical Report TR96-20, University of Alberta, July 1996.
\newblock www.cs.ualberta.ca/research/techreports /1996/TR96-20.php.

\bibitem{Fred06:otcnocg}
Judith~R. Fredrickson.
\newblock {\em On the Crossing Number of Complete Graphs: Growing Minimal K$_n$
  From Minimal K$_{n-1}$}.
\newblock PhD thesis, University of Nevada, Reno, NV, 2006.

\bibitem{fyh:atsrrfctcnok}
Judith~R. Fredrickson, Bei Yuan, and Frederick~C. Harris, Jr.
\newblock A time saving region restriction for calculating the crossing number
  of {K}$_{n}$.
\newblock {\em Congressus Numerantium}, {\bf 168}:145--158, May 2004.

\bibitem{gj83:cninpc}
M.R. Garey and D.S. Johnson.
\newblock Crossing number is {NP-complete}.
\newblock {\em SIAM J. of Alg. Disc. Meth.}, {\bf 4}:312--316, 1983.

\bibitem{Guy60:acp}
Richard~K. Guy.
\newblock A combinatorial problem.
\newblock {\em Nabla (Bulletin of the Malayan Mathematical Society)}, {\bf
  7}:68--72, 1960.

\bibitem{Guy69}
Richard~K. Guy.
\newblock The decline and fall of {Z}arankiewicz's theorem.
\newblock In Frank Harary, editor, {\em Proof Techniques in Graph Theory (Proc.
  Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968)}, pages 63--69.
  University of Michigan, 1969.

\bibitem{hh63:noccg}
Frank Harary and Anthony Hill.
\newblock On the number of crossings in a complete graph.
\newblock In {\em Proceedings of the Edinburgh Mathematical Society}, volume
  {\bf 13} 2nd Series, pages 333--338, London, 1963. Edinburgh Mathematical
  Society.

\bibitem{hh96:apafctmcnoag}
Frederick~C. Harris, Jr. and Cynthia~R. Harris.
\newblock A proposed algorithm for calculating the minimum crossing number of a
  graph.
\newblock In Yousef Alavi, Allen~J. Schwenk, and Ronald~L. Graham, editors,
  {\em Proceedings of the Eighth International Conference on Graph Theory,
  Combinatorics, Algorithms, and Applications}, volume~{\bf 2}, pages 469--478.
  Western Michigan University, June 1998.

\bibitem{Klei70:cnk5n}
Daniel~J. Kleitman.
\newblock The crossing number of {K}$_{5,n}$.
\newblock {\em Journal of Combinatorial Theory}, {\bf 9}:315--323, 1970.

\bibitem{lei83}
F.~T. Leighton.
\newblock {\em Complexity Issues in {VLSI}}.
\newblock MIT Press, 1983.

\bibitem{lei84:nlbtvlsi}
F.~T. Leighton.
\newblock New lower bound techniques for {VLSI}.
\newblock {\em Math. Systems Theory}, {\bf 17}:47--70, 1984.

\bibitem{m81:pgi}
Brendan~D. McKay.
\newblock Practical graph isomorphism.
\newblock {\em Congressus Numerantium}, {\bf 30}:45--87, 1981.

\bibitem{rt97:rbcnccbg}
R.~B. Richter and C.~Thomassen.
\newblock Relations between crossing numbers of complete and complete bipartite
  graphs.
\newblock {\em American Mathematical Monthly}, {\bf 104}:131--137, Feb. 1997.

\bibitem{sssv00:nlbbcnwa}
Farhad Shahrokhi, Ondrej Sykora, Laszlo~A. Szekely, and Vrt'o Imrich.
\newblock A new lower bound for the bipartite crossing number with
  applications.
\newblock {\em Theoretical Computer Science}, {\bf 245}:281--294, August 2000.

\bibitem{Tadj98:pcgvmcng}
Umid Tadjiev.
\newblock Parallel computation and graphical visualization of the minimum
  crossing number of a graph.
\newblock Master's thesis, University of Nevada, Reno, NV, 1998.

\bibitem{th97:pcmcng}
Umid Tadjiev and Frederick~C. Harris, Jr.
\newblock Parallel computation of the minimum crossing number of a graph.
\newblock {\em Proceedings of the Eighth SIAM Conference on Parallel Processing
  for Scientific Computing}, 1997.

\bibitem{Wood93:cogzcnc}
D.~R. Woodall.
\newblock Cyclic-order graphs and {Z}arankiewicz's crossing-number conjecture.
\newblock {\em Journal of Graph Theory}, {\bf 17}(6):137--145, 1993.

\bibitem{Yuan2004:gqstsrrccnkn}
Bei Yuan.
\newblock A generic queueing system and time saving region restrictions for
  calculating the crossing number of {K}$_{n}$.
\newblock Master's thesis, University of Nevada, Reno, NV, 2004.

\bibitem{ymfh:agqs}
Bei Yuan, Sean~C. Martin, Judith~R. Fredrickson, and Frederick~C. Harris, Jr.
\newblock A generic queuing system for computationally intensive problems.
\newblock {\em Congressus Numerantium}, {\bf 171}:193--206, May 2004.

\bibitem{Zara:ptcg}
K.~Zarankiewicz.
\newblock On a problem of {P. T}ur\'{a}n concerning graphs.
\newblock {\em Fundamenta Mathematicae}, {\bf 41}:137--145, 1954.

\end{thebibliography}
