Laurent Gourvès

	2011
33		Bruno Escoffier, Laurent Gourvès, Nguyen Kim Thang, Fanny Pascual, Olivier Spanjaard: Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT 2011: 67-81
32		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: The Price of Optimum in a Matching Game. SAGT 2011: 81-92
31		Cristina Bazgan, Laurent Gourvès, Jérôme Monnot: Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA 2011: 233-246
30		Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62
	2010
29		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Strategic Coloring of a Graph. CIAC 2010: 155-166
28		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13
27		Hatem Chatti, Laurent Gourvès, Jérôme Monnot: On a Labeled Vehicle Routing Problem. SOFSEM 2010: 271-282
26		Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot: Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. TAMC 2010: 222-233
25		Laurent Gourvès, Jérôme Monnot: The Max k-Cut Game and Its Strong Equilibria. TAMC 2010: 234-246
24		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Minimum regulation of uncoordinated matchings CoRR abs/1012.3889: (2010)
23		Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot: The minimum reload s-t path, trail and walk problems. Discrete Applied Mathematics 158(13): 1404-1417 (2010)
22		Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis: Labeled Traveling Salesman Problems: Complexity and approximation. Discrete Optimization 7(1-2): 74-85 (2010)
21		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard: Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. European Journal of Operational Research 205(1): 19-30 (2010)
20		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1): 36-49 (2010)
	2009
19		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
18		Laurent Gourvès, Jérôme Monnot, Orestis Telelis: Selfish Scheduling with Setup Times. WINE 2009: 292-303
17		Laurent Gourvès, Jérôme Monnot: On Strong Equilibria in the Max Cut Game. WINE 2009: 608-615
16		Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti: On s-t paths and trails in edge-colored graphs. Electronic Notes in Discrete Mathematics 35: 221-226 (2009)
15		Eric Angel, Evripidis Bampis, Laurent Gourvès: On the minimum hitting set of bundles problem. Theor. Comput. Sci. 410(45): 4534-4542 (2009)
	2008
14		Eric Angel, Evripidis Bampis, Laurent Gourvès: On the Minimum Hitting Set of Bundles Problem. AAIM 2008: 3-14
13		Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis: On Labeled Traveling Salesman Problems. ISAAC 2008: 776-787
12		Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Cooperation in Multiorganization Matching. WAOA 2008: 78-91
11		Laurent Gourvès, Jérôme Monnot: Three Selfish Spanning Tree Games. WINE 2008: 465-476
	2007
10		George Christodoulou, Laurent Gourvès, Fanny Pascual: Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. COCOON 2007: 187-197
9		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213
8		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		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		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		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		Eric Angel, Evripidis Bampis, Laurent Gourvès: Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. WG 2005: 331-340
3		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		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		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

Coauthor Index

1	Eric Angel	[1] [2] [3] [4] [5] [6] [7] [14] [15]
2	Evripidis Bampis	[1] [2] [3] [4] [5] [6] [7] [14] [15]
3	Cristina Bazgan	[30] [31]
4	Lélia Blin	[6]
5	Hatem Chatti	[27]
6	George Christodoulou	[10]
7	Basile Couëtoux	[13] [22]
8	Bruno Escoffier	[9] [20] [21] [24] [28] [29] [32] [33]
9	Aristotelis Giannakos (Telis Giannakos)	[8]
10	Adria Lyra	[16] [19] [23] [26]
11	Carlos A. J. Martinhon	[16] [19] [23] [26]
12	Jérôme Monnot	[5] [8] [9] [11] [12] [13] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32]
13	Vangelis Th. Paschos	[8]
14	Fanny Pascual	[10] [12] [30] [33]
15	Fábio Protti	[16]
16	Olivier Spanjaard	[21] [33]
17	Orestis Telelis	[13] [18] [22]
18	Nguyen Kim Thang	[33]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page