Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for fault-tolerant routing in circuit switched networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
The hyperring: a low-congestion deterministic data structure for distributed environments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The effect of faults on network expansion
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Optimal oblivious routing on d-dimensional meshes
Theoretical Computer Science - Foundations of software science and computation structures
Improved bounds for the unsplittable flow problem
Journal of Algorithms
A family of collusion resistant symmetric key protocols for authentication
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Theory of communication networks
Algorithms and theory of computation handbook
Universal packet routing with arbitrary bandwidths and transit times
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Approximation algorithms for conflict-free vehicle routing
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
A simpler proof for O(congestion+dilation) packet routing
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Constraint satisfaction, packet routing, and the lovasz local lemma
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |