Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Bandwidth of Split and Circular Permutation Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
Approximation algorithms for embedding general metrics into trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
Discrete Applied Mathematics
Hardness and approximation of minimum distortion embeddings
Information Processing Letters
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms
Discrete Applied Mathematics
Computing graph spanners in small memory: fault-tolerance and streaming
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On spanners of geometric graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A linear time algorithm for constructing tree 4-spanner in 2-trees
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
| Hi-index | 0.00 |