\begin{thebibliography}{1}

\bibitem{AlKaWo:97}
A.~ALFAKIH, A.~KHANDANI, and H.~WOLKOWICZ.
\newblock Solving {E}uclidean distance matrix completion problems via
  semidefinite programming.
\newblock {\em Comput. Optim. Appl.}, 12(1-3):13--30, 1999.
\newblock Computational optimization---a tribute to Olvi Mangasarian, Part I.

\bibitem{AlWo:98}
A.~ALFAKIH and H.~WOLKOWICZ.
\newblock On the embeddability of weighted graphs in {E}uclidean spaces.
\newblock Technical Report CORR 98-12, University of Waterloo, 1998.

\bibitem{AlWo:99}
A.~ALFAKIH and H.~WOLKOWICZ.
\newblock Matrix completion problems.
\newblock In H.~Wolkowicz, R.~Saigal, and L.~Vandenberghe, editors, {\em
  HANDBOOK OF SEMIDEFINITE PROGRAMMING: Theory, Algorithms, and Applications},
  page~11. Kluwer Academic Publishers, Boston, MA, 2000.

\bibitem{GrJoSaWo:84}
B.~GRONE, C.R. JOHNSON, E.~MARQUES~de SA, and H.~WOLKOWICZ.
\newblock Positive definite completions of partial {H}ermitian matrices.
\newblock {\em Linear Algebra Appl.}, 58:109--124, 1984.

\bibitem{HeReVaWo:93}
C.~HELMBERG, F.~RENDL, R.~J. VANDERBEI, and H.~WOLKOWICZ.
\newblock An interior-point method for semidefinite programming.
\newblock {\em SIAM J. Optim.}, 6(2):342--361, 1996.

\bibitem{JoKrWo:95}
C.R. JOHNSON, B.~KROSCHEL, and H.~WOLKOWICZ.
\newblock An interior-point method for approximate positive semidefinite
  completions.
\newblock {\em Comput. Optim. Appl.}, 9(2):175--190, 1998.

\end{thebibliography}