\begin{thebibliography}{10}

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

\bibitem{cottingham:dissertation}
J.~Cottingham, {\em Thrackles, Surfaces, and Maximum Drawing of Graphs}, PhD
  thesis, Clemson, University, Clemson, SC 29634, August 1993.

\bibitem{dyck:1888}
W.~Dyck, {\em Beitr\"{a}ge zur analysis situs}, Math. Ann., {\bf 32} (1888),
  pp.~457--512.

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

\bibitem{eg:cnog}
P.~Erd\"{o}s and R.~Guy, {\em Crossing numbers of graphs}, in Graph Theory and
  Applications, {Y. Alavi, et al.}, ed., Springer-Verlag, New York, 1973,
  pp.~111--124.

\bibitem{gj83:cninpc}
M.~Garey and D.~Johnson, {\em Crossing number is {NP-Complete}}, SIAM J. of
  Alg. Disc. Meth., {\bf 4} (1983), pp.~312--316.

\bibitem{PVM:book}
A.~Geist, A.~Beguelin, J.~Dongarra, W.~Jiang, R.~Manchek, and V.~Sunderam, {\em
  PVM: Parallel Virtual Machine -- A User's guide and tutorial for networked
  parallel computing}, MIT Press, Cambridge, MA, 1994.

\bibitem{GUY72}
R.~Guy, {\em A minimal problem concerning complete plane graphs}, in Graph
  Theory and Applications, Y.~Alavi, D.~Lick, and A.~White, eds., Berlin, 1972,
  Springer-Verlag, pp.~111--124.

\bibitem{ghprs:citcg}
R.~Guy, H.~Harborth, B.~Piazza, R.~Ringeisen, and S.~Stueckle, {\em Crossings
  in the complete graph}.
\newblock preprint.

\bibitem{hh96:apafctmcnoag}
F.~C. Harris, Jr. and C.~R. Harris, {\em A proposed algorithm for calculating
  the minimum crossing number of a graph}, in Proceedings of the Eighth
  Quadrennial International Conference on Graph Theory, Combinatorics,
  Algorithms, and Applications, Y.~Alavi, A.~J. Schwenk, and R.~L. Graham,
  eds., Kalamazoo, Michigan, June 1996, Western Michigan University.

\bibitem{heffter:1891}
L.~Heffter, {\em \"{U}ber das problem der nachbargebiete}, Math. Ann., {\bf 38}
  (1891), pp.~477--508.

\bibitem{kggk:book}
V.~Kumar, A.~Grama, A.~Gupta, and G.~Karypis, {\em Introduction to Parallel
  Computing: Design and Analysis of Algorithms}, The Benjamin/Cummings
  Publishing Company, Inc., Redwood City, CA, 1994.

\bibitem{lovegrove:masters}
C.~Lovegrove, {\em Crossing numbers of permutation graphs}, Master's thesis,
  Clemson University, Clemson, SC 29634, May 1988.

\bibitem{lr:cnopg}
C.~Lovegrove and R.~Ringeisen, {\em Crossing numbers of permutation graphs},
  Congr. Numer., {\bf 67} (1988), pp.~125--135.

\bibitem{qd85:ubspbbbba}
M.~Quinn and N.~Deo, {\em An upper bound for the speedup of parallel best-bound
  branch-and-bound algorithms}, BIT, {\bf 26} (1986), pp.~35--43.

\bibitem{th96:apsoaffmormcp}
J.~Thorpe and F.~Harris, Jr., {\em A parallel stochastic optimization algorithm
  for finding mappings of the rectilinear minimal crossing problem}, Ars Comb.,
   ({\it to appear}).

\bibitem{turan:1977}
P.~Turan, {\em A note of welcome}, Journal of Graph Theory, {\bf 1} (1977),
  pp.~7--9.

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

\end{thebibliography}
