
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.
Exact and approximate algorithms for graph problems, both classic and new ; On-line algorithms ; Algorithmic game-theory.
· A. Armon, Y. Azar, L. Epstein, and O. Regev. “Temporary tasks assignment resolved”. Algorithmica, 36(3): 295-314, 2003. (Our preliminary version appeared in the Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 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. (Our preliminary
version appeared in the Proceedings of the International Symposium on Algorithms
and Computing, 2004)
· A. Armon, A. Avidor and O. Schwartz. "Cooperative TSP” . Theor. Comput. Sci. 411 (31-33): 2847-2863 (2010). (Our preliminary version appeared in the Proceedings of the European Symposium on Algorithms, 2006)
·
A. Armon. “On Min-Max
r-Gatherings”. Theor. Comput. Sci., in press. (Preliminary
version appeared in the Proceedings of the Workshop on Approximation and
On-line Algorithms, 2007).
·
A. Armon, I. Gamzu, and D. Segev. “Mobile Facility Location:
Combinatorial Filtering via Weighted Occupancy”. Submitted.