\begin{thebibliography}{10}

\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{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{bcfksss}
N.~J. Boden, D.~Cohen, R.~E. Felderman, A.~E. Kulawik, C.~L. Seitz, J.~N.
  Seizovic, and W.K. Si.
\newblock Myrinet -- a gigabit-per-second local area network.
\newblock {\em IEEE Micro}, 15(1):29--38, 1995.

\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{eg:cnog}
P.~Erd\"{o}s and R.~Guy.
\newblock Crossing number problems.
\newblock {\em The American Mathematical Monthly}, 80:52--58, January 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 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{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{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{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{lr96}
W.~B. Ligon and R.~B. Ross.
\newblock Implementation and performance of a parallel file system for high
  performance distributed applications.
\newblock In {\em Proceedings of the Fifth IEEE International Symposium on High
  Performance Distributed Computing}, pages 471--480. IEEE Computer Society
  Press, August 1996.

\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{pcfh}
F.~Petrini, S.~C. Coll, E.~Frachtenberg, and A.~Hoisie.
\newblock Performance evaluation of the quadrics interconnection network.
\newblock {\em Journal of Cluster Computing}, 2002.

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

\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{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{thomassen88:rdog}
C.~Thomassen.
\newblock Rectilinear drawings of graphs.
\newblock {\em J. Graph Theory}, {\bf 12}:335--341, 1988.

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

\bibitem{uam}
P.~Uthayopas, T.~Aungsakul, and J.~Maneesilp.
\newblock Building a parallel computer from cheap pcs: Smile cluster
  experience.
\newblock In {\em Proceedings of the Second Annual National Symposium on
  Computational Science and Engineering}, Bangkok, Thailand, 1998. National
  Science and Technology Development Agency.

\bibitem{wa:pptaaunwapc}
Barry Wilkinson and Michael Allen.
\newblock {\em Parallel Programming: Techniques and Applications Using
  Networked Workstations and Parallel Computers}.
\newblock Prentice Hall, Upper Saddle River, NJ, 1999.

\bibitem{Yelick93}
K.~Yelick.
\newblock Programming models for irregular applications.
\newblock {\em ACM SIGPLAN Notices}, 28(1):10, January 1993.

\end{thebibliography}
