Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Approximation algorithms for structured communication problems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science
Efficient Communication Schemes
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Virtual Path Layout in ATM Path with Given Hop Count
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
Discrete Applied Mathematics
Directed virtual path layouts in ATM networks
Theoretical Computer Science - Special issue: Distributed computing
Symmetry properties of chordal rings of degree 3
Discrete Applied Mathematics
Problem Collection of the DIMANET Mátraháza Workshop, 22–28 October 1995
Combinatorics, Probability and Computing
Expanding and forwarding parameters of product graphs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Virtual network embedding in the cycle
Discrete Applied Mathematics
Forwarding indices of folded n-cubes
Discrete Applied Mathematics
The forwarding indices of augmented cubes
Information Processing Letters
On the restricted forwarding index problem in communication networks
Computers & Mathematics with Applications
Forwarding index of cube-connected cycles
Discrete Applied Mathematics
Forwarding and optical indices of a graph
Discrete Applied Mathematics
Average distances and distance domination numbers
Discrete Applied Mathematics
On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes
Information Processing Letters
Echo: A peer-to-peer clustering framework for improving communication in DHTs
Journal of Parallel and Distributed Computing
Balancing traffic load using one-turn rectilinear routing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Volumes of 3d drawings of homogenous product graphs
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Gossiping and routing in second-kind Frobenius graphs
European Journal of Combinatorics
Discrete Applied Mathematics
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
European Journal of Combinatorics
| Hi-index | 0.05 |