Eric Angel

	2012
33		Eric Angel, Evripidis Bampis, Nicolas Thibault: Randomized truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 414(1): 1-8 (2012)
	2011
32		Eric Angel, Romain Campigotto, Christian Laforest: Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities. Algorithmic Operations Research 6(1): 56-67 (2011)
31		Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios: Speed Scaling on Parallel Processors with Migration CoRR abs/1107.2105: (2011)
	2010
30		Eric Angel, Evripidis Bampis, Nicolas Thibault: Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. LATIN 2010: 38-48
29		Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos: Optimal Data Placement on Networks With Constant Number of Clients CoRR abs/1004.4420: (2010)
	2009
28		Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia: On truthfulness and approximation for scheduling selfish tasks. J. Scheduling 12(5): 437-445 (2009)
27		Eric Angel, Evripidis Bampis, Laurent Gourvès: On the minimum hitting set of bundles problem. Theor. Comput. Sci. 410(45): 4534-4542 (2009)
	2008
26		Eric Angel, Evripidis Bampis, Laurent Gourvès: On the Minimum Hitting Set of Bundles Problem. AAIM 2008: 3-14
25		Eric Angel, Evripidis Bampis, Fanny Pascual: How good are SPT schedules for fair optimality criteria. Annals OR 159(1): 53-64 (2008)
24		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		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		Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia: On the truthfulness and the approximation for scheduling selfish tasks. SPAA 2007: 196-197
21		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		Eric Angel, Evripidis Bampis, Fanny Pascual: The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. Euro-Par 2006: 157-166
19		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		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		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		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		Eric Angel, Evripidis Bampis, Laurent Gourvès: Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. WG 2005: 331-340
14		Eric Angel, Evripidis Bampis, Fanny Pascual: Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. WINE 2005: 698-707
13		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		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		Eric Angel, Evripidis Bampis, Fanny Pascual: Traffic Grooming in a Passive Star WDM Network. SIROCCO 2004: 1-12
10		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		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		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		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		Eric Angel, Evripidis Bampis, Alexander Kononov: A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. ESA 2001: 194-205
4		Eric Angel, Vassilis Zissimopoulos: On the landscape ruggedness of the quadratic assignment problem. Theor. Comput. Sci. 263(1-2): 159-172 (2001)
	2000
3		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		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		Eric Angel, Vassilis Zissimopoulos: Autocorrelation Coefficient for the Graph Bipartitioning Problem. Theor. Comput. Sci. 191(1-2): 229-243 (1998)

Coauthor Index

1	Evripidis Bampis	[5] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [33]
2	Lélia Blin	[18]
3	Romain Campigotto	[32]
4	Aleksei V. Fishkin	[21]
5	Rodolphe Giroudeau	[7]
6	Laurent Gourvès	[9] [10] [12] [15] [16] [18] [19] [26] [27]
7	Fadi Kacem	[31]
8	Alexander Kononov	[5] [8]
9	Christian Laforest	[32]
10	Dimitrios Letsios	[31]
11	Jérôme Monnot	[16]
12	Fanny Pascual	[11] [14] [17] [20] [22] [23] [24] [25] [28]
13	Gerasimos G. Pollatos	[29]
14	Alex-Ariel Tchetgnia	[22] [28]
15	Nicolas Thibault	[30] [33]
16	Vassilis Zissimopoulos	[1] [2] [3] [4] [6] [29]

Last update Fri Feb 10 22:28:48 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page