Laurent Gourvès

108 papers A* 7A 13B 20C 7Misc 1Journal 44Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Feature selection with a lexicographic social ranking method.
Int. J. Approx. Reason.
Laurent Gourvès, Stefano Moretti, Satya Tamby
2025 J jnl
Existence, Computation and Efficiency of Nash Stable Outcomes in Hedonic Skill Games.
J. Artif. Intell. Res.
Laurent Gourvès, Gianpiero Monaco
2025 A* conf
Individually Stable Dynamics in Coalition Formation over Graphs.
AAAI
Angelo Fanelli, Laurent Gourvès, Ayumi Igarashi, Luca Moscardelli
2025 A conf
Minimizing Rosenthal's Potential in Monotone Congestion Games.
AAMAS
Vittorio Bilò, Angelo Fanelli, Laurent Gourvès, Christos Tsoufis, Cosimo Vinci
2025 J jnl
On a Simple Hedonic Game with Graph-Restricted Communication.
J. Artif. Intell. Res.
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
2025 J jnl
On fair and efficient solutions for budget apportionment.
Auton. Agents Multi Agent Syst.
Pierre Cardi, Laurent Gourvès, Julien Lesca
2025 A* conf
On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries.
AAAI
Dimitris Fotakis, Laurent Gourvès, Panagiotis Patsilinakos
2025 A conf
Satisfactory Budget Division.
AAMAS
Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis
2025 J jnl
Satisfactory Budget Division.
CoRR
Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis
2025 A conf
Social Ranking for Feature Selection.
AAMAS
Laurent Gourvès, Stefano Moretti, Satya Tamby
2025 J jnl
Worst-case fair guarantees when spending a common budget.
Theor. Comput. Sci.
Pierre Cardi, Laurent Gourvès, Julien Lesca
2024 J jnl
Filling crosswords is very hard.
Theor. Comput. Sci.
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2024 — conf
Greedy Heuristic Guided by Lexicographic Excellence.
EvoStar
Satya Tamby, Laurent Gourvès, Stefano Moretti
2024 J jnl
Individually Stable Dynamics in Coalition Formation over Graphs.
CoRR
Angelo Fanelli, Laurent Gourvès, Ayumi Igarashi, Luca Moscardelli
2024 J jnl
Minimizing Rosenthal's Potential in Monotone Congestion Games.
CoRR
Vittorio Bilò, Angelo Fanelli, Laurent Gourvès, Christos Tsoufis, Cosimo Vinci
2024 A conf
Nash Stability in Hedonic Skill Games.
AAMAS
Laurent Gourvès, Gianpiero Monaco
2024 J jnl
On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries.
CoRR
Dimitris Fotakis, Laurent Gourvès, Panagiotis Patsilinakos
2024 B conf
Removable Online Knapsack with Bounded Size Items.
SOFSEM
Laurent Gourvès, Aris Pagourtzis
2023 A conf
On the Distortion of Single Winner Elections with Aligned Candidates.
AAMAS
Dimitris Fotakis, Laurent Gourvès
2023 J jnl
Project games.
Theor. Comput. Sci.
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
2022 J jnl
In memory of Jérôme Monnot.
Theor. Comput. Sci.
Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos
2022 A conf
On Fair and Efficient Solutions for Budget Apportionment.
AAMAS
Pierre Cardi, Laurent Gourvès, Julien Lesca
2022 J jnl
On the distortion of single winner elections with aligned candidates.
Auton. Agents Multi Agent Syst.
Dimitris Fotakis, Laurent Gourvès
2022 — conf
Sur l'Équité via la Sélection en Séquence pour l'Allocation de Biens Indivisibles.
JIAF
Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
2021 B conf
Filling Crosswords Is Very Hard.
ISAAC
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021 J jnl
Filling Crosswords is Very Hard.
CoRR
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021 — conf
On Fairness via Picking Sequences in Allocation of Indivisible Goods.
ADT
Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
2021 C conf
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet.
WABI
Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot
2021 A conf
Worst-case Bounds for Spending a Common Budget.
AAMAS
Pierre Cardi, Laurent Gourvès, Julien Lesca
2020 A conf
Object Allocation and Positive Graph Externalities.
ECAI
Dimitris Fotakis, Laurent Gourvès, Stelios Kasouridis, Aris Pagourtzis
2019 J jnl
Agreeable sets with matroidal constraints.
J. Comb. Optim.
Laurent Gourvès
2019 J jnl
Local envy-freeness in house allocation problems.
Auton. Agents Multi Agent Syst.
Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Ararat Harutyunyan, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski
2019 B conf
On a Simple Hedonic Game with Graph-Restricted Communication.
SAGT
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
2019 J jnl
On maximin share allocations in matroids.
Theor. Comput. Sci.
Laurent Gourvès, Jérôme Monnot
2019 A* conf
On the Problem of Assigning PhD Grants.
IJCAI
Katarína Cechlárová, Laurent Gourvès, Julien Lesca
2019 C conf
Project Games.
CIAC
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
2018 B conf
Covering Clients with Types and Budgets.
ISAAC
Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav
2018 A conf
Local Envy-Freeness in House Allocation Problems.
AAMAS
Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski
2018 J jnl
Subset sum problems with digraph constraints.
J. Comb. Optim.
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2017 C conf
Approximate Maximin Share Allocations in Matroids.
CIAC
Laurent Gourvès, Jérôme Monnot
2017 J jnl
Bi-objective matchings with the triangle inequality.
Theor. Comput. Sci.
Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten
2017 A* conf
Object Allocation via Swaps along a Social Network.
IJCAI
Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
2017 B conf
Selfish Transportation Games.
SOFSEM
Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
2017 J jnl
The Price of Optimum: Complexity and Approximation for a Matching Game.
Algorithmica
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2016 A* conf
Achieving Proportional Representation in Conference Programs.
IJCAI
Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot
2016 — conf
Conference Program Design with Single-Peaked and Single-Crossing Preferences.
WINE
Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
2016 A* conf
How Hard Is It for a Party to Nominate an Election Winner?.
IJCAI
Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot
2016 A conf
Strategic Voting in a Social Context: Considerate Equilibria.
ECAI
Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
2016 J jnl
Subset Sum Problems With Digraph Constraints.
CoRR
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2015 J jnl
Approximate tradeoffs on weighted labeled matroids.
Discret. Appl. Math.
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2015 J jnl
Approximating the optimal sequence of acquisitions and sales with a capped budget.
Inf. Process. Lett.
Laurent Gourvès
2015 J jnl
Congestion Games with Capacitated Resources.
Theory Comput. Syst.
Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen
2015 — conf
Profitable Deviation Strong Equilibria.
ADT
Laurent Gourvès
2015 J jnl
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles.
Theor. Comput. Sci.
Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot
2015 J jnl
Worst case compromises in matroids with applications to the allocation of indivisible goods.
Theor. Comput. Sci.
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2014 A conf
Near Fairness in Matroids.
ECAI
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2014 A conf
On regular and approximately fair allocations of indivisible goods.
AAMAS
Diodato Ferraioli, Laurent Gourvès, Jérôme Monnot
2014 — conf
The Lazy Matroid Problem.
IFIP TCS
Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
2013 A* conf
A Matroid Approach to the Worst Case Allocation of Indivisible Goods.
IJCAI
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2013 — conf
A Protocol for Cutting Matroids Like Cakes.
WINE
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2013 J jnl
Approximation with a fixed number of solutions of some multiobjective maximization problems.
J. Discrete Algorithms
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
2013 J jnl
Complexity of trails, paths and circuits in arc-colored digraphs.
Discret. Appl. Math.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2013 B conf
Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games.
SAGT
Bruno Escoffier, Diodato Ferraioli, Laurent Gourvès, Stefano Moretti
2013 J jnl
Fair solutions for some multiagent optimization problems.
Auton. Agents Multi Agent Syst.
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2013 — conf
Possible Winners in Approval Voting.
ADT
Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries
2013 J jnl
Single approximation for the biobjective Max TSP.
Theor. Comput. Sci.
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2013 B conf
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.
FCT
Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
2012 A conf
Approximate Tradeoffs on Matroids.
ECAI
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2012 B conf
Congestion Games with Capacitated Resources.
SAGT
Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen
2012 J jnl
Cooperation in multiorganization matching.
Algorithmic Oper. Res.
Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2012 — conf
Cost allocation protocols for network formation on connection situations.
VALUETOOLS
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti
2012 J jnl
On paths, trails and closed trails in edge-colored graphs.
Discret. Math. Theor. Comput. Sci.
Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2012 J jnl
Strategic Coloring of a Graph.
Internet Math.
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2011 B conf
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems.
WAOA
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
2011 B conf
Single Approximation for Biobjective Max TSP.
WAOA
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2011 — conf
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities.
ADT
Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard
2011 B conf
The Price of Optimum in a Matching Game.
SAGT
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010 J jnl
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs.
J. Discrete Algorithms
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010 C conf
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.
TAMC
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2010 J jnl
Labeled Traveling Salesman Problems: Complexity and approximation.
Discret. Optim.
Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
2010 J jnl
Minimum regulation of uncoordinated matchings
CoRR
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010 B conf
On a Labeled Vehicle Routing Problem.
SOFSEM
Hatem Chatti, Laurent Gourvès, Jérôme Monnot
2010 B conf
On the Impact of Local Taxes in a Set Cover Game.
SIROCCO
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010 C conf
Strategic Coloring of a Graph.
CIAC
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010 C conf
The Max
TAMC
Laurent Gourvès, Jérôme Monnot
2010 J jnl
The minimum reload s-t path, trail and walk problems.
Discret. Appl. Math.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2010 J jnl
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.
Eur. J. Oper. Res.
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard
2009 — conf
On Strong Equilibria in the Max Cut Game.
WINE
Laurent Gourvès, Jérôme Monnot
2009 J jnl
On s-t paths and trails in edge-colored graphs.
Electron. Notes Discret. Math.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti
2009 J jnl
On the minimum hitting set of bundles problem.
Theor. Comput. Sci.
Eric Angel, Evripidis Bampis, Laurent Gourvès
2009 — conf
Selfish Scheduling with Setup Times.
WINE
Laurent Gourvès, Jérôme Monnot, Orestis Telelis
2009 B conf
The Minimum Reload s-tPath/Trail/Walk Problems.
SOFSEM
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2008 B conf
Cooperation in Multiorganization Matching.
WAOA
Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2008 B conf
On Labeled Traveling Salesman Problems.
ISAAC
Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
2008 C conf
On the Minimum Hitting Set of Bundles Problem.
AAIM
Eric Angel, Evripidis Bampis, Laurent Gourvès
2008 — conf
Three Selfish Spanning Tree Games.
WINE
Laurent Gourvès, Jérôme Monnot
2007 — ch.
Approximation in Multiobjective Problems.
Handbook of Approximation Algorithms and Metaheuristics
Laurent Gourvès, Evripidis Bampis, Eric Angel
2007 B conf
Complexity and Approximation Results for the Connected Vertex Cover Problem.
WG
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2007 — conf
On the Performance of Congestion Games for Optimum Satisfiability Problems.
WINE
Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos
2007 Misc conf
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.
COCOON
George Christodoulou, Laurent Gourvès, Fanny Pascual
2006 J jnl
Approximation algorithms for the bi-criteria weighted MAX-CUT problem.
Discret. Appl. Math.
Eric Angel, Evripidis Bampis, Laurent Gourvès
2006 J jnl
Fair cost-sharing methods for the minimum spanning tree game.
Inf. Process. Lett.
Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès
2005 B conf
(Non)-Approximability for the Multi-criteria
FCT
Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot
2005 B conf
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.
WG
Eric Angel, Evripidis Bampis, Laurent Gourvès
2005 J jnl
Approximation results for a bicriteria job scheduling problem on a single machine without preemption.
Inf. Process. Lett.
Eric Angel, Evripidis Bampis, Laurent Gourvès
2004 — ch.
A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem.
Metaheuristics for Multiobjective Optimisation
Eric Angel, Evripidis Bampis, Laurent Gourvès
2004 J jnl
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.
Theor. Comput. Sci.
Eric Angel, Evripidis Bampis, Laurent Gourvès
2003 B conf
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem.
FCT
Eric Angel, Evripidis Bampis, Laurent Gourvès