1. R. Adler and Y. Azar. Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In Proceedings of 10th SODA, pages 1–10, 1999.
2. N. Alon, U. Arad, and Y. Azar. Independent sets in hypergraphs with applications to routing via fixed paths. In Proceedings of 2nd APPROX, pages 16–27, 1999.
3. Baruch Awerbuch, Yossi Azar, and Serge Plotkin. Throughput-competitive online routing. In Proc. 34th Symp. Foundations of Computer Science, pages 32–40, 1993.
4. Baruch Awerbuch, Yair Bartal, Amos Fiat, and Adi Rosén. Competitive non-preemptive call control. In Proc. 5th Symp. on Discrete Algorithms, pages 312–320, 1994.
5. Baruch Awerbuch, Rainer Gawlick, Tom Leighton, and Yuval Rabani. Online admission control and circuit routing for high performance computing and communication. In Proc. 35th Symp. Foundations of Computer Science, pages 412–423, 1994.