| 2013 | ||
|---|---|---|
| j15 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Fair solutions for some multiagent optimization problems. Autonomous Agents and Multi-Agent Systems 26(2): 184-201 (2013) | |
| j14 | Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot: Complexity of trails, paths and circuits in arc-colored digraphs. Discrete Applied Mathematics 161(6): 819-828 (2013) | |
| j13 | Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Single approximation for the biobjective Max TSP. Theor. Comput. Sci. 478: 41-50 (2013) | |
| 2012 | ||
| j12 | Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot: On paths, trails and closed trails in edge-colored graphs. Discrete Mathematics & Theoretical Computer Science 14(2): 57-74 (2012) | |
| j11 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Strategic Coloring of a Graph. Internet Mathematics 8(4): 424-455 (2012) | |
| c25 | Laurent Gourvès, Jérôme Monnot, Lydia Tlilane: Approximate Tradeoffs on Matroids. ECAI 2012: 360-365 | |
| c24 | Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Nguyen Kim Thang: Congestion Games with Capacitated Resources. SAGT 2012: 204-215 | |
| c23 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti: Cost allocation protocols for network formation on connection situations. VALUETOOLS 2012: 228-234 | |
| 2011 | ||
| c22 | 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 | |
| c21 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: The Price of Optimum in a Matching Game. SAGT 2011: 81-92 | |
| c20 | Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62 | |
| c19 | 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 | |
| 2010 | ||
| j10 | 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) | |
| j9 | 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) | |
| j8 | 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) | |
| j7 | 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) | |
| c18 | ||
| c17 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13 | |
| c16 | Hatem Chatti, Laurent Gourvès, Jérôme Monnot: On a Labeled Vehicle Routing Problem. SOFSEM 2010: 271-282 | |
| c15 | 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 | |
| c14 | ||
| i1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Minimum regulation of uncoordinated matchings. CoRR abs/1012.3889 (2010) | |
| 2009 | ||
| j6 | 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) | |
| j5 | Eric Angel, Evripidis Bampis, Laurent Gourvès: On the minimum hitting set of bundles problem. Theor. Comput. Sci. 410(45): 4534-4542 (2009) | |
| c13 | 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 | |
| c12 | Laurent Gourvès, Jérôme Monnot, Orestis Telelis: Selfish Scheduling with Setup Times. WINE 2009: 292-303 | |
| c11 | ||
| 2008 | ||
| c10 | Eric Angel, Evripidis Bampis, Laurent Gourvès: On the Minimum Hitting Set of Bundles Problem. AAIM 2008: 3-14 | |
| c9 | Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis: On Labeled Traveling Salesman Problems. ISAAC 2008: 776-787 | |
| c8 | Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Cooperation in Multiorganization Matching. WAOA 2008: 78-91 | |
| c7 | ||
| 2007 | ||
| c6 | George Christodoulou, Laurent Gourvès, Fanny Pascual: Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. COCOON 2007: 187-197 | |
| c5 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213 | |
| c4 | 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 | ||
| j4 | 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) | |
| j3 | 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 | ||
| j2 | 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) | |
| c3 | Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot: (Non)-Approximability for the Multi-criteria TSP(1, 2). FCT 2005: 329-340 | |
| c2 | Eric Angel, Evripidis Bampis, Laurent Gourvès: Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. WG 2005: 331-340 | |
| 2004 | ||
| j1 | 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 | ||
| c1 | 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 | |
Data released under the ODC-BY 1.0 license — See also our legal information page