Irith Hartman

Irith Ben-Arroyo Hartman is a Visiting  Professor of Computer Science at NYU Shanghai. Prior to joining NYU Shanghai, Hartman was the scientific coordinator at the Caesarea Rothschild Institute for Interdisciplinary Applications of Computer Science, at the University of Haifa, Israel.  She was also a lecturer at the University of Haifa, and a visiting researcher at the Indian Institute of Science in Bangalore India.  Her research interests involve pure graph theory, as well as applications in networks.

Select Publications

• L. Knapen, I. Ben-Arroyo Hartman, D. Keren, A.Yasar, S. Cho, T. Bellemans, D. Janssens, G. Wets , “Scalability issues in optimal assignment for carpooling” , Journal of Computer and System Sciences 81 (2015), 568-584
• I. Ben-Arroyo Hartman, D. Keren, A. Abu Dbai, E. Cohen, L. Knapen,  A. U. H Yasar, and D. Janssens, "Theory and practice in large carpooling problems", The 5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014), Procedia Computer Science,Volume 32, 2014, Pages 339–347
• L. Knapen, I. Ben-Arroyo Hartman, D. Keren, A.Yasar, S. Cho, T. Bellemans, D. Janssens, G. Wets, "Estimating scalability issues while  finding an optimal assignment for carpooling", The 4th International Conference on Ambient Systems, Networks and Technologies (ANT-2013).
• M. Hadad, S. Kraus, I. B-A. Hartman, and A. Rosenfeld, “Group planning with time constraints”, Annals of Mathematics and Artificial Intelligence, Volume 69, Issue 3 (November 2013),  243-291
• E. Berger and I. Ben-Arroyo Hartman, “A unified approach to known and unknown cases of Berge's conjecture”, Journal of Graph Theory 71(3):317-330 (2012)

Education

• D.Sc., Mathematics
  Technion
• M. Math., Mathematics
  University of Waterloo