1. Alon, N., Azar, Y., Woeginger, G. J., & Yadid, T. (1997). Approximation schemes for scheduling. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 493–500). ACM/SIAM.
2. Avidor, A., Azar, Y., & Sgall, J. (2001). Ancient and new algorithms for load balancing in the $$\ell _p$$ ℓ p norm. Algorithmica, 29, 422–441.
3. Azar, Y., & Epstein, A. (2005). Convex programming for scheduling unrelated parallel machines. In H. N. Gabow, & R. Fagin (Eds.), Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC) (pp. 331–337).
4. Azar, Y., & Taub, S. (2004). All-norm approximation for scheduling on identical machines. In T. Hagerup, & J. Katajainen (Eds.), Scandinavian Workshop on Algorithm Theory (SWAT). Lecture Notes in Computer Science (Vol. 3111, pp. 298–310). Berlin: Springer.
5. Azar, Y., Epstein, A., & Epstein, L. (2006). Load balancing of temporary tasks in the $$\ell _p$$ ℓ p norm. Theoretical Computer Science, 361(2–3), 314–328.