Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks
IEEE Transactions on Computers
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
A characterization of networks supporting linear interval routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science
Routing in distributed networks: overview and open problems
ACM SIGACT News
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximate Distance Labeling Schemes
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Characterization of networks supporting multi-dimensional linear interval routing schemes
Theoretical Computer Science
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Planar graphs, via well-orderly maps and trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.01 |