| 2009 |
|---|
| 64 | EE | Evripidis Bampis,
Martin Skutella:
Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers
Springer 2009 |
| 63 | EE | Evripidis Bampis,
Alexander Kononov,
Giorgio Lucarelli,
Ioannis Milis:
Bounded Max-Colorings of Graphs
CoRR abs/0904.1705: (2009) |
| 2008 |
|---|
| 62 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
On the Minimum Hitting Set of Bundles Problem.
AAIM 2008: 3-14 |
| 61 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
How good are SPT schedules for fair optimality criteria.
Annals OR 159(1): 53-64 (2008) |
| 60 | EE | Fabien Baille,
Evripidis Bampis,
Christian Laforest,
Christophe Rapine:
Bicriteria scheduling for contiguous and non contiguous parallel tasks.
Annals OR 159(1): 97-106 (2008) |
| 59 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
An exponential (matching based) neighborhood for the vehicle routing problem.
J. Comb. Optim. 15(2): 179-190 (2008) |
| 58 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
The impact of local policies on the quality of packet routing in paths, trees, and rings.
J. Scheduling 11(5): 311-322 (2008) |
| 2007 |
|---|
| 57 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual,
Alex-Ariel Tchetgnia:
On the truthfulness and the approximation for scheduling selfish tasks.
SPAA 2007: 196-197 |
| 56 | EE | Eric Angel,
Evripidis Bampis,
Aleksei V. Fishkin:
A note on scheduling to meet two min-sum objectives.
Oper. Res. Lett. 35(1): 69-73 (2007) |
| 2006 |
|---|
| 55 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links.
Euro-Par 2006: 157-166 |
| 54 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
Approximation algorithms for the bi-criteria weighted MAX-CUT problem.
Discrete Applied Mathematics 154(12): 1685-1692 (2006) |
| 53 | EE | Evripidis Bampis,
Klaus Jansen:
Introduction.
Discrete Applied Mathematics 154(4): 609 (2006) |
| 52 | EE | Eric Angel,
Evripidis Bampis,
Lélia Blin,
Laurent Gourvès:
Fair cost-sharing methods for the minimum spanning tree game.
Inf. Process. Lett. 100(1): 29-35 (2006) |
| 51 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
Truthful algorithms for scheduling selfish tasks on parallel machines.
Theor. Comput. Sci. 369(1-3): 157-168 (2006) |
| 2005 |
|---|
| 50 | EE | Fabien Baille,
Evripidis Bampis,
Christian Laforest,
Nicolas Thibault:
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules.
COCOON 2005: 308-317 |
| 49 | EE | Fabien Baille,
Evripidis Bampis,
Christian Laforest,
Nicolas Thibault:
On-Line Bicriteria Interval Scheduling.
Euro-Par 2005: 312-322 |
| 48 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès,
Jérôme Monnot:
(Non)-Approximability for the Multi-criteria TSP(1, 2).
FCT 2005: 329-340 |
| 47 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.
WG 2005: 331-340 |
| 46 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines.
WINE 2005: 698-707 |
| 45 | EE | Eric Angel,
Evripidis Bampis:
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem.
European Journal of Operational Research 162(1): 281-289 (2005) |
| 44 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
Approximation results for a bicriteria job scheduling problem on a single machine without preemption.
Inf. Process. Lett. 94(1): 19-27 (2005) |
| 43 | EE | Foto N. Afrati,
Timos Aslanidis,
Evripidis Bampis,
Ioannis Milis:
Scheduling in Switching Networks with Set-Up Delays.
J. Comb. Optim. 9(1): 49-57 (2005) |
| 42 | EE | Foto N. Afrati,
Evripidis Bampis,
Lucian Finta,
Ioannis Milis:
Scheduling trees with large communication delays on two identical processors.
J. Scheduling 8(2): 179-190 (2005) |
| 41 | EE | Evripidis Bampis,
Alexander Kononov:
Bicriteria approximation algorithms for scheduling problems with communications delays.
J. Scheduling 8(4): 281-294 (2005) |
| 2004 |
|---|
| 40 | EE | Fabien Baille,
Evripidis Bampis,
Christian Laforest:
Maximization of the Size and the Weight of Schedules of Degradable Intervals.
COCOON 2004: 219-228 |
| 39 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
Traffic Grooming in a Passive Star WDM Network.
SIROCCO 2004: 1-12 |
| 38 | EE | Evripidis Bampis,
Rodolphe Giroudeau,
Alexander Kononov:
Scheduling Tasks with Small Communication Delays for Clusters of Processors.
Annals OR 129(1-4): 47-63 (2004) |
| 37 | EE | Fabien Baille,
Evripidis Bampis,
Christian Laforest:
A Note On Bicriteria Schedules With Optimal Approximations Ratios.
Parallel Processing Letters 14(2): 315-323 (2004) |
| 36 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.
Theor. Comput. Sci. 310(1-3): 135-146 (2004) |
| 2003 |
|---|
| 35 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem.
FCT 2003: 39-48 |
| 34 | EE | Evripidis Bampis,
Alexander Kononov:
Bicriteria approximation algorithms for scheduling problems with communications.
SPAA 2003: 252-253 |
| 33 | | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Theor. Comput. Sci. 290(3): 1883-1895 (2003) |
| 32 | EE | Eric Angel,
Evripidis Bampis,
Alexander Kononov:
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
Theor. Comput. Sci. 306(1-3): 319-338 (2003) |
| 2002 |
|---|
| 31 | EE | Eric Angel,
Evripidis Bampis,
Rodolphe Giroudeau:
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters.
Euro-Par 2002: 217-224 |
| 30 | EE | Evripidis Bampis,
Massimiliano Caramia,
Jirí Fiala,
Aleksei V. Fishkin,
Antonio Iovanella:
Scheduling of Independent Dedicated Multiprocessor Tasks.
ISAAC 2002: 391-402 |
| 29 | EE | Abdel Krim Amoura,
Evripidis Bampis,
Claire Kenyon,
Yannis Manoussakis:
Scheduling Independent Multiprocessor Tasks.
Algorithmica 32(2): 247-261 (2002) |
| 2001 |
|---|
| 28 | EE | Eric Angel,
Evripidis Bampis,
Alexander Kononov:
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.
ESA 2001: 194-205 |
| 27 | | Evripidis Bampis,
Alexander Kononov:
On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements.
IPDPS 2001: 200 |
| 26 | EE | Evripidis Bampis,
Rodolphe Giroudeau,
Alexander Kononov:
Scheduling tasks with small communication delays for clusters of processors.
SPAA 2001: 314-315 |
| 2000 |
|---|
| 25 | EE | Foto N. Afrati,
Evripidis Bampis,
Lucian Finta,
Ioannis Milis:
Scheduling Trees with Large Communication Delays on Two Identical Processors.
Euro-Par 2000: 288-295 |
| 24 | EE | Foto N. Afrati,
Evripidis Bampis,
Aleksei V. Fishkin,
Klaus Jansen,
Claire Kenyon:
Scheduling to Minimize the Average Completion Time of Dedicated Tasks.
FSTTCS 2000: 454-464 |
| 23 | EE | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications.
STACS 2000: 443-454 |
| 22 | | Evripidis Bampis,
Aristotelis Giannakos,
Alexander V. Karzanov,
Yannis Manoussakis,
Ioannis Milis:
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases.
ITA 34(2): 87-98 (2000) |
| 21 | | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.
Parallel Processing Letters 10(1): 133-140 (2000) |
| 1999 |
|---|
| 20 | EE | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.
Euro-Par 1999: 369-372 |
| 19 | EE | Foto N. Afrati,
Evripidis Bampis,
Chandra Chekuri,
David R. Karger,
Claire Kenyon,
Sanjeev Khanna,
Ioannis Milis,
Maurice Queyranne,
Martin Skutella,
Clifford Stein,
Maxim Sviridenko:
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
FOCS 1999: 32-44 |
| 18 | | Foto N. Afrati,
Evripidis Bampis,
Claire Kenyon,
Ioannis Milis:
Scheduling on a Constant Number of Machines.
RANDOM-APPROX 1999: 281-287 |
| 17 | | Abdel Krim Amoura,
Evripidis Bampis,
Yannis Manoussakis,
Zsolt Tuza:
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.
Parallel Computing 25(1): 49-61 (1999) |
| 1998 |
|---|
| 16 | EE | Abdel Krim Amoura,
Evripidis Bampis,
Jean-Claude König:
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs.
IEEE Trans. Parallel Distrib. Syst. 9(7): 679-686 (1998) |
| 15 | | Evripidis Bampis,
Charles Delorme,
Jean-Claude König:
Optimal Schedules for d-D Grid Graphs with Communication Delays.
Parallel Computing 24(11): 1653-1664 (1998) |
| 14 | | Evripidis Bampis,
Alexander V. Karzanov,
Yannis Manoussakis,
Ioannis Milis:
A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph.
Parallel Processing Letters 8(3): 399-405 (1998) |
| 1997 |
|---|
| 13 | | Abdel Krim Amoura,
Evripidis Bampis,
Claire Kenyon,
Yannis Manoussakis:
Scheduling Independent Multiprocessor Tasks.
ESA 1997: 1-12 |
| 12 | EE | Evripidis Bampis,
Frédéric Guinand,
Denis Trystram:
Some Models for Scheduling Parallel Programs with Communication Delays.
Discrete Applied Mathematics 72(1-2): 5-24 (1997) |
| 1996 |
|---|
| 11 | | Evripidis Bampis,
Charles Delorme,
Jean-Claude König:
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract).
STACS 1996: 655-666 |
| 10 | EE | Lucian Finta,
Zhen Liu,
Ioannis Milis,
Evripidis Bampis:
Scheduling UET-UCT Series-Parallel Graphs on Two Processors.
Theor. Comput. Sci. 162(2): 323-340 (1996) |
| 1995 |
|---|
| 9 | | Evripidis Bampis,
Yannis Manoussakis,
Ioannis Milis:
On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem.
Combinatorics and Computer Science 1995: 367-377 |
| 8 | | Evripidis Bampis,
Pavol Hell,
Yannis Manoussakis,
Moshe Rosenfeld:
Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.
Combinatorics and Computer Science 1995: 67-73 |
| 7 | | Evripidis Bampis,
Mohamed El Haddad,
Yannis Manoussakis,
Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.
J. Algorithms 19(3): 432-440 (1995) |
| 6 | EE | Evripidis Bampis,
Jean-Claude König,
Denis Trystram:
Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks.
Theor. Comput. Sci. 147(1&2): 1-18 (1995) |
| 1994 |
|---|
| 5 | | Evripidis Bampis,
Jean-Claude König,
Denis Trystram:
Optimal Parallel Execution of Complete Binary Trees and Grids into most Popular Interconnection Networks.
PARLE 1994: 122-133 |
| 4 | | Evripidis Bampis,
Yannis Manoussakis,
Ioannis Milis:
NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract).
WG 1994: 387-394 |
| 1993 |
|---|
| 3 | | Evripidis Bampis,
Mohamed El Haddad,
Yannis Manoussakis,
Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.
PARLE 1993: 553-560 |
| 1992 |
|---|
| 2 | | Evripidis Bampis,
Jean-Claude König,
Denis Trystram:
A Low Overhead Schedule for a 3D-Grid Graph.
Parallel Processing Letters 2: 363-372 (1992) |
| 1991 |
|---|
| 1 | | Evripidis Bampis,
Jean-Claude König,
Denis Trystram:
Impact of communications on the complexity of the parallel Gaussian Elimination.
Parallel Computing 17(1): 55-61 (1991) |
