A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Metaheuristics for Multiobjective Optimisation, 2004)

Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Theor. Comput. Sci., 2004)

(Non)-Approximability for the Multi-criteria TSP(1, 2). - Eric Angel; Evripidis Bampis; Laurent Gourvès; Jérôme Monnot (FCT, 2005)

Approximation results for a bicriteria job scheduling problem on a single machine without preemption. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Inf. Process. Lett., 2005)

Approximation algorithms for the bi-criteria weighted MAX-CUT problem. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Discret. Appl. Math., 2006)

Fair cost-sharing methods for the minimum spanning tree game. - Eric Angel; Evripidis Bampis; Lélia Blin; Laurent Gourvès (Inf. Process. Lett., 2006)

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. - George Christodoulou 001; Laurent Gourvès; Fanny Pascual (COCOON, 2007)

Complexity and Approximation Results for the Connected Vertex Cover Problem. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (WG, 2007)

On the Performance of Congestion Games for Optimum Satisfiability Problems. - Aristotelis Giannakos; Laurent Gourvès; Jérôme Monnot; Vangelis Th. Paschos (WINE, 2007)

Approximation in Multiobjective Problems. - Laurent Gourvès; Evripidis Bampis; Eric Angel (Handbook of Approximation Algorithms and Metaheuristics, 2007)

On Labeled Traveling Salesman Problems. - Basile Couëtoux; Laurent Gourvès; Jérôme Monnot; Orestis Telelis (ISAAC, 2008)

Three Selfish Spanning Tree Games. - Laurent Gourvès; Jérôme Monnot (WINE, 2008)

The Minimum Reload s-tPath/Trail/Walk Problems. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot (SOFSEM, 2009)

On Strong Equilibria in the Max Cut Game. - Laurent Gourvès; Jérôme Monnot (WINE, 2009)

Selfish Scheduling with Setup Times. - Laurent Gourvès; Jérôme Monnot; Orestis Telelis (WINE, 2009)

On s-t paths and trails in edge-colored graphs. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot; Fábio Protti (Electron. Notes Discret. Math., 2009)

On the minimum hitting set of bundles problem. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Theor. Comput. Sci., 2009)

On the Impact of Local Taxes in a Set Cover Game. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (SIROCCO, 2010)

On a Labeled Vehicle Routing Problem. - Hatem Chatti; Laurent Gourvès; Jérôme Monnot (SOFSEM, 2010)

Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot (TAMC, 2010)

The Max k-Cut Game and Its Strong Equilibria. - Laurent Gourvès; Jérôme Monnot (TAMC, 2010)

Minimum regulation of uncoordinated matchings - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (CoRR, 2010)

The minimum reload s-t path, trail and walk problems. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot (Discret. Appl. Math., 2010)

Labeled Traveling Salesman Problems: Complexity and approximation. - Basile Couëtoux; Laurent Gourvès; Jérôme Monnot; Orestis Telelis (Discret. Optim., 2010)

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot; Olivier Spanjaard (Eur. J. Oper. Res., 2010)

Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (J. Discrete Algorithms, 2010)

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. - Bruno Escoffier; Laurent Gourvès; Kim Thang Nguyen; Fanny Pascual; Olivier Spanjaard (ADT, 2011)

The Price of Optimum in a Matching Game. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (SAGT, 2011)

Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. - Cristina Bazgan; Laurent Gourvès; Jérôme Monnot (WAOA, 2011)

Approximate Tradeoffs on Matroids. - Laurent Gourvès; Jérôme Monnot; Lydia Tlilane (ECAI, 2012)

Cost allocation protocols for network formation on connection situations. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot; Stefano Moretti 001 (VALUETOOLS, 2012)

Cooperation in multiorganization matching. - Laurent Gourvès; Jérôme Monnot; Fanny Pascual (Algorithmic Oper. Res., 2012)

On paths, trails and closed trails in edge-colored graphs. - Laurent Gourvès; Adria Ramos de Lyra; Carlos A. J. Martinhon; Jérôme Monnot (Discret. Math. Theor. Comput. Sci., 2012)

Strategic Coloring of a Graph. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (Internet Math., 2012)

Possible Winners in Approval Voting. - Nathanaël Barrot; Laurent Gourvès; Jérôme Lang; Jérôme Monnot; Bernard Ries (ADT, 2013)

The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. - Laurent Gourvès; Jérôme Monnot; Aris Pagourtzis (FCT, 2013)

A Matroid Approach to the Worst Case Allocation of Indivisible Goods. - Laurent Gourvès; Jérôme Monnot; Lydia Tlilane (IJCAI, 2013)

Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. - Bruno Escoffier; Diodato Ferraioli; Laurent Gourvès; Stefano Moretti 001 (SAGT, 2013)

A Protocol for Cutting Matroids Like Cakes. - Laurent Gourvès; Jérôme Monnot; Lydia Tlilane (WINE, 2013)

Fair solutions for some multiagent optimization problems. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (Auton. Agents Multi Agent Syst., 2013)

Complexity of trails, paths and circuits in arc-colored digraphs. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot (Discret. Appl. Math., 2013)

Approximation with a fixed number of solutions of some multiobjective maximization problems. - Cristina Bazgan; Laurent Gourvès; Jérôme Monnot (J. Discrete Algorithms, 2013)

Single approximation for the biobjective Max TSP. - Cristina Bazgan; Laurent Gourvès; Jérôme Monnot; Fanny Pascual (Theor. Comput. Sci., 2013)

On regular and approximately fair allocations of indivisible goods. - Diodato Ferraioli; Laurent Gourvès; Jérôme Monnot (AAMAS, 2014)

Near Fairness in Matroids. - Laurent Gourvès; Jérôme Monnot; Lydia Tlilane (ECAI, 2014)

The Lazy Matroid Problem. - Laurent Gourvès; Jérôme Monnot; Aris Pagourtzis (IFIP TCS, 2014)

Profitable Deviation Strong Equilibria. - Laurent Gourvès (ADT, 2015)

Approximate tradeoffs on weighted labeled matroids. - Laurent Gourvès; Jérôme Monnot; Lydia Tlilane (Discret. Appl. Math., 2015)

Approximating the optimal sequence of acquisitions and sales with a capped budget. - Laurent Gourvès (Inf. Process. Lett., 2015)

Congestion Games with Capacitated Resources. - Laurent Gourvès; Jérôme Monnot; Stefano Moretti 001; Kim Thang Nguyen (Theory Comput. Syst., 2015)

The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. - Luérbio Faria; Laurent Gourvès; Carlos A. J. Martinhon; Jérôme Monnot (Theor. Comput. Sci., 2015)

Worst case compromises in matroids with applications to the allocation of indivisible goods. - Laurent Gourvès; Jérôme Monnot; Lydia Tlilane (Theor. Comput. Sci., 2015)

Strategic Voting in a Social Context: Considerate Equilibria. - Laurent Gourvès; Julien Lesca; Anaëlle Wilczynski (ECAI, 2016)

Achieving Proportional Representation in Conference Programs. - Ioannis Caragiannis; Laurent Gourvès; Jérôme Monnot (IJCAI, 2016)

How Hard Is It for a Party to Nominate an Election Winner?. - Piotr Faliszewski; Laurent Gourvès; Jérôme Lang; Julien Lesca; Jérôme Monnot (IJCAI, 2016)

Conference Program Design with Single-Peaked and Single-Crossing Preferences. - Dimitris Fotakis 001; Laurent Gourvès; Jérôme Monnot (WINE, 2016)

Approximate Maximin Share Allocations in Matroids. - Laurent Gourvès; Jérôme Monnot (CIAC, 2017)

Object Allocation via Swaps along a Social Network. - Laurent Gourvès; Julien Lesca; Anaëlle Wilczynski (IJCAI, 2017)

Selfish Transportation Games. - Dimitris Fotakis 001; Laurent Gourvès; Jérôme Monnot (SOFSEM, 2017)

The Price of Optimum: Complexity and Approximation for a Matching Game. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (Algorithmica, 2017)

Bi-objective matchings with the triangle inequality. - Laurent Gourvès; Jérôme Monnot; Fanny Pascual; Daniel Vanderpooten (Theor. Comput. Sci., 2017)

Local Envy-Freeness in House Allocation Problems. - Aurélie Beynier; Yann Chevaleyre; Laurent Gourvès; Julien Lesca; Nicolas Maudet; Anaëlle Wilczynski (AAMAS, 2018)

Covering Clients with Types and Budgets. - Dimitris Fotakis 001; Laurent Gourvès; Claire Mathieu; Abhinav Srivastav (ISAAC, 2018)

Subset sum problems with digraph constraints. - Laurent Gourvès; Jérôme Monnot; Lydia Tlilane (J. Comb. Optim., 2018)

On the Problem of Assigning PhD Grants. - Katarína Cechlárová; Laurent Gourvès; Julien Lesca (IJCAI, 2019)

On a Simple Hedonic Game with Graph-Restricted Communication. - Vittorio Bilò; Laurent Gourvès; Jérôme Monnot (SAGT, 2019)

Local envy-freeness in house allocation problems. - Aurélie Beynier; Yann Chevaleyre; Laurent Gourvès; Ararat Harutyunyan; Julien Lesca; Nicolas Maudet; Anaëlle Wilczynski (Auton. Agents Multi Agent Syst., 2019)

Agreeable sets with matroidal constraints. - Laurent Gourvès (J. Comb. Optim., 2019)

On maximin share allocations in matroids. - Laurent Gourvès; Jérôme Monnot (Theor. Comput. Sci., 2019)

Object Allocation and Positive Graph Externalities. - Dimitris Fotakis 001; Laurent Gourvès; Stelios Kasouridis; Aris Pagourtzis (ECAI, 2020)

On Fairness via Picking Sequences in Allocation of Indivisible Goods. - Laurent Gourvès; Julien Lesca; Anaëlle Wilczynski (ADT, 2021)

Worst-case Bounds for Spending a Common Budget. - Pierre Cardi; Laurent Gourvès; Julien Lesca (AAMAS, 2021)

The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. - Nicolas Boria; Laurent Gourvès; Vangelis Th. Paschos; Jérôme Monnot (WABI, 2021)

Sur l'Équité via la Sélection en Séquence pour l'Allocation de Biens Indivisibles. - Laurent Gourvès; Julien Lesca; Anaëlle Wilczynski (JIAF, 2022)

On the distortion of single winner elections with aligned candidates. - Dimitris Fotakis 001; Laurent Gourvès (Auton. Agents Multi Agent Syst., 2022)

In memory of Jérôme Monnot. - Bruno Escoffier; Laurent Gourvès; Vangelis Th. Paschos (Theor. Comput. Sci., 2022)

Project games. - Vittorio Bilò; Laurent Gourvès; Jérôme Monnot (Theor. Comput. Sci., 2023)

Nash Stability in Hedonic Skill Games. - Laurent Gourvès; Gianpiero Monaco (AAMAS, 2024)

Greedy Heuristic Guided by Lexicographic Excellence. - Satya Tamby; Laurent Gourvès; Stefano Moretti 001 (EvoStar, 2024)

Removable Online Knapsack with Bounded Size Items. - Laurent Gourvès; Aris Pagourtzis (SOFSEM, 2024)

Filling crosswords is very hard. - Laurent Gourvès; Ararat Harutyunyan; Michael Lampis; Nikolaos Melissinos (Theor. Comput. Sci., 2024)

Individually Stable Dynamics in Coalition Formation over Graphs. - Angelo Fanelli 001; Laurent Gourvès; Ayumi Igarashi 001; Luca Moscardelli (AAAI, 2025)

On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries. - Dimitris Fotakis 001; Laurent Gourvès; Panagiotis Patsilinakos (AAAI, 2025)

Minimizing Rosenthal's Potential in Monotone Congestion Games. - Vittorio Bilò; Angelo Fanelli 001; Laurent Gourvès; Christos Tsoufis; Cosimo Vinci (AAMAS, 2025)

Social Ranking for Feature Selection. - Laurent Gourvès; Stefano Moretti 001; Satya Tamby (AAMAS, 2025)

Satisfactory Budget Division. - Laurent Gourvès; Michael Lampis; Nikolaos Melissinos; Aris Pagourtzis (AAMAS, 2025)

Existence, Computation and Efficiency of Nash Stable Outcomes in Hedonic Skill Games. - Laurent Gourvès; Gianpiero Monaco (J. Artif. Intell. Res., 2025)

Worst-case fair guarantees when spending a common budget. - Pierre Cardi; Laurent Gourvès; Julien Lesca (Theor. Comput. Sci., 2025)

On fair and efficient solutions for budget apportionment. - Pierre Cardi; Laurent Gourvès; Julien Lesca (Auton. Agents Multi Agent Syst., 2025)