2009 |
15 | EE | Laurent Gourvès,
Adria Lyra,
Carlos A. J. Martinhon,
Jérôme Monnot:
The Minimum Reload s-tPath/Trail/Walk Problems.
SOFSEM 2009: 621-632 |
2008 |
14 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
On the Minimum Hitting Set of Bundles Problem.
AAIM 2008: 3-14 |
13 | EE | Basile Couëtoux,
Laurent Gourvès,
Jérôme Monnot,
Orestis Telelis:
On Labeled Traveling Salesman Problems.
ISAAC 2008: 776-787 |
12 | EE | Laurent Gourvès,
Jérôme Monnot,
Fanny Pascual:
Cooperation in Multiorganization Matching.
WAOA 2008: 78-91 |
11 | EE | Laurent Gourvès,
Jérôme Monnot:
Three Selfish Spanning Tree Games.
WINE 2008: 465-476 |
2007 |
10 | EE | George Christodoulou,
Laurent Gourvès,
Fanny Pascual:
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.
COCOON 2007: 187-197 |
9 | EE | Bruno Escoffier,
Laurent Gourvès,
Jérôme Monnot:
Complexity and Approximation Results for the Connected Vertex Cover Problem.
WG 2007: 202-213 |
8 | EE | Aristotelis Giannakos,
Laurent Gourvès,
Jérôme Monnot,
Vangelis Th. Paschos:
On the Performance of Congestion Games for Optimum Satisfiability Problems.
WINE 2007: 220-231 |
2006 |
7 | 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) |
6 | 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) |
2005 |
5 | 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 |
4 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès:
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.
WG 2005: 331-340 |
3 | 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 |
2 | 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 |
1 | 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 |