| Approximation schemes for minimizing average weighted completion time with release dates F Afrati, E Bampis, C Chekuri, D Karger, C Kenyon, S Khanna, I Milis, ... 40th annual symposium on foundations of computer science (Cat. No. 99CB37039 …, 1999 | 269 | 1999 |
| Approximating the Pareto curve with local search for the bicriteria TSP (1, 2) problem E Angel, E Bampis, L Gourvés Theoretical Computer Science 310 (1-3), 135-146, 2004 | 88 | 2004 |
| Scheduling independent multiprocessor tasks AK Amoura, E Bampis, C Kenyon, Y Manoussakis Algorithms—ESA'97: 5th Annual European Symposium Graz, Austria, September …, 1997 | 85 | 1997 |
| Scheduling UET-UCT series-parallel graphs on two processors L Finta, Z Liu, I Mills, E Bampis Theoretical Computer Science 162 (2), 323-340, 1996 | 85 | 1996 |
| A dynasearch neighborhood for the bicriteria traveling salesman problem E Angel, E Bampis, L Gourvès Metaheuristics for Multiobjective Optimisation, 153-176, 2004 | 82 | 2004 |
| Scheduling independent multiprocessor tasks Amoura, Bampis, Kenyon, Manoussakis Algorithmica 32, 247-261, 2002 | 80 | 2002 |
| Truthful algorithms for scheduling selfish tasks on parallel machines E Angel, E Bampis, F Pascual Theoretical Computer Science 369 (1-3), 157-168, 2006 | 75 | 2006 |
| Scheduling algorithms for parallel Gaussian elimination with communication costs AK Amoura, E Bampis, JC Konig IEEE Transactions on Parallel and Distributed systems 9 (7), 679-686, 1998 | 65 | 1998 |
| On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems E Angel, E Bampis, A Kononov Theoretical computer science 306 (1-3), 319-338, 2003 | 63 | 2003 |
| Speed scaling on parallel processors with migration E Angel, E Bampis, F Kacem, D Letsios Journal of Combinatorial Optimization 37, 1266-1282, 2019 | 62* | 2019 |
| Spectrum assignment in optical networks: A multiprocessor scheduling perspective S Talebi, E Bampis, G Lucarelli, I Katib, GN Rouskas Journal of Optical Communications and Networking 6 (8), 754-763, 2014 | 60 | 2014 |
| Energy Efficient Scheduling and Routing via Randomized Rounding E Bampis, AV Kononov, D . Letsios, G Lucarelli, M Sviridenko FSTTCS, 449-460, 2013 | 55* | 2013 |
| A FPTAS for approximating the unrelated parallel machines scheduling problem with costs E Angel, E Bampis, A Kononov European Symposium on Algorithms, 194-205, 2001 | 50 | 2001 |
| Green scheduling, flows and matchings E Bampis, D Letsios, G Lucarelli Theoretical Computer Science 579, 126-136, 2015 | 46 | 2015 |
| From preemptive to non-preemptive speed-scaling scheduling E Bampis, A Kononov, D Letsios, G Lucarelli, I Nemparis Discrete Applied Mathematics 181, 11-20, 2015 | 40 | 2015 |
| Multistage matchings E Bampis, B Escoffier, M Lampis, VT Paschos 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018 …, 2018 | 39 | 2018 |
| Scheduling in switching networks with set-up delays F Afrati, T Aslanidis, E Bampis, I Milis Journal of Combinatorial Optimization 9 (1), 49-57, 2005 | 38 | 2005 |
| Scheduling to minimize the average completion time of dedicated tasks F Afrati, E Bampis, AV Fishkin, K Jansen, C Kenyon International Conference on Foundations of Software Technology and …, 2000 | 38 | 2000 |
| (Non)-Approximability for the Multi-criteria TSP(1,2) E Angel, E Bampis, L Gourves, J Monnot International symposium on fundamentals of computation theory, 329-340, 2005 | 35 | 2005 |
| Multistage knapsack E Bampis, B Escoffier, A Teiller Journal of Computer and System Sciences 126, 106-118, 2022 | 34 | 2022 |
Ioannis MilisAthens University E & B, Department of InformaticsVerified email at aueb.gr
