Complexity of network synchronization
Journal of the ACM (JACM)
Communication-time trade-offs in network synchronization
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new look at fault tolerant network routing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI
A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Tree Spanners for Subgraphs and Related Tree Covering Problems
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
The non-approximability of bicriteria network design problems
Journal of Discrete Algorithms
Spanners and message distribution in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
Discrete Applied Mathematics - Special issue: Max-algebra
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
A simple and efficient kinetic spanner
Proceedings of the twenty-fourth annual symposium on Computational geometry
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science
A simple and efficient kinetic spanner
Computational Geometry: Theory and Applications
Discrete Applied Mathematics
Additive spanners for k-chordal graphs
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms
Discrete Applied Mathematics
A linear time algorithm for constructing tree 4-spanner in 2-trees
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Distance approximating trees: complexity and algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Collective tree 1-spanners for interval graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Max-stretch reduction for tree spanners
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Collective tree spanners and routing in AT-free related graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |