Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
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
Discrete Applied Mathematics
Analysis of Topology Aggregation techniques for QoS routing
ACM Computing Surveys (CSUR)
Approximation algorithms for embedding general metrics into trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Spanners for bounded tree-length graphs
Theoretical Computer Science
The zoo of tree spanner problems
Discrete Applied Mathematics
Computing a minimum-dilation spanning tree is NP-hard
Computational Geometry: Theory and Applications
Combinatorial network abstraction by trees and distances
Theoretical Computer Science
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
Discrete Applied Mathematics
Additive spanners for k-chordal graphs
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Computing geometric minimum-dilation graphs is NP-hard
GD'06 Proceedings of the 14th international conference on Graph drawing
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms
Discrete Applied Mathematics
Spanners of bounded degree graphs
Information Processing Letters
Complexity results for the spanning tree congestion problem
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Journal of Computer and System Sciences
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Sparse geometric graphs with small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Combinatorial network abstraction by trees and distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A linear time algorithm for constructing tree 4-spanner in 2-trees
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Max-stretch reduction for tree spanners
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
| Hi-index | 0.00 |