Publications 2010-2023

• 2023
  • E. Bampis, A. Kononov, G. Lucarelli, F. Pascual : “Non-Clairvoyant Makespan Minimization Scheduling with Predictions”, 34^th International Symposium on Algorithms and Computation (ISAAC 2023), vol. 283, Leibniz International Proceedings in Informatics (LIPIcs), Kyoto, Japan, pp. 9:1-9:15, (Schloss Dagstuhl – Leibniz-Zentrum für Informatik) (2023)
• 2022
  • E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Scheduling with Untrusted Predictions”, Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}, Vienna, Austria, pp. 4581-4587, (International Joint Conferences on Artificial Intelligence Organization) (2022)
• 2021
  • E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Speed Scaling with Explorable Uncertainty”, SPAA '21: Proceedings of the 33^rd ACM Symposium on Parallelism in Algorithms and Architectures, virtual conference, United States, pp. 83-93, (ACM) (2021)
• 2020
  • E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Scheduling Malleable Jobs Under Topological Constraints”, 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), New Orleans, LA, United States, pp. 316-325, (IEEE) (2020)
• 2019
  • S. Angelopoulos, G. Lucarelli, K. Nguyen : “Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems”, Algorithmica, vol. 81 (9), pp. 3391-3421, (Springer Verlag) (2019)
• 2018
  • L. Arantes, E. Bampis, A. Kononov, M. Letsios, G. Lucarelli, P. Sens : “Scheduling under Uncertainty: A Query-based Approach”, IJCAI 2018 - 27^th International Joint Conference on Artificial Intelligence, Stockholm, Sweden, pp. 4646-4652 (2018)
  • E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy Efficient Scheduling and Routing via Randomized Rounding”, Journal of Scheduling, vol. 21 (1), pp. 35-51, (Springer Verlag) (2018)
• 2017
  • S. Albers, E. Bampis, D. Letsios, G. Lucarelli, R. Stotz : “Scheduling on power-heterogeneous processors”, Information and Computation, vol. 257, pp. 22-33, (Elsevier) (2017)
• 2016
  • S. Albers, E. Bampis, D. Letsios, G. Lucarelli, S. Richard : “Scheduling on Power-Heterogeneous Processors”, LATIN 2016: Theoretical Informatics, vol. 9644, Lecture Notes in Computer Science, Ensenada, Mexico, pp. 41-54 (2016)
• 2015
  • S. Angelopoulos, G. Lucarelli, K. Nguyen : “Primal-Dual and Dual-Fitting analysis of online scheduling algorithms for generalized flow time problems”, Algorithms - ESA 2015, vol. 9294, Lecture Notes in Computer Science, Patras, Greece, pp. 35-46, (Springer) (2015)
  • E. Bampis, D. Letsios, G. Lucarelli : “Green scheduling, flows and matchings”, Theoretical Computer Science, vol. 579, pp. 126–136, (Elsevier) (2015)
  • E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, I. Nemparis : “From preemptive to non-preemptive speed-scaling scheduling”, Discrete Applied Mathematics, vol. 181, pp. 11-20, (Elsevier) (2015)
• 2014
  • E. Bampis, D. Letsios, G. Lucarelli : “Speed-Scaling with No Preemptions”, 25^th International Symposium, ISAAC, vol. 8889, Lecture Notes in Computer Science, Jeonju, Korea, Republic of, pp. 259-269 (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. Bampis, D. Letsios, G. Lucarelli : “A note on multiprocessor speed scaling with precedence constraints”, 26^th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2014), Prague, Czechia, pp. 138-142, (ACM) (2014)
  • S. Talebi, E. Bampis, G. Lucarelli, I. Katib, G. Rouskas : “The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective”, 18^th Conference on Optical Network Design and Modeling (ONDM 2014), Stockholm, Sweden, pp. 55-60, (IEEE) (2014)
  • E. Bampis, A. Kononov, G. Lucarelli, I. Milis : “Bounded max-colorings of graphs”, Journal of Discrete Algorithms, vol. 26, pp. 56-68, (Elsevier) (2014)
  • E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy Efficient Scheduling and Routing via Randomized Rounding”, 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, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy efficient scheduling and routing via randomized rounding”, 33^rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), vol. 24, Leibniz International Proceedings in Informatics (LIPIcs), Guwahati, India, pp. 449-460 (2013)
  • E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, I. Nemparis : “From Preemptive to Non-preemptive Speed-Scaling Scheduling”, 19^th Annual International Computing and Combinatorics Conference (COCOON 2013), vol. 7936, Lecture Notes in Computer Science, Hangzhou, China, pp. 134-146 (2013)
  • E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, I. Milis : “On multiprocessor temperature-aware scheduling problems”, Journal of Scheduling, vol. 16 (5), pp. 529-538, (Springer Verlag) (2013)
  • N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, Vangelis Th. Paschos : “Exact and approximation algorithms for DENSEST k-SUBGRAPH”, 7^th International Workshop on Algorithms and Computation (WALCOM 2013), vol. 7748, Lecture Notes in Computer Science, Kharagpur, India, pp. 114-125, (Springer) (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)
• 2012
  • G. Ausiello, N. Boria, A. Giannakos, G. Lucarelli, Vangelis Th. Paschos : “Online maximum k-coverage”, Discrete Applied Mathematics, vol. 160 (13-14), pp. 1901-1913, (Elsevier) (2012)
  • N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Paschos : “Exact and approximation algorithms for densest k-subgraph”, (2012)
  • N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, Vangelis Th. Paschos, O. Pottié : “The max quasi-independent set problem”, Journal of Combinatorial Optimization, vol. 23, pp. 94-117, (Springer Verlag) (2012)
  • E. Bampis, D. Letsios, G. Lucarelli : “Green scheduling, flows and matchings”, 23^rd International Symposium on Algorithms and Computation (ISAAC 2012), vol. 7676, Lecture Notes in Computer Science, Taipei, Taiwan, Province of China, pp. 106-115 (2012)
  • E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, Ioannis Z. Milis : “On multiprocessor temperature-aware scheduling problems”, 6^th International Frontiers of Algorithmics Workshop (FAW 2012) and 8^th International Conference on Algorithmic Aspects of Information and Management (AAIM 2012), vol. 7285, Lecture Notes in Computer Science, Beijing, China, pp. 149-160 (2012)
• 2011
  • E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, I. Milis : “On Multiprocessor Temperature-Aware Scheduling Problems”, (2011)
• 2010
  • E. Bampis, A. Kononov, G. Lucarelli, I. Milis : “Bounded max-colorings of graphs”, 21^st International Symposium on Algorithms and Computation (ISAAC 2010), vol. 6506, Lecture Notes in Computer Science, Jeju Island, Korea, Republic of, pp. 353-365, (Springer) (2010)