| 2026 | IWOCA | Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes. | Dimitris Fotakis, Laurent Gourvs, Aris Pagourtzis, Panagiotis Patsilinakos |
| 2025 | AAAI | Individually Stable Dynamics in Coalition Formation over Graphs. | Angelo Fanelli, Laurent Gourvs, Ayumi Igarashi, Luca Moscardelli |
| 2025 | AAAI | On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries. | Dimitris Fotakis, Laurent Gourvs, Panagiotis Patsilinakos |
| 2024 | EvoCOP | Greedy Heuristic Guided by Lexicographic Excellence. | Satya Tamby, Laurent Gourvs, Stefano Moretti |
| 2024 | SOFSEM | Removable Online Knapsack with Bounded Size Items. | Laurent Gourvs, Aris Pagourtzis |
| 2021 | ISAAC | Filling Crosswords Is Very Hard. | Laurent Gourvs, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
| 2021 | WABI | The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. | Nicolas Boria, Laurent Gourvs, Vangelis Th. Paschos, Jrme Monnot |
| 2020 | ECAI | Object Allocation and Positive Graph Externalities. | Dimitris Fotakis, Laurent Gourvs, Stelios Kasouridis, Aris Pagourtzis |
| 2019 | CIAC | Project Games. | Vittorio Bil, Laurent Gourvs, Jrme Monnot |
| 2019 | IJCAI | On the Problem of Assigning PhD Grants. | Katarna Cechlrov, Laurent Gourvs, Julien Lesca |
| 2019 | SAGT | On a Simple Hedonic Game with Graph-Restricted Communication. | Vittorio Bil, Laurent Gourvs, Jrme Monnot |
| 2018 | ISAAC | Covering Clients with Types and Budgets. | Dimitris Fotakis, Laurent Gourvs, Claire Mathieu, Abhinav Srivastav |
| 2017 | CIAC | Approximate Maximin Share Allocations in Matroids. | Laurent Gourvs, Jrme Monnot |
| 2017 | IJCAI | Object Allocation via Swaps along a Social Network. | Laurent Gourvs, Julien Lesca, Analle Wilczynski |
| 2017 | SOFSEM | Selfish Transportation Games. | Dimitris Fotakis, Laurent Gourvs, Jrme Monnot |
| 2016 | ECAI | Strategic Voting in a Social Context: Considerate Equilibria. | Laurent Gourvs, Julien Lesca, Analle Wilczynski |
| 2016 | IJCAI | Achieving Proportional Representation in Conference Programs. | Ioannis Caragiannis, Laurent Gourvs, Jrme Monnot |
| 2016 | IJCAI | How Hard Is It for a Party to Nominate an Election Winner?. | Piotr Faliszewski, Laurent Gourvs, Jrme Lang, Julien Lesca, Jrme Monnot |
| 2014 | ECAI | Near Fairness in Matroids. | Laurent Gourvs, Jrme Monnot, Lydia Tlilane |
| 2013 | FCT | The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. | Laurent Gourvs, Jrme Monnot, Aris Pagourtzis |
| 2013 | IJCAI | A Matroid Approach to the Worst Case Allocation of Indivisible Goods. | Laurent Gourvs, Jrme Monnot, Lydia Tlilane |
| 2013 | SAGT | Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. | Bruno Escoffier, Diodato Ferraioli, Laurent Gourvs, Stefano Moretti |
| 2012 | ECAI | Approximate Tradeoffs on Matroids. | Laurent Gourvs, Jrme Monnot, Lydia Tlilane |
| 2012 | SAGT | Congestion Games with Capacitated Resources. | Laurent Gourvs, Jrme Monnot, Stefano Moretti, Kim Thang Nguyen |
| 2011 | SAGT | The Price of Optimum in a Matching Game. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2011 | WAOA | Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. | Cristina Bazgan, Laurent Gourvs, Jrme Monnot |
| 2011 | WAOA | Single Approximation for Biobjective Max TSP. | Cristina Bazgan, Laurent Gourvs, Jrme Monnot, Fanny Pascual |
| 2010 | CIAC | Strategic Coloring of a Graph. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2010 | SIROCCO | On the Impact of Local Taxes in a Set Cover Game. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2010 | SOFSEM | On a Labeled Vehicle Routing Problem. | Hatem Chatti, Laurent Gourvs, Jrme Monnot |
| 2010 | TAMC | Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. | Laurent Gourvs, Adria Lyra, Carlos A. J. Martinhon, Jrme Monnot |
| 2010 | TAMC | The Max | Laurent Gourvs, Jrme Monnot |
| 2009 | SOFSEM | The Minimum Reload s-tPath/Trail/Walk Problems. | Laurent Gourvs, Adria Lyra, Carlos A. J. Martinhon, Jrme Monnot |
| 2008 | AAIM | On the Minimum Hitting Set of Bundles Problem. | Eric Angel, Evripidis Bampis, Laurent Gourvs |
| 2008 | ISAAC | On Labeled Traveling Salesman Problems. | Basile Coutoux, Laurent Gourvs, Jrme Monnot, Orestis Telelis |
| 2008 | WAOA | Cooperation in Multiorganization Matching. | Laurent Gourvs, Jrme Monnot, Fanny Pascual |
| 2007 | COCOON | Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. | George Christodoulou, Laurent Gourvs, Fanny Pascual |
| 2007 | WG | Complexity and Approximation Results for the Connected Vertex Cover Problem. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2005 | FCT | (Non)-Approximability for the Multi-criteria | Eric Angel, Evripidis Bampis, Laurent Gourvs, Jrme Monnot |
| 2005 | WG | Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. | Eric Angel, Evripidis Bampis, Laurent Gourvs |
| 2003 | FCT | Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. | Eric Angel, Evripidis Bampis, Laurent Gourvs |