Book Chapter
Experimental Study of Geometric t-Spanners: A Running Time Comparison
Mohammad Farshi and Joachim Gudmundsson
Lecture Notes in Computer Science, 2007, Volume 4525, Experimental Algorithms, Pages 270-284
Reference Work Entry
Geometric Dilation of Geometric Networks
2006; Dumitrescu, Ebbers-Baumann, Grüne, Klein, Knauer,
Rote
Rolf Klein
2008, Encyclopedia of Algorithms, Part 7, Pages 1-99
Journal Article
Fault-Tolerant Geometric Spanners
Artur Czumaj and Hairong Zhao
Discrete & Computational Geometry, 2004, Volume 32, Number 2, Pages 207-230
Book Chapter
Computing the Greedy Spanner in Near-Quadratic Time
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari and Michiel Smid
Lecture Notes in Computer Science, 2008, Volume 5124, Algorithm Theory – SWAT 2008, Pages 390-401
Book Chapter
Spanners of Complete
k
-Partite Geometric Graphs
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari and Pat Morin, et al.
Lecture Notes in Computer Science, 2008, Volume 4957, LATIN 2008: Theoretical Informatics, Pages 170-181
Book Chapter
NP-completeness results for minimum planar spanners
Ulrik Brandes and Dagmar Handke
Lecture Notes in Computer Science, 1997, Volume 1335, Graph-Theoretic Concepts in Computer Science, Pages 85-99
Reference Work Entry
Minimum
k
-Connected Geometric Networks
2000; Czumaj, Lingas
Artur Czumaj and Andrzej Lingas
2008, Encyclopedia of Algorithms, Part 12, Pages 1-99
Book Chapter
Constructing degree-3 spanners with other sparseness properties
Gautam Das and Paul J. Heffernan
Lecture Notes in Computer Science, 1993, Volume 762, Algorithms and Computation, Pages 11-20
Book Chapter
Additive Spanners for
k
-Chordal Graphs
Victor D. Chepoi, Feodor F. Dragan and Chenyu Yan
Lecture Notes in Computer Science, 2003, Volume 2653, Algorithms and Complexity, Page 635
Book Chapter
On the Power of the Semi-Separated Pair Decomposition
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi and Michiel Smid
Lecture Notes in Computer Science, 2009, Volume 5664, Algorithms and Data Structures, Pages 1-12