\begin{thebibliography}{10}
\parsep=0pt
\parskip=0pt
%\itemsep=0pt

\bibitem{br80:otcnopocagoof}
L.~Beineke and R.D. Ringeisen.
\newblock On the crossing number of products of cycles and graphs of order
  four.
\newblock {\em J. Graph Theory}, {\bf 4}:145--155, 1980.

\bibitem{bienstock91:sphcnp}
D.~Bienstock.
\newblock Some provably hard crossing number problems.
\newblock {\em Disc. Comput. Geom.}, {\bf 6}:443--459, 1991.

\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{cottingham:dissertation}
J.E. Cottingham.
\newblock {\em Thrackles, Surfaces, and Maximum Drawing of Graphs}.
\newblock PhD thesis, Clemson, University, Clemson, SC 29634, August 1993.

\bibitem{dr95:tcnoc4xc4}
A.M. Dean and R.B. Richter.
\newblock The crossing number of ${C}_{4} \times {C}_{4}$.
\newblock {\em J. Graph Theory}, {\bf 19}(1):125--129, 1995.

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

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

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

\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{ghprs:citcg}
R.~Guy, H.~Harborth, B.~Piazza, R.~Ringeisen, and S.~Stueckle.
\newblock Crossings in the complete graph.
\newblock preprint.

\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{gj69:ttcnokmn}
R.K. Guy and T.A. Jenkyns.
\newblock The torroidal crossing number of ${K}_{m,n}$.
\newblock {\em J. Combin. Theory}, {\bf 6}:235--250, 1969.

\bibitem{hks73:tgwahcn}
F.~Harary, P.C. Kainen, and A.J. Schwenk.
\newblock Torroidal graphs with arbitrarily high crossing numbers.
\newblock {\em Nanta Math.}, {\bf 6}:58--67, 1973.

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

\bibitem{kleitman71:tcnok5n}
D.J. Kleitman.
\newblock The crossing number of ${K}_{5,n}$.
\newblock {\em J. Combin. Theory}, {\bf 9}:315--323, 1971.

\bibitem{krs96:tcnoc5xcn}
M.~Klesc, R.B. Richter, and I.~Stobert.
\newblock The crossing number of ${C}_{5} \times {C}_{n}$.
\newblock {\em J. Graph Theory}, {\bf 22}(3):239--243, 1996.

\bibitem{leighton83:ciivlsi}
F.T. Leighton.
\newblock {\em Complexity Issues in {VLSI}}.
\newblock MIT Press, Cambridge, MA, 1983.

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

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

\bibitem{rs96:tcnok3nias}
R.B. Richter and J.~Siran.
\newblock The crossing number of ${K}_{3,n}$ in a surface.
\newblock {\em J. Graph Theory}, {\bf 21}(1):51--54, 1996.

\bibitem{rt95:iocsatcnoc5xc5}
R.B. Richter and C.~Thomassen.
\newblock Intersection of curve systems and the crossing number of ${C}_{5}
  \times {C}_{5}$.
\newblock {\em Discrete Comput. Geom.}, {\bf 13}:149--159, 1995.

\bibitem{rb78:tcnoc3xcn}
R.D. Ringeisen and L.W. Beineke.
\newblock The crossing number of ${C}_{3} \times {C}_{n}$.
\newblock {\em J. Combin. Theory, Ser. B}, {\bf 24}:134--136, 1978.

\bibitem{thomassen88:rdog}
C.~Thomassen.
\newblock Rectilinear drawings of graphs.
\newblock {\em J. Graph Theory}, {\bf 12}:335--341, 1988.

\bibitem{th96:apsoaffmormcp}
J.T. Thorpe and F.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{turan:1977}
P.~Turan.
\newblock A note of welcome.
\newblock {\em J. Graph Theory}, {\bf 1}:7--9, 1977.

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

\end{thebibliography}
