disk.bbl
\newcommand{\etalchar}[1]{$^{#1}$}
\providecommand{\bysame}{\leavevmode\hbox to3em{\hrulefill}\thinspace}
\providecommand{\MR}{\relax\ifhmode\unskip\space\fi MR }
% \MRhref is called by the amsart/book/proc definition of \MR.
\providecommand{\MRhref}[2]{%
  \href{http://www.ams.org/mathscinet-getitem?mr=#1}{#2}
}
\providecommand{\href}[2]{#2}
\begin{thebibliography}{ADM{\etalchar{+}}95}

\bibitem[ACC{\etalchar{+}}96]{arikati}
Srinivasa~R. Arikati, Danny~Z. Chen, L.~Paul Chew, Gautam Das, Michiel H.~M.
  Smid, and Christos~D. Zaroliagis, \emph{Planar spanners and approximate
  shortest path queries among obstacles in the plane}, {ESA}~'96, Lecture Notes
  in Computer Science, vol. 1136, Springer, 25--27~September 1996,
  pp.~514--528.

\bibitem[ACIM99]{aingworth}
Donald Aingworth, Chandra Chekuri, Piotr Indyk, and Rajeev Motwani, \emph{Fast
  estimation of diameter and shortest paths (without matrix multiplication)},
  SIAM Journal on Computing \textbf{28} (1999), no.~4, 1167--1181.

\bibitem[ADM{\etalchar{+}}95]{arya}
Sunil Arya, Gautam Das, David~M. Mount, Jeffrey~S. Salowe, and Michiel Smid,
  \emph{Euclidean spanners: Short, thin, and lanky}, Proceedings of the 27th
  Annual {ACM} Symposium on the Theory of Computing, ACM, 1995, pp.~489--498.

\bibitem[AESW91]{pankaj}
Pankaj~K. Agarwal, Herbert Edelsbrunner, Orfried Schwarzkopf, and Emo Welzl,
  \emph{Euclidean minimum spanning trees and bichromatic closest pairs},
  Discrete Comput. Geom. \textbf{6} (1991), 407--422.

\bibitem[AM95]{agg}
Pankaj~K. Agarwal and Jir{\'\i} Matou{\v{s}}ek, \emph{Dynamic half-space range
  reporting and its applications}, Algorithmica \textbf{13} (1995), no.~4,
  325--345.

\bibitem[Cha99]{chan}
Timothy~M. Chan, \emph{Geometric applications of a randomized optimization
  technique}, Discrete \& Computational Geometry \textbf{22} (1999), no.~4,
  547--567.

\bibitem[CK95]{callahan}
Paul~B. Callahan and S.~Rao Kosaraju, \emph{A decomposition of multidimensional
  point sets with applications to {$K$}-nearest-neighbors and {$N$}-body
  potential fields}, J. ACM \textbf{42} (1995), no.~1, 67--90.

\bibitem[Epp04]{epps}
David Eppstein, \emph{Testing bipartiteness of geometric intersection graphs},
  SODA '04 (Philadelphia, PA, USA), SIAM, 2004, pp.~860--868.

\bibitem[GJS99]{gupta}
Prosenjit Gupta, Ravi Janardan, and Michiel Smid, \emph{Algorithms for some
  intersection searching problems involving circular objects}, International
  Journal of Mathematical Algorithms \textbf{1} (1999), 35--52.

\bibitem[GZ05]{gao}
Jie Gao and Li~Zhang, \emph{Well-separated pair decomposition for the unit-disk
  graph metric and its applications}, SIAM Journal on Computing \textbf{35}
  (2005), no.~1, 151--169.

\bibitem[HMR{\etalchar{+}}98]{marathe}
Harry~B. Hunt, Madhav~V. Marathe, Venkatesh Radhakrishnan, S.~S. Ravi,
  Daniel~J. Rosenkrantz, and Richard~Edwin Stearns, \emph{{NC}-approximation
  schemes for {NP}- and {PSPACE}-hard problems for geometric graphs}, J.
  Algorithms \textbf{26} (1998), no.~2, 238--274.

\bibitem[KLN99]{krznaric}
Drago Krznaric, Christos Levcopoulos, and Bengt~J. Nilsson, \emph{Minimum
  spanning trees in d dimensions}, Nord. J. Comput \textbf{6} (1999), no.~4,
  446--461.

\bibitem[KMR01]{krumke}
S.~O. Krumke, M.~V. Marathe, and S.~S. Ravi, \emph{Models and approximation
  algorithms for channel assignment in radio networks}, Wireless Networks
  \textbf{7} (2001), no.~6, 575--584.

\bibitem[KZ03]{kuhn}
Fabian Kuhn and Aaron Zollinger, \emph{Ad-hoc networks beyond unit disk
  graphs}, DIALM-POMC, 2003, pp.~69--78.

\bibitem[Li03]{xiang}
Xiang-Yang Li, \emph{Algorithmic, geometric and graphs issues in wireless
  networks}, Wireless Communications and Mobile Computing \textbf{3} (2003),
  no.~2, 119--140.

\bibitem[Luk99]{luc}
Thomas Lukovszki, \emph{New results on geometric spanners and their
  applications}, PhD. thesis, {U}niversity of {P}aderborn (1999).

\bibitem[LWW01]{li}
Xiang-Yang Li, Peng-Jun Wan, and Yu~Wang, \emph{Power efficient and sparse
  spanner for wireless ad hoc networks}, IEEE International Conference on
  Computer Communications and Networks, 2001, pp.~564--567.

\bibitem[MC80]{mead}
Mead and Conway, \emph{Introduction to {VLSI} system}, Addison-Wesley, Reading,
  1980.

\bibitem[Raj02]{rajaraman}
Rajmohan Rajaraman, \emph{Topology control and routing in ad hoc networks: {A}
  survey}, SIGACT News \textbf{33} (2002), 60--73.

\bibitem[Sha85]{sharir}
M.~Sharir, \emph{Intersection and closest-pair problems for a set of planar
  discs}, SIAM Journal on Computing \textbf{14} (1985), 448--468.

\bibitem[SW98]{smith}
Warren~D. Smith and Nicholas~C. Wormald, \emph{Geometric separator theorems \&
  applications}, FOCS, 1998, pp.~232--243.

\bibitem[Yao82]{yao}
Andrew Chi-Chih Yao, \emph{On constructing minimum spanning trees in
  {$k$}-dimensional spaces and related problems}, SIAM Journal on Computing
  \textbf{11} (1982), no.~4, 721--736.

\end{thebibliography}
