Integer and combinatorial optimization
Integer and combinatorial optimization
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Journal of Computer and System Sciences
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Optimal File Sharing in Distributed Networks
SIAM Journal on Computing
Randomized algorithms
Improved approximations of packing and covering problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Service-constrained network design problems
Nordic Journal of Computing
Routing on butterfly networks with random faults
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multicasting in heterogeneous networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Packet routing with arbitrary end-to-end delay requirements
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth 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
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Source routing and scheduling in packet networks
Journal of the ACM (JACM)
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Online packet-routing in grids with bounded buffers
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Approximation algorithms for conflict-free vehicle routing
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.00 |