On claw-free asteroidal triple-free graphs
Discrete Applied Mathematics
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the Power of BFS to Determine a Graphs Diameter
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On Claw-Free Asteroidal Triple-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Finding a central vertex in an HHD-free graph
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Fast computation of empirically tight bounds for the diameter of massive graphs
Journal of Experimental Algorithmics (JEA)
Finding a central vertex in an HHD-free graph
Discrete Applied Mathematics
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximating the diameter of planar graphs in near linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |