New references related to Geometric Spanner Networks

• M. A. Abam, M. de Berg, and J. Gudmundsson.
  A simple and efficient kinetic spanner.
  To appear in SoCG 2008.
  
  
• M. A. Abam, M. de Berg, M. Farshi, and J. Gudmundsson.
  Region-fault tolerant geometric spanners.
  Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, 2007, pages 1-10.
  
  
• H.-K. Ahn, M. Farshi, C. Knauer, M. Smid, and Y. Wang.
  Dilation-optimal edge deletion in polygonal cycles.
  Proceedings of the 18th Annual International Symposium on Algorithms and Computation.
  Lecture Notes in Computer Science, volume 4835, Springer-Verlag, Berlin, 2007, pages 88-99.
  
  
• T. Asano, M. de Berg, O. Cheong, H. Everett, H. Haverkort, N. Katoh, and A. Wolff.
  Optimal spanners for axis-aligned rectangles.
  Computational Geometry: Theory and Applications, volume 30, 2005, pages 59-77.
  
  
• P. Bose, P. Carmi, S. Collette, and M. Smid.
  On the stretch factor of convex Delaunay graphs.
  
  
• P. Bose, P. Carmi, and M. Couture.
  Spanners of additively weighted point sets.
  To appear in SWAT 2008.
  
  
• P. Bose, P. Carmi, M. Couture, A. Maheshwari, M. Smid, and N. Zeh.
  Geometric spanners with small chromatic number.
  Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA 2007).
  Lecture Notes in Computer Science, volume 4927, Springer-Verlag, Berlin, 2008, pages 75-88.
  
  
• P. Bose, P. Carmi, M. Couture, A. Maheshwari, P. Morin, and M. Smid.
  Spanners of complete k-partite geometric graphs.
  Proceedings of the 8th Latin American Theoretical Informatics Symposium.
  Lecture Notes in Computer Science, volume 4957, Springer-Verlag, Berlin, 2008, pages 170-181.
  
  
• P. Bose, P. Carmi, M. Couture, M. Smid, and D. Xu.
  On a family of strong geometric spanners that admit local routing strategies.
  Proceedings of the 10th Workshop on Algorithms and Data Structures.
  Lecture Notes in Computer Science, volume 4619, Springer-Verlag, Berlin, 2007, pages 300-311.
  
  
• P. Bose, P. Carmi, M. Farshi, A. Maheshwari, and M. Smid.
  Computing the greedy spanner in near-quadratic time.
  To appear in SWAT 2008.
  
  
• P. Bose and M. Keil.
  On the stretch factor of the constrained Delaunay triangulation.
  Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006, pages 25-31.
  
  
• P. Bose, A. Lee, and M. Smid.
  On generalized diamond spanners.
  Proceedings of the 10th Workshop on Algorithms and Data Structures.
  Lecture Notes in Computer Science, volume 4619, Springer-Verlag, Berlin, 2007, pages 325-336.
  
  
• A. Dumitrescu, A. Ebbers-Baumann, A. Gr{\"u}ne, R. Klein, and G. Rote.
  On the geometric dilation of closed curves, graphs, and point sets.
  Computational Geometry: Theory and Applications, volume 36, 2007, pages 16-38.
  
  
• A. Dumitrescu and Cs. D. T{\'o}th.
  Light orthogonal networks with constant geometric dilation.
  Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science.
  Lecture Notes in Computer Science, volume 4393, Springer-Verlag, Berlin, 2007, pages 175-187.
  
  
• M. Farshi.
  A theoretical and experimental study of geometric networks.
  Ph.D. Thesis. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 2008.
  
  
• M. Farshi and J. Gudmundsson.
  On algorithms for computing the diameter of a t-spanner.
  Proceedings of the 37th Annual Iranian Mathematics Conference, 2006, pages 638-641.
  
  
• M. Farshi and J. Gudmundsson.
  Experimental study of geometric t-spanners: a running time comparison.
  Proceedings of the 6th Workshop on Experimental Algorithms.
  Lecture Notes in Computer Science, volume 4525, Springer-Verlag, Berlin, 2007, pages 270-284.
  
  
• M. F{\"u}rer and S. P. Kasiviswanathan.
  Spanners for geometric intersection graphs.
  Proceedings of the 10th Workshop on Algorithms and Data Structures.
  Lecture Notes in Computer Science, volume 4619, Springer-Verlag, Berlin, 2007, pages 312-324.
  
  
• A. Gr{\"u}ne and S. Kamali.
  On the density of iterated line segment intersections.
  Computational Geometry: Theory and Applications, volume 40, 2008, pages 23-36.
  
  
• R. Klein, C. Levcopoulos, and A. Lingas.
  A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.
  Computational Geometry: Theory and Applications, volume 34, 2006, pages 28-34.
  
  
• R. Klein and M. Kutz.
  The density of iterated crossing points and a gap result for triangulations of finite point sets.
  Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006, pages 264-272.
  
  
• C. Knauer and W. Mulzer.
  An exclusion region for minimum dilation triangulations.
  Proceedings of the 21st European Workshop on Computational Geometry, 2005, pages 33-36.
  
  
• C. Knauer and W. Mulzer.
  Minimum dilation triangulations.
  Technical Report B-05-06, Fachbereich Mathematik und Informatik, Freie Universit{\"a}t Berlin, 2005.
  
  
• D. Russel and L. Guibas.
  Exploring protein folding conformations using spanners.
  Pacific Symposium on Biocomputing, 2005, pages 40-51.
  
  
• Y. Yang, Y. Zhu, J. Xu, and N. Katoh.
  Geometric spanner of segments.
  Proceedings of the 18th Annual International Symposium on Algorithms and Computation.
  Lecture Notes in Computer Science, volume 4835, Springer-Verlag, Berlin, 2007, pages 75-87.