Laurent Gourvès

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 35

Top Topics

Triangle Inequality

Top Venues

Theor. Comput. Sci.

Publications

Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling crosswords is very hard. Theor. Comput. Sci. 982 (2024)
Satya Tamby, Laurent Gourvès, Stefano Moretti
Greedy Heuristic Guided by Lexicographic Excellence. EvoStar (2024)
Laurent Gourvès, Aris Pagourtzis
Removable Online Knapsack with Bounded Size Items. SOFSEM (2024)
Laurent Gourvès, Gianpiero Monaco
Nash Stability in Hedonic Skill Games. AAMAS (2024)
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
Project games. Theor. Comput. Sci. 940 (Part) (2023)
Dimitris Fotakis, Laurent Gourvès
On the Distortion of Single Winner Elections with Aligned Candidates. AAMAS (2023)
Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
Sur l'Équité via la Sélection en Séquence pour l'Allocation de Biens Indivisibles. JIAF (2022)
Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos
In memory of Jérôme Monnot. Theor. Comput. Sci. 921 (2022)
Pierre Cardi, Laurent Gourvès, Julien Lesca
On Fair and Efficient Solutions for Budget Apportionment. AAMAS (2022)
Dimitris Fotakis, Laurent Gourvès
On the distortion of single winner elections with aligned candidates. Auton. Agents Multi Agent Syst. 36 (2) (2022)
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling Crosswords Is Very Hard. ISAAC (2021)
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling Crosswords is Very Hard. CoRR (2021)
Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
On Fairness via Picking Sequences in Allocation of Indivisible Goods. ADT (2021)
Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI (2021)
Pierre Cardi, Laurent Gourvès, Julien Lesca
Worst-case Bounds for Spending a Common Budget. AAMAS (2021)
Dimitris Fotakis, Laurent Gourvès, Stelios Kasouridis, Aris Pagourtzis
Object Allocation and Positive Graph Externalities. ECAI (2020)
Laurent Gourvès
Agreeable sets with matroidal constraints. J. Comb. Optim. 37 (3) (2019)
Laurent Gourvès, Jérôme Monnot
On maximin share allocations in matroids. Theor. Comput. Sci. 754 (2019)
Katarína Cechlárová, Laurent Gourvès, Julien Lesca
On the Problem of Assigning PhD Grants. IJCAI (2019)
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
Project Games. CIAC (2019)
Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Ararat Harutyunyan, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski
Local envy-freeness in house allocation problems. Auton. Agents Multi Agent Syst. 33 (5) (2019)
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
On a Simple Hedonic Game with Graph-Restricted Communication. SAGT (2019)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
Subset sum problems with digraph constraints. J. Comb. Optim. 36 (3) (2018)
Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav
Covering Clients with Types and Budgets. ISAAC (2018)
Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski
Local Envy-Freeness in House Allocation Problems. AAMAS (2018)
Laurent Gourvès, Jérôme Monnot
Approximate Maximin Share Allocations in Matroids. CIAC (2017)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica 77 (3) (2017)
Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten
Bi-objective matchings with the triangle inequality. Theor. Comput. Sci. 670 (2017)
Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
Object Allocation via Swaps along a Social Network. IJCAI (2017)
Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
Selfish Transportation Games. SOFSEM (2017)
Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
Strategic Voting in a Social Context: Considerate Equilibria. ECAI (2016)
Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot
Achieving Proportional Representation in Conference Programs. IJCAI (2016)
Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot
How Hard Is It for a Party to Nominate an Election Winner?. IJCAI (2016)
Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
Conference Program Design with Single-Peaked and Single-Crossing Preferences. WINE (2016)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
Subset Sum Problems With Digraph Constraints. CoRR (2016)
Laurent Gourvès
Profitable Deviation Strong Equilibria. ADT (2015)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
Worst case compromises in matroids with applications to the allocation of indivisible goods. Theor. Comput. Sci. 589 (2015)
Laurent Gourvès
Approximating the optimal sequence of acquisitions and sales with a capped budget. Inf. Process. Lett. 115 (10) (2015)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
Approximate tradeoffs on weighted labeled matroids. Discret. Appl. Math. 184 (2015)
Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen
Congestion Games with Capacitated Resources. Theory Comput. Syst. 57 (3) (2015)
Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. Theor. Comput. Sci. 602 (2015)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
Near Fairness in Matroids. ECAI (2014)
Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
The Lazy Matroid Problem. IFIP TCS (2014)
Diodato Ferraioli, Laurent Gourvès, Jérôme Monnot
On regular and approximately fair allocations of indivisible goods. AAMAS (2014)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
A Protocol for Cutting Matroids Like Cakes. WINE (2013)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
Single approximation for the biobjective Max TSP. Theor. Comput. Sci. 478 (2013)
Bruno Escoffier, Diodato Ferraioli, Laurent Gourvès, Stefano Moretti
Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. SAGT (2013)
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
Complexity of trails, paths and circuits in arc-colored digraphs. Discret. Appl. Math. 161 (6) (2013)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Fair solutions for some multiagent optimization problems. Auton. Agents Multi Agent Syst. 26 (2) (2013)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
Approximation with a fixed number of solutions of some multiobjective maximization problems. J. Discrete Algorithms 22 (2013)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
A Matroid Approach to the Worst Case Allocation of Indivisible Goods. IJCAI (2013)
Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. FCT (2013)
Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries
Possible Winners in Approval Voting. ADT (2013)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
Approximate Tradeoffs on Matroids. ECAI (2012)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Strategic Coloring of a Graph. Internet Math. 8 (4) (2012)
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. Discret. Math. Theor. Comput. Sci. 14 (2) (2012)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti
Cost allocation protocols for network formation on connection situations. VALUETOOLS (2012)
Laurent Gourvès, Jérôme Monnot, Fanny Pascual
Cooperation in multiorganization matching. Algorithmic Oper. Res. 7 (2) (2012)
Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen
Congestion Games with Capacitated Resources. SAGT (2012)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA (2011)
Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT (2011)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
The Price of Optimum in a Matching Game. SAGT (2011)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
Single Approximation for Biobjective Max TSP. WAOA (2011)
Laurent Gourvès, Jérôme Monnot
-Cut Game and Its Strong Equilibria. TAMC (2010)
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)
Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
Labeled Traveling Salesman Problems: Complexity and approximation. Discret. Optim. 7 (1-2) (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Strategic Coloring of a Graph. CIAC (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Minimum regulation of uncoordinated matchings CoRR (2010)
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) (2010)
Hatem Chatti, Laurent Gourvès, Jérôme Monnot
On a Labeled Vehicle Routing Problem. SOFSEM (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
On the Impact of Local Taxes in a Set Cover Game. SIROCCO (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. Eur. J. Oper. Res. 205 (1) (2010)
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
The minimum reload s-t path, trail and walk problems. Discret. Appl. Math. 158 (13) (2010)
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. Electron. Notes Discret. Math. 35 (2009)
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
The Minimum Reload s-tPath/Trail/Walk Problems. SOFSEM (2009)
Laurent Gourvès, Jérôme Monnot, Orestis Telelis
Selfish Scheduling with Setup Times. WINE (2009)
Laurent Gourvès, Jérôme Monnot
On Strong Equilibria in the Max Cut Game. WINE (2009)
Eric Angel, Evripidis Bampis, Laurent Gourvès
On the minimum hitting set of bundles problem. Theor. Comput. Sci. 410 (45) (2009)
Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
On Labeled Traveling Salesman Problems. ISAAC (2008)
Laurent Gourvès, Jérôme Monnot, Fanny Pascual
Cooperation in Multiorganization Matching. WAOA (2008)
Laurent Gourvès, Jérôme Monnot
Three Selfish Spanning Tree Games. WINE (2008)
Eric Angel, Evripidis Bampis, Laurent Gourvès
On the Minimum Hitting Set of Bundles Problem. AAIM (2008)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Complexity and Approximation Results for the Connected Vertex Cover Problem. WG (2007)
George Christodoulou, Laurent Gourvès, Fanny Pascual
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. COCOON (2007)
Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos
On the Performance of Congestion Games for Optimum Satisfiability Problems. WINE (2007)
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) (2006)
Eric Angel, Evripidis Bampis, Laurent Gourvès
Approximation algorithms for the bi-criteria weighted MAX-CUT problem. Discret. Appl. Math. 154 (12) (2006)
Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot
(1, 2). FCT (2005)
Eric Angel, Evripidis Bampis, Laurent Gourvès
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. WG (2005)
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) (2005)
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) (2004)
Eric Angel, Evripidis Bampis, Laurent Gourvès
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. FCT (2003)