News

• Approximation and Online Algorithms
  6th International Workshop, WAOA 2008 E. Bampis, M. Skutella (Eds), LNCS 5426, 2009
• WAOA'2009, (part of ALGO'2009)

Conferences

• WAOA'2009, SPC'2009, WAOA'2008, WAOA'2007, WAOA'2006, WAOA'2005, WEA'2005, Renpar'2005, ALGOTEL'2004, WAOA'2004
• First Workshop on Approximation and Online Algorithms, WAOA'2003, 15-20 September 2003, Budapest, Hungary.
• RenPar'2003.
• Approximation and Randomized Algorithms in Communication Networks, Dagstuhl Seminar 02251,16.06.-21.06.2002, Dagstuhl, Germany.
• Rencontres francophones du Parallélisme 2002, RENPAR'14, april 2002, Hammamet - TUNISIE.
• Fourth Winter School on Telecommunications of Sophia Antipolis and Second ARACNE School ECOTEL'2001, 10-14 december 2001, Golfe Juan, France.
• Workshop on Efficient Algorithms WEA'2001, Riga, August 2001.
• Spring School on Approximation and On Line algorithms, APPOL, Orsay, May 2001.
• ARACNE Spring School on Approximation Algorithms for Scheduling and Telecommunications ARACNE, March 2001.

Projects

• Thematic network of the European Union "Approximation and On-line algorithms", IST-1999-14084, (Kiel, Berlin, Dortmund, Evry, Paris, Athens, Roma, Szeged, Maastricht, London, Haifa, Tel-Aviv), 1.05.2000 - 30.10.2001. APPOL
• Thematic network of the European Union "Approximation and Online Algorithms for Optimization Problems", IST-2001-32007, (Kiel, Berlin, Dortmund, Freiburg, Evry, Paris, Athens, Roma, Szeged, Maastricht, Haifa, Tel-Aviv, Zurich), 1.11.2001 - 31.10.2004. APPOL II
• ACI GRID of the french ministry of research: Groupe de Rencontres, d'Information et de Discussion sur la Globalisation des Ressources Informatiques et des Données GRID2
• France-Berkeley Fund (FBF) on multicriteria optimisation (Coordinator at Berkeley: Christos Papadimitriou)
• Bilateral exchange program PROCOPE'2001 with Klaus Jansen, on the malleable tasks scheduling model.
• Bilateral exchange program PROCOPE'2003 with Wolf Zimmerman and Denis Trystram on scheduling problems for parallel systems.
• National project RNTL FADO on the hybridation of metaheuristics for the efficient solution of combinatorial problems.
• PENED project with I. Milis (AUEB), V. Zissimopoulos (NKPA) and S. Zachos (NTUA), 2006-2009

PhD students

Current

Fadi Kacem, since october 2009.

Former

A. Amoura (co-advisor: Y. Manoussakis), now engineer at Motorola, Canada
R. Giroudeau (co-advisor: J.-C. Konig), now Assistant Professor, Univerity of Montpellier II
F. Baille (co-advisor: Ch. Laforest), now ATER, LIAFA, Univerity of Paris 7
L. Gourves (co-advisor: E. Angel), Researcher (CR2) CNRS, LAMSADE, University Paris 9 (Dauphine)
F. Pascual (co-advisor: E. Angel), Assistant Professor (MCF), University Paris 6
Malek Rahoual (co-advisor: Eric Angel)

Publications

Journals (until 2005)

E. Angel, E. Bampis, A. Fishkin, A note on scheduling to meet two min-sum objectives, Operations Research Letters, to appear.

E. Angel, E. Bampis, L. Gourves, Approximation results for a bicriterion scheduling problem on a single machine without preemption, Information Processing Letters, 94(1), 19-27, 2005.

E. Bampis, A. Kononov, Bicriteria scheduling problems with communication delays, Journal of Scheduling, to appear.

F. Afrati, T. Aslanidis, E. Bampis, I. Milis, Scheduling in switching networks with set-up delays, Journal of Combinatorial Optimization, 9(1) 49-57, 2005.

F. Afrati, E. Bampis, L. Finta, I. Milis, Scheduling trees with large communications on two processors, Journal of Scheduling, to appear.

E. Angel, E. Bampis, A multi-start Dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, European Journal of Operation Research, 162 (1) 281-289, 2005.

E. Bampis, R. Giroudeau, A. Kononov, Scheduling tasks with small communication delays for clusters of processors, Annals of Operations Research, 129 (1),47-63, 2004.

E. Angel, E. Bampis, L. Gourves, Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem, Theoretical Computer Science, 310, 135-146, 2004.

F. Baille, E. Bampis, Ch. Laforest, A note on bicriteria schedules with optimal approximation ratios, Parallel Processing Letters, 14(2), 315-324, 2004.

E. Angel, E. Bampis, A. Kononov, On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems, Theoretical Computer Science, 306, 319-338, 2003.

E. Bampis, R. Giroudeau, J.-C. Konig, An approximation algorithm for precedence constrained scheduling problem with hierarchical communications, Theoretical Computer Science, 290, 1883-1895, 2003.

E. Bampis, G.N. Rouskas, The Scheduling and Wavelength Assignement Problem in Optical WDM Networks, IEEE/OSA Journal of Lightwave Technology, 30(5) 782-789 2002.

A. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis, Scheduling Independent Multiprocessor Tasks, Algorithmica, 32(2) 247-261, 2002.

E. Bampis, R. Giroudeau, J.-C. Konig, On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications, RAIRO-Operations Research, 36(1), 21-36, 2002.

F. Afrati, E. Bampis, C. Kenyon, I. Milis, A PTAS for the average weighted completion time problem on unrelated machines, Journal of Scheduling, Special Issue on Approximation Algorithms, 3(6), 323-332, 2000.

E. Bampis, R. Giroudeau, J.-C. Konig, Using duplication for the multiprocessor scheduling problem with hierarchical communications, Parallel Processing Letters, 10(1) 133-140, 2000.

E. Bampis, A. Giannakos, A. Karzanov, Y. Manoussakis, I. Milis, Matchings in Cubic Graphs are as Difficult as in General Graphs, RAIRO-Theoretical Informatics and Applications, 34 (2) 87-97, 2000.

E. Bampis, Y. Manoussakis, I. Milis, On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem, RAIRO-Operations Research, 33 (4), 421-437, 1999.

A. Amoura, E. Bampis, Y. Manoussakis, Zs. Tuza, Scheduling Multiprocessor Dedicated Tasks on Three Processors, Parallel Computing, 25 (1), 49-61, 1999.

E. Bampis, The complexity of short-schedules for UET bipartite graphs, RAIRO-Operations Research, 33 (3), 367-370, 1999.

A. Amoura, E. Bampis, J.-C. Konig, Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines, IEEE Transactions on Parallel and Distributed Systems, 9 (7), 679-686, 1998.

E. Bampis, C. Delorme, J.-C. Konig, Optimal Schedules for d-D Grid Graphs with Communication Delays, Parallel Computing, 24 (11), 1653-1664, 1998.

E. Bampis, A. Giannakos, A. Karzanov, Y. Manoussakis, I. Milis, A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph, Parallel Processing Letters, 8 (3), 399-405, 1998.

E. Bampis, F. Guinand, D. Trystram, Some Models for Scheduling Parallel Programs with Communication Delays, Discrete Applied Mathematics, 72, 5-24, 1997.

E. Bampis, Y. Manoussakis, I. Milis, NC algorithms for finding antidirected paths and cycles in tournaments, Journal of Combinatorial Computing and Combinatorial Mathematics, 21, 223-234, 1996.

E. Bampis, J.-C. Konig, D. Trystram, Minimizing Schedule Length for a Parallel 3D-grid Graph, European Journal of Operation Research, 95, 427-438, 1996.

E. Bampis, F. Guinand, D. Trystram, Minimizing the Overhead for Some Tree-Scheduling Problems, European Journal of Operation Research, 94, 261-270, 1996.

L. Finta, Z. Liu, I. Milis, E. Bampis, Optimal Schedules for UET-UCT Series Parallel Digraphs on Two Processors, Theoretical Computer Science 162, 323-340, 1996.

E.Bampis, A. Giannakos, J.-C. Konig, On the Complexity of Scheduling with Large Communication Delays, European Journal of Operation Research, 94, 252-260, 1996.

E. Bampis, M. El Haddad, Y. Manoussakis, M. Santha, A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments, Journal of Algorithms, 19 (3), 432-440,1995.

E. Bampis, J-C. Konig, D. Trystram, Optimal parallel execution of complete binary trees and grids into most popular interconnection networks, Theoretical Computer Science, 147, 1-18, 1995.

E. Bampis, J-C. Konig, D. Trystram, A Low Overhead Schedule for a 3D-grid, Parallel Processing Letters, 2 (4), 363-372, 1992.

E. Bampis, J-C. Konig, D. Trystram, Impact of Communications on the Complexity of the Parallel Gaussian Elimination, Parallel Computing, 17 55-61, 1991.

Book Chapters

E. Angel, E. Bampis, L. Gourves, A dynasearch neighborhood for the bictriteria traveling salesman problem, In: Metaheuristics for Multiobjective Optimisation, Xavier Gandibleux, M. Sevaux, K. Sorensen, V. T'kindt, Springer. Lecture Notes in Economics and Mathematical Systems Vol. 535, 2004.

E. Angel, E. Bampis, L. Gourves, Approximation polynomiale avec garantie de performance pour l'optimisation multicritere, In: Optimisation Combinatoire : Concepts Fondamentaux, V. Paschos Ed., Hermes, to appear.

International Conferences

E. Angel, E. Bampis, F. Pascual, Traffic grooming in a passive star WDM network, SIROCCO'2004, LNCS 3104, 1-12, 2004.

F. Baille, E. Bampis, Ch. Laforest, Maximization of the Size and the Weight of Schedules of Degradable Intervals, COCOON'2004, LNCS 3106, 219-228, 2004.

E. Angel, E. Bampis, L. Gourves, Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem, FCT'2003, LNCS 2751, 39-48, 2003.

E. Bampis, A. Kononov, Bicriteria approximation algorithms for scheduling problems with communication delays, SPAA'2003, 252-253, 2003.

F. Baille, E. Bampis, Ch. Laforest, Bicriteria scheduling of parallel degradable tasks for network a ccess under pricing constraints, INOC, 37-42, 2003.

E. Bampis, A. Kononov, Approximation algorithms for bicriteria scheduling problems with communication delays, MAPSP'2003, 2003.

E. Bampis, M. Caramia, A. Iovanella, J. Fiala, A.V. Fishkin, Scheduling of independent dedicated multiprocessor tasks, ISAAC'2002, LNCS 2518, 391-402, 2002.

E. Angel, E. Bampis, L. Gourves, A dynasearch neighborhood for the traveling salesman problem, MOMH'2002, November 4-5, Carr\'e des Sciences, Paris, 2002.

E. Angel, E. Bampis, R. Giroudeau,, Non-approximability results for the hierarchical communication problem with a bounded number of clusters, EuroPar'02, LNCS 2400, 217-224, 2002.

E. Angel, E. Bampis, A. Kononov, A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Pro blem with Costs, ESA'01, LNCS 2161, 194-205, 2001.

E. Bampis, G.N. Rouskas, On Scheduling problems with applications to packet-switched optical WDM networks, Proc. OPTICOMM'2001, Denver, USA, 163-172, 2001.

E. Bampis, R. Giroudeau, A. Kononov, Scheduling tasks with small communication delays for clusters of processors, Proc. of SPAA'2001 314-315, 2001.

E. Bampis, A. Kononov, On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements, IWST'2001, San Francisco, Proc. de IPDPS, 2001.

E. Bampis, S. Chaoui, S. Vial, On the performance of LPT with lookahead for the reconfiguration of WDM all-optical networks, OPTICOMM'2000 Dallas, USA, Proc. SPIEE Vol 4233, 141-152, 2000.

E. Angel, E. Bampis, A multi-start Dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, MAPSP'2001, Aussois, France, 2001.

F. Afrati, E. Bampis, L. Finta, I. Milis, Scheduling trees with large communication delays on two identical proces sors, Europar'2000, LNCS 1900, 198-202, 2000.

F. Afrati, E. Bampis, , A. Fishkin, K. Jansen, C. Kenyon, Scheduling to minimize the average completion time of dedicated tasks FSTTCS'2000, LNCS 1974, 454-464, 2000.

E. Bampis, R. Giroudeau, J.-C. Konig, An approximation algorithm for precedence constrained scheduling problem with hierarchical communications, 17th International Symposium on Theoretical Aspects of Computer Science STACS'00, LNCS No 1770, 443-454, 2000.

F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne Martin Skutella, C. Stein, M. Sviridenko, Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates, 40th Annual Symposium on Foundations of Computer Science FOCS'99, 32-43, 1999.

E. Bampis, R. Giroudeau, J.C. Konig, Using duplication for the multiprocessor scheduling problem with hierarchical communications, EUROPAR'99, LNCS No 1685, 369-372, 1999.

F. Afrati, E. Bampis, C. Kenyon, I. Milis, Scheduling on a constant number of machines, Randomization, Approximation and Combinatorial Optimization RANDOM-APPROX'99, LNCS No 1671, 281-287, 1999.

A. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis, Scheduling Independent Multiprocessor Tasks, Proceedings of the 5th Annual European Symposium on Algorithms, ESA'97, LNCS No 1284, 1-12, 1997.

E. Bampis, C. Delorme, J.-C. Konig, Optimal Schedules for d-D Grid Graphs with Communication Delays, STACS'96, LNCS 1046, C. Puech, R. Reischuk Eds, 655-666, 1996.

A. Amoura, E. Bampis, J.-C. Konig, Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines , in Parallel Computing: State-of-the-art and Perspectives Ed. D'Hollander et al, Proceedings of PARCO'95, Advances in Parallel Computing 11, Elsevier, 569-572, 1996.

E. Bampis, Y. Manoussakis, I. Milis, On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem, Combinatorics and Computer Science (CCS'95), LNCS 1120, M. Deza et al Eds, 367-377, 1995.

E. Bampis, P. Hell, Y. Manoussakis, M. Rozenfeld,, Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from Given Vertex of a Tournament , Combinatorics and Computer Science (CCS'95), LNCS 1120, M. Deza et al Eds, 67-73 1995.

E. Bampis, J.-C. Konig, D. Trystram, Optimal parallel execution of complete binary trees and grids into most popular interconnection networks , PARLE'94, LNCS 817, Halatsis et al Eds, 122-133, 1995.

E. Bampis, Y. Manoussakis, I. Milis, NC algorithms for finding antidirected paths and cycles in tournaments, 20th Internationale Workshop on Graph Theore tic Concepts in Computer Science (WG'94), Munich, Germany, LNCS 903, E. W. Mayr et al Eds, 387-394, 1994.

E. Bampis, M. El Haddad, Y. Manoussakis, M. Santha, A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments, PARLE'93, LNCS 694, A. Bode et al Eds, 553-560, 1993.

E. Bampis, J.-C. Konig, D. Trystram, Parallel Schedules for 3D-grid Graphs, 6th Distributed Memory Computing Conference (DMCC6), Portland USA, 1991.

Links

Conferences (University of Glasgow)

Accepted papers at CS Theory Conferences

Link for the Master MOPS