Fields of interest: ON-LINE ALGORITHMS; APPROXIMATION METHODS; LOAD BALANCING; ROUTING SCHEMES; PROBABILISTIC METHODS; ALGORITHMIC GAME THEORY。 papers: Optimal Node Routing Y. Azar, Y. Chaiutin. Proc. 23rd STACS (2006), 596-607. The hardness of network design for unsplittable flow with selfish users Y. Azar, A. Epstein. Proc. of 3rd WAOA (2005), 41-54. Packet routing and information gathering in lines, rings and trees Y. Azar, R. Zachut. Proc. of 13th ESA (2005), 484-495. Admission control to minimize rejections and online set cover with repetitions N. Alon, Y. Azar, S. Gutner. Proc. of 17th SPAA (2005), 238-244. Collaborate with strangers To find own preferences B. Awerbuch, Y. Azar, Z. Lotker, B. Patt-Shamir, M. Tuttle. Proc. of 17th SPAA (2005), 263-269. Convex programming for scheduling unrelated parallel machines Y. Azar, A. Epstein. Proc. of 37th STOC (2005), 331-337. The price of routing unsplittable flow B. Awerbuch, Y. Azar, A. Epstein. Proc. of 37th STOC (2005), 57-66. Truthful approximation mechanisms for scheduling selfish related machines N. Andelman, Y. Azar, M. Sorani. Proc. of 22nd STACS (2005), 69-82. Maximizing throughput in multi-queue switches Y. Azar, A. Litichevskey. Proc. of 12th ESA (2004), 53-64. An improved algorithm for CIOQ switches Y. Azar, Y. Richter. Proc. of 12th ESA (2004), 65-76. All-Norm Approximation for Scheduling on Identical Machines Y. Azar, S. Taub. Proc. of 9th SWAT (2004), 298-310. The zero-one principle for switching networks Y. Azar, Y. Richter. Proc. of 36th STOC (2004), 64-71. A general approach to online network optimization problems N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, J. Naor. Proc. of 15th SODA (2004), 570-579. Tradeoffs in worst-case equilibria B. Awerbuch, Y. Azar, Y. Richter, D. Tsur. Proc. of 1st WAOA (2003), 41-52. Load balancing of temporary tasks in the l_p norm Y. Azar, A. Epstein, L. Epstein. Proc. of 1st WAOA (2003), 53-66. The online set cover problem N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, J. Naor. Proc. of 35th STOC (2003), 100-105. Optimal oblivious routing in polynomial time Y. Azar, E. Cohen, A. Fiat, H. Kaplan, H. R\"acke. Proc. of 35th STOC (2003), 383-388. Reducing truth-telling online mechanisms to online optimization B. Awerbuch, Y. Azar, A. Meyerson. Proc. of 35th STOC (2003), 503-510. Management of multi-queue switches in QoS networks Y. Azar, Y. Richter. Proc. of 35th STOC (2003), 82-89. Combining online algorithms for rejection and acceptance Y. Azar, A. Blum, Y. Mansour. Proc. of 15th SPAA (2003), 159-163. Minimizing total flow time and total completion time with immediate dispatching N. Avrahami, Y. Azar. Proc. of 15th SPAA (2003), 11-18. A generic scheme for building overlay networks in adversarial scenarios I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi, E. Pavlov. Proc. of 17th IPDPS (2003). Distributed error confinement Y. Azar, S. Kutten, B. Patt-Shamir. Proc. of 22nd PODC (2003), 33-42. All-norm approximation algorithms Y. Azar, L. Epstein, Y. Richter, G. Woeginger. Proc. of 8th SWAT (2002), 288-297. Temporary tasks assignment resolved A. Armon, Y. Azar, L. Epstein, O. Regev. Proc. of 13th SODA (2002), 116-124. The Multicast Bandwidth Advantage in Serving a Web Site Y. Azar, M. Feder, E. Lubetzky, D. Rajwan, N. Shulman. Proc. of 3rd NGC (2001), 88-99. Strongly polynomial algorithms for the unsplittable flow problem Y. Azar, O. Regev. Proc. of 8th IPCO (2001), 15-29.