Dr. Elena Kleiman

Dr. Elena Kleiman

Dr. Elena Kleiman

M213
מחלקה: Software Engineering
תפקיד נוכחי: Senior Lecturer

Education :

Ph.D. 2008-2012, Department of Mathematics, University of Haifa.

M.Sc. 2004-2007, (with Distinct Honors) Mathematics and Computer Science, Department of Mathematics, University of Haifa

B.A. 1999-2002, Mathematics and Computer Science, Department of Mathematics, University of Haifa.

Research Interests
  • 1. Design and analysis of algorithms
  • 2. Online and approximation algorithms
  • 3. Packing and scheduling problems
  • 4. Algorithmic game theory

Refereed Papers

PAPERS IN REFEREED JOURNALS
  1.  Leah Epstein, Elena Kleiman, Julian Mestre  “Parametric packing of selfish items and the Subset Sum algorithm”, Algorithmica, 74(1), 177-207, 2016.
  2. Leah Epstein, Elena Kleiman, Rob van Stee “The cost of selfishness for maximizing the minimum load on uniformly-related machines”, Journal of Combinatorial Optimization, 27(4), 767-777, 2014.
  3. Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee “Maximizing the minimum load: the cost of selfishness”, Theoretical Computer Science, 482, 9-19, 2013.
  4. Leah Epstein, Elena Kleiman “Selfish bin-packing”, Algorithmica, 60(2), 368-394, 2011.
  5. Leah Epstein, Elena Kleiman “Resource augmented semi-online bounded space bin packing”, Discrete Applied Mathematics, 157(13), 2785-2798, 2009.

PAPERS IN REFEREED CONFERENCE PROCEEDINGS 

  1. Leah Epstein, Elena Kleiman “Selfish vector packing”,  Proc. of the 23rd European Symposium on  Algorithms (ESA), 2015, pp. 471-481.

  2. Leah Epstein, Elena Kleiman “Scheduling selfish jobs on multidimensional parallel machines”, Proc. of the 26th  ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),   2014, pp. 108-117.

  3. Leah Epstein, Elena Kleiman “On the quality and complexity of Pareto equilibria in the Job Scheduling game”, Proc. of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2011, pp. 525-532.

  4. Leah Epstein, Elena Kleiman, Julian Mestre  “Parametric packing of selfish items and the Subset Sum algorithm”, Proc. of the 5th  Workshop on Internet and Network Economics (WINE), 2009, pp.  67-78.

  5.  Leah Epstein, Elena Kleiman, Rob van Stee “Maximizing the minimum load: the cost of selfishness”, Proc. of the 5th Workshop on Internet and Network Economics  (WINE), 2009, pp. 232-243.

  6. Leah Epstein, Elena Kleiman “Selfish bin-packing”, Proc. of the 16th European Symposium on  Algorithms (ESA), 2008, pp. 368-380.

Academic Appointments

2015-current – Senior Lecturer, Department of Software Engineering, ORT Braude College.

2012-current – Adjunct Lecturer, Faculty of Industrial Engineering and Management,  Technion–Israel Institute of Technology.

2012-2015 – Adjunct Lecturer, Department of Mathematics, ORT Braude College.

2012 – Adjunct Lecturer, Department of Information Systems, University of Haifa.

2008- 2012 – Adjunct Lecturer, Statistics Department, University of Haifa.

2007 – TA, Computer Science Department, University of Haifa.

2006-2007 – TA, Mathematics Department, University of Haifa.

Teaching Experience

Ort Braude College of Engineering, SE Department:
Object Oriented Programming
Data Structures
Discrete Mathematics
Game Theory

ייעוץ לימודים