Dr. Amitai Armon

Email: amitai dot armon at cs.tau.ac.il

---

I am a former Ph.D. student of the Tel-Aviv University School of Computer Science. My thesis advisor was Prof. Uri Zwick.

Fields of Interest

Exact and approximate algorithms for graph problems, both classic and new ; On-line algorithms ; Algorithmic game-theory.

Teaching:

• C programming - for Electrical Engineers (Spring 2008)
• C programming - for Chemistry students (Spring 2008)
• C programming - for Industrial Engineers (Fall 2008)
• C programming - for Mechanical Engineers (Fall 2008)
• C programming - for Chemistry students (Spring 2007)
• Algorithms (Fall 2007)
• C programming - for Industrial Engineers (Fall 2007)
• C programming - for Mechanical Engineers (Fall 2007)
• Algorithms (Spring 2006)
• C Programming (Spring 2006)
• C Programming (Fall 2006)
• Introduction to Computers and Programming (Summer 2005)
• Efficiency of Computations (Spring 2005)
• C Programming (Fall 2005)
• Efficiency of Computations (Spring 2004)
• Workshop on Algorithms and Data-Structures (Spring 2004)

Publications

· A. Armon, Y. Azar, L. Epstein, and O. Regev. “Temporary tasks assignment resolved”. Algorithmica, 36(3): 295-314, 2003. (A preliminary version appeared in the proceedings of SODA 2002)

· A. Armon, Y. Azar, L. Epstein, and O. Regev. "On-line restricted assignment of temporary tasks with unknown duration". Information Processing Letters, 85(2): 67-72, 2003.

· A. Armon and U. Zwick. “Multicriteria global minimum cuts”. Algorithmica, 46(1): 15-26, 2006. (A preliminary version appeared in the proceedings of ISAAC 2004).

· A. Armon, A. Avidor and O. Schwartz. "Cooperative TSP”. Proceedings of the 14^th Annual European Symposium on Algorithms, 41-50, 2006.

· A. Armon. On Min-Max r-Gatherings. Proceedings of the 5^th Workshop on Approximation and On-line Algorithms, 128-141, 2007.