Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
Spanners for bounded tree-length graphs
Theoretical Computer Science
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
A distance approximating trees
Discrete Applied Mathematics
Packing and Covering δ-Hyperbolic Spaces by Balls
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Additive spanners for k-chordal graphs
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Distance approximating trees: complexity and algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Hi-index | 0.00 |