On-line Competive Algorithms for Call Admission in Optical Networks

Approximating the throughput of multiple machines under real-time scheduling

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

On-line randomized call control revisited

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Efficient on-line communication in cellular networks

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures

Approximation algorithms for routing and call scheduling in all-optical chains and rings

Theoretical Computer Science

Competitive Analysis of On-line Randomized Call Control in Cellular Networks

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium

Maximizing the Number of Connections in Optical Tree Networks

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics

Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science

Online Call Admission in Optical Networks with Larger Demands

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms

Journal of Scheduling - Special issue: On-line algorithm part I

Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem

Journal of Scheduling - Special issue: On-line algorithm part I

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory

Deterministic on-line call control in cellular networks

Theoretical Computer Science

Deterministic online optical call admission revisited

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms