Publications 2012-2021

• 2021
  • E. Angel, E. Bampis, V. Chau, V. Zissimopoulos : “Calibrations scheduling with arbitrary lengths and activation length”, Journal of Scheduling, vol. 24, pp. 459-467, (Springer Verlag) (2021)
• 2017
  • E. Angel, E. Bampis, V. Chau, V. Zissimopoulos : “On the complexity of minimizing the total calibration cost”, 11^th International Frontiers of Algorithmics Workshop (FAW 2017), vol. 10336, Lecture Notes in Computer Science, Chengdu, China, pp. 1-12 (2017)
• 2016
  • E. Angel, E. Bampis, V. Chau, D. Letsios : “Throughput maximization for speed scaling with agreeable deadlines”, Journal of Scheduling, vol. 19 (6), pp. 619-625, (Springer Verlag) (2016)
  • E. Angel, E. Bampis, V. Chau, K. Nguyen : “Throughput maximization in multiprocessor speed-scaling”, Theoretical Computer Science, vol. 630, pp. 1-12, (Elsevier) (2016)
• 2015
  • E. Angel, E. Bampis, V. Chau, A. Kononov : “Min-Power Covering Problems”, 26^th International Symposium (ISAAC 2015), vol. 9472, Lecture Notes in Computer Science, Nagoya, Japan, pp. 367-377 (2015)
  • E. Angel, E. Bampis, V. Chau, K. Nguyen : “Non-preemptive throughput maximization for speed-scaling with power-down”, 21^st International Conference on Parallel and Distributed Computing (Euro-Par 2015), vol. 9233, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vienna, Austria, pp. 171-182 (2015)
• 2014
  • E. Angel, E. Bampis, V. Chau, K. Nguyen : “Throughput maximization in multiprocessor speed-scaling”, Proc. of the 25^th International Symposium on Algorithms and Computation (ISAAC 2014), vol. 8889, Lecture Notes in Computer Science, Jeonju, Korea, Republic of, pp. 247-258, (Springer) (2014)
  • E. Angel, E. Bampis, V. Chau : “Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines”, Discrete Applied Mathematics, vol. 175, pp. 1-10, (Elsevier) (2014)
  • E. Bampis, V. Chau, D. Letsios, G. Lucarelli, I. Milis, G. Zois : “Energy Efficient Scheduling of MapReduce Jobs”, 20^th International Conference on Parallel Processing (Euro-Par 2014), vol. 8632, Lecture Notes in Computer Science, Porto, Portugal, pp. 198-209, (Springer) (2014)
  • E. Angel, E. Bampis, V. Chau : “Throughput maximization in the speed-scaling setting”, Leibniz International Proceedings in Informatics, LIPIcs, vol. 25, Lyon, France, pp. 53-62 (2014)
  • V. Chau, E. Angel, E. Bampis : “Maximisation de profit dans les systèmes informatiques sous contraintes énergétiques”, ROADEF - 15^e congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France (2014)
• 2013
  • E. Bampis, V. Chau, D. Letsios, G. Lucarelli, I. Milis : “Energy Minimization via a Primal-Dual Algorithm for a Convex Program”, 12^th International Symposium on Experimental Algorithms (SEA 2013), vol. 7933, Lecture Notes in Computer Science, Rome, Italy, pp. 366-377 (2013)
  • E. Angel, E. Bampis, V. Chau, D. Letsios : “Throughput Maximization for Speed-Scaling with Agreeable Deadlines”, 10^th annual conference on Theory and Applications of Models of Computation (TAMC 2013), vol. 7876, Lecture Notes in Computer Science, Hong Kong, China, pp. 10-19 (2013)
• 2012
  • E. Angel, E. Bampis, V. Chau : “Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines”, Proc. of the 10^th Latin American Symposium (LATIN 2012), vol. 7256, Lecture Notes in Computer Science, Arequipa, Peru, pp. 13-24 (2012)
  • E. Angel, E. Bampis, V. Chau : “Algorithmes d’ordonnancement de faible complexité pour minimiser l’énergie consommée des instances agréables”, Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2012), Angers, France (2012)