\begin{thebibliography}{10}

\bibitem{aak01}
O.~Aichholzer, F.~Aurenhammer, and H.~Krasser.
\newblock Enumerating order types for small point sets with applications.
\newblock In {\em Proc. 17th Ann. ACM Symp. Computational Geometry}, pages
  11--18, 2001.

\bibitem{oak:otcnocg}
O.~Aichholzer, F.~Aurenhammer, and H.~Krasser.
\newblock On the crossing number of complete graphs.
\newblock In {\em Proceeding of the $18^{th}$ annual symposium on Computational
  Geometry}, Barcelona, Spain, June 2002.

\bibitem{bdg:trcnok10}
A.~Brodsky, S.~Durocher, and E.~Gether.
\newblock The rectilinear crossing number of k10 is 62.
\newblock {\em The Electronic J. of Combinatorics}, 8, 2001.
\newblock Research Paper 23.

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

\bibitem{edmonds:1960}
J.~Edmonds.
\newblock A combinatorial representation for polyhedral surfaces.
\newblock {\em Notices Amer. Math. Soc.}, {\bf 7}:646, 1960.

\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}
R.K. Guy.
\newblock A combinatorial problem.
\newblock {\em Nabla (Bulletin of the Malayan Mathematical Society)}, 7:68--72,
  1960.

\bibitem{GUY72}
R.K. Guy.
\newblock Crossing numbers of 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{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 Quadrennial International Conference on Graph
  Theory, Combinatorics, Algorithms, and Applications}, Kalamazoo, Michigan,
  June 1996. Western Michigan University.

\bibitem{martin}
Sean~C. Martin.
\newblock A parallel queuing system for computationally intensive problems on
  medium to large beowulf clusters.
\newblock Master's thesis, University of Nevada, Reno, Reno, NV 89557, December
  2003.

\bibitem{pt:tpocn}
J.~Pach and G.~Toth.
\newblock Thirteen problems on crossing numbers.
\newblock {\em Geombinatorics}, 9:225--246, 2000.

\bibitem{pt:wcniia}
J.~Pach and G.~Toth.
\newblock Which crossing number is it, anyway?
\newblock {\em J. Combinatorial Theory B}, 80:225--246, 2000.

\bibitem{tadjiev}
Umid Tadjiev.
\newblock Parallel computation and graphical visualization of the minmum
  crossing number of a graph.
\newblock Master's thesis, University of Nevada, Reno, Reno, NV 89557, August
  1998.

\bibitem{th97:pcotmcnoag}
Umid Tadjiev and Frederick~C. Harris, Jr.
\newblock Parallel computation of the minimum crossing number of a graph.
\newblock In Michael Heath, Virginia Torczon, Greg Astfalk, Petter~E. Bjorstad,
  Alan~H. Karp, Charles~H. Koelbel, Vipin Kumar, Robert~F. Lucas, Layne~T.
  Watson, and David~E. Womble, editors, {\em Proc. of the $8^{th}$ SIAM Conf.
  on Parallel Process. for Sci. Comput.}, Minneapolis, Minnisota, March 1997.
  SIAM.

\bibitem{th96:apsoaffmormcp}
John~T. Thorpe and Frederick~C. Harris, Jr.
\newblock A parallel stochastic optimization algorithm for finding mappings of
  the rectilinear minimal crossing problem.
\newblock {\em Ars Comb.}, {\bf 43}:135--148, 1996.

\bibitem{youngs63}
J.~Youngs.
\newblock Minimal imbeddings and the genus of a graph.
\newblock {\em J. Math. Mech.}, 12:303--315, 1963.

\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 Submitted}, May 2004.

\end{thebibliography}
