Handbook of theoretical computer science (vol. A): algorithms and complexity
Handbook of theoretical computer science (vol. A): algorithms and complexity
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Online algorithms for selective multicast and maximal dense trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
On-line Resource Management with Applications to Routing and Scheduling
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |