1. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 493–500 (1997)
2. Avidor, A., Azar, Y., Sgall, J.: Ancient and new algorithms for load balancing in the L
p
norm. Algorithmica 441, 422–441 (2001)
3. Awerbuch, B., Azar, Y., Grove, E.F., Kao, M.-Y., Krishnan, P., Vitter, J.S.: Load balancing in the L
p
norm. In: Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 383–391 (1995)
4. Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57–66 (2005)
5. Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 331-337 (2005)