Prati
Evripidis Bampis
Evripidis Bampis
Professor of Computer Science, Sorbonne Université
Potvrđena adresa e-pošte na lip6.fr - Početna stranica
Naslov
Citirano
Citirano
Godina
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
2581999
Scheduling independent multiprocessor tasks
AK Amoura, E Bampis, C Kenyon, Y Manoussakis
Algorithms—ESA'97: 5th Annual European Symposium Graz, Austria, September …, 1997
159*1997
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
842004
A dynasearch neighborhood for the bicriteria traveling salesman problem
E Angel, E Bampis, L Gourvès
Metaheuristics for Multiobjective Optimisation, 153-176, 2004
792004
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
781996
Speed scaling on parallel processors with migration
E Angel, E Bampis, F Kacem, D Letsios
Journal of Combinatorial Optimization 37, 1266-1282, 2019
75*2019
Truthful algorithms for scheduling selfish tasks on parallel machines
E Angel, E Bampis, F Pascual
Theoretical Computer Science 369 (1-3), 157-168, 2006
742006
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
601998
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
572014
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
572003
Energy Efficient Scheduling and Routing via Randomized Rounding
E Bampis, AV Kononov, D . Letsios, G Lucarelli, M Sviridenko
FSTTCS, 449-460, 2013
55*2013
Green scheduling, flows and matchings
E Bampis, D Letsios, G Lucarelli
Theoretical Computer Science 579, 126-136, 2015
452015
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
452001
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
402005
Multistage matchings
E Bampis, B Escoffier, M Lampis, VT Paschos
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018 …, 2018
362018
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
362000
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
342015
Speed scaling with power down scheduling for agreeable deadlines
E Bampis, C Dürr, F Kacem, I Milis
Sustainable Computing: Informatics and Systems 2 (4), 184-189, 2012
322012
(Non)-Approximability for the Multi-criteria TSP(1,2)
E Angel, E Bampis, L Gourves, J Monnot
Fundamentals of Computation Theory: 15th International Symposium, FCT 2005 …, 2005
322005
On the complexity of scheduling with large communication delays
E Bampis, A Giannakos, JC König
European Journal of Operational Research 94 (2), 252-260, 1996
321996
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20