| 2008 |
|---|
| 26 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
On the Minimum Hitting Set of Bundles Problem.
AAIM 2008: 3-14 |
| 25 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
How good are SPT schedules for fair optimality criteria.
Annals OR 159(1): 53-64 (2008) |
| 24 | 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) |
| 23 | 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 |
|---|
| 22 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual,
Alex-Ariel Tchetgnia:
On the truthfulness and the approximation for scheduling selfish tasks.
SPAA 2007: 196-197 |
| 21 | 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 |
|---|
| 20 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links.
Euro-Par 2006: 157-166 |
| 19 | 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) |
| 18 | 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) |
| 17 | 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 |
|---|
| 16 | 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 |
| 15 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.
WG 2005: 331-340 |
| 14 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines.
WINE 2005: 698-707 |
| 13 | 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) |
| 12 | 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) |
| 2004 |
|---|
| 11 | EE | Eric Angel,
Evripidis Bampis,
Fanny Pascual:
Traffic Grooming in a Passive Star WDM Network.
SIROCCO 2004: 1-12 |
| 10 | 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 |
|---|
| 9 | 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 |
| 8 | 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 |
|---|
| 7 | 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 |
| 6 | | Eric Angel,
Vassilis Zissimopoulos:
On the Hardness of the Quadratic Assignment Problem with Metaheuristics.
J. Heuristics 8(4): 399-414 (2002) |
| 2001 |
|---|
| 5 | EE | Eric Angel,
Evripidis Bampis,
Alexander Kononov:
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.
ESA 2001: 194-205 |
| 4 | EE | Eric Angel,
Vassilis Zissimopoulos:
On the landscape ruggedness of the quadratic assignment problem.
Theor. Comput. Sci. 263(1-2): 159-172 (2001) |
| 2000 |
|---|
| 3 | EE | Eric Angel,
Vassilis Zissimopoulos:
On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.
Discrete Applied Mathematics 99(1-3): 261-277 (2000) |
| 1998 |
|---|
| 2 | EE | Eric Angel,
Vassilis Zissimopoulos:
On the Quality of Local Search for the Quadratic Assignment Problem.
Discrete Applied Mathematics 82(1-3): 15-25 (1998) |
| 1 | EE | Eric Angel,
Vassilis Zissimopoulos:
Autocorrelation Coefficient for the Graph Bipartitioning Problem.
Theor. Comput. Sci. 191(1-2): 229-243 (1998) |
