Updates for the Bibliography in the book Geometric Spanner Networks

• Page 483:
  
  P. K. Agarwal, R. Klein, C. Knauer, S. Langerman, P. Morin, M. Sharir, and M. Soss.
  Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D.
  Discrete & Computational Geometry, volume 39, 2008, pages 17-37.
  
  
• Pages 484-485:
  
  P. Bose, M. Smid, and D. Xu.
  Diamond triangulations contain spanners of bounded degree.
  Proceedings of the 17th International Symposium on Algorithms and Computation.
  Lecture Notes in Computer Science, volume 4288, Springer-Verlag, Berlin, 2006, pp. 173-182.
  
  
• Page 486:
  
  O. Cheong, H. Haverkort, and M. Lee.
  Computing a minimum-dilation spanning tree is NP-hard.
  Proceedings of the 13th Computing: The Australasian Theory Symposium.
  Conferences in Research and Practice in Information Technology, volume 65, Australian Computer Society Inc, Sydney, 2007, pp. 15-24.
  
  
• Page 487: The paper by Ebbers-Baumann, Gr{\"u}ne, and Klein (2004a) has appeared in a journal:
  
  A. Ebbers-Baumann, A. Gr{\"u}ne, and R. Klein.
  Geometric dilation of closed planar curves: New lower bounds.
  Computational Geometry: Theory and Applications, volume 37, 2007, pages 188-208.
  
  
• Page 487: The paper by Ebbers-Baumann, Gr{\"u}ne, Karpinski, Klein, Knauer, and Lingas has appeared in a journal:
  
  A. Ebbers-Baumann, A. Gr{\"u}ne, R. Klein, M. Karpinski, C. Knauer, and A. Lingas.
  Embedding point sets into plane graphs of small dilation.
  International Journal of Computational Geometry & Applications, volume 17, 2007, pages 201-230.
  
  
• Pages 487-488: The paper by Eppstein and Wortman has appeared in a journal:
  
  D. Eppstein and K. A. Wortman.
  Minimum dilation stars.
  Computational Geometry: Theory and Applications, volume 37, 2007, pages 27-37.
  
  For a follow-up paper, see: J. Augustine, D. Eppstein, and K. A. Wortman. Approximate weighted farthest neighbors and minimum dilation stars.
  
  
• Page 488:
  
  J. Gudmundsson and C. Knauer.
  Dilation and detours in geometric networks.
  Handbook of Approximation Algorithms and Metaheuristics (T. F. Gonzalez, editor), Chapman & Hall/CRC, Boca Raton, 2007, pp. 52-1 - 52-17.
  
  
• Page 489:
  
  J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid.
  Approximate distance oracles for geometric spanners.
  ACM Transactions on Algorithms, volume 4, 2008, Article 10.
  
  
• Page 490:
  
  R. Klein and M. Kutz.
  Computing geometric minimum-dilation graphs is NP-hard.
  Proceedings of the 14th International Symposium on Graph Drawing (GD 2006).
  Lecture Notes in Computer Science, volume 4372, Springer-Verlag, Berlin, 2007, pp. 196-207.