The maximum f-depth spanning tree problem. - Jérôme Monnot (Inf. Process. Lett., 2001)

Weighted Node Coloring: When Stable Sets Are Expensive. - Marc Demange; Dominique de Werra; Jérôme Monnot; Vangelis Th. Paschos (WG, 2002)

Differential approximation results for the traveling salesman and related problems. - Jérôme Monnot (Inf. Process. Lett., 2002)

Differential approximation of NP-hard problems with equal size feasible solutions. - Jérôme Monnot (RAIRO Oper. Res., 2002)

Differential Approximation for Some Routing Problems. - Cristina Bazgan; Refael Hassin; Jérôme Monnot (CIAC, 2003)

Bottleneck shortest paths on a partially ordered scale. - Jérôme Monnot; Olivier Spanjaard (4OR, 2003)

Differential approximation results for the Steiner tree problem. - Marc Demange; Jérôme Monnot; Vangelis Th. Paschos (Appl. Math. Lett., 2003)

Differential approximation results for the traveling salesman problem with distances 1 and 2. - Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse (Eur. J. Oper. Res., 2003)

Approximation algorithms for the traveling salesman problem. - Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse (Math. Methods Oper. Res., 2003)

Local search for the minimum label spanning tree problem with bounded color classes. - Tobias Brüggemann; Jérôme Monnot; Gerhard J. Woeginger (Oper. Res. Lett., 2003)

Optima locaux garantis pour l'approximation différentielle. - Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse (Tech. Sci. Informatiques, 2003)

Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. - Jérôme Monnot; Vangelis Th. Paschos; Dominique de Werra; Marc Demange; Bruno Escoffier (ISAAC, 2004)

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. - Dominique de Werra; Marc Demange; Jérôme Monnot; Vangelis Th. Paschos (WG, 2004)

Local approximations for maximum partial subgraph problem. - Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse (Oper. Res. Lett., 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 the Weighted P4 Partition Problems. - Jérôme Monnot; Sophie Toulouse (FCT, 2005)

On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. - Jérôme Monnot (ISAAC, 2005)

Greedy Differential Approximations for Min Set Cover. - Cristina Bazgan; Jérôme Monnot; Vangelis Th. Paschos; Fabrice Serrière (SOFSEM, 2005)

Approximation algorithms for some vehicle routing problems. - Cristina Bazgan; Refael Hassin; Jérôme Monnot (Discret. Appl. Math., 2005)

A hypocoloring model for batch scheduling. - Dominique de Werra; Marc Demange; Jérôme Monnot; Vangelis Th. Paschos (Discret. Appl. Math., 2005)

Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s). - Jérôme Monnot (Eur. J. Oper. Res., 2005)

The labeled perfect matching in bipartite graphs. - Jérôme Monnot (Inf. Process. Lett., 2005)

The maximum saving partition problem. - Refael Hassin; Jérôme Monnot (Oper. Res. Lett., 2005)

On the differential approximation of MIN SET COVER. - Cristina Bazgan; Jérôme Monnot; Vangelis Th. Paschos; Fabrice Serrière (Theor. Comput. Sci., 2005)

A simple approximation algorithm for WIS based on the approximability in k. - Jérôme Monnot (Eur. J. Oper. Res., 2006)

Weighted Coloring: further complexity and approximability results. - Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos (Inf. Process. Lett., 2006)

The Pk Partition Problem and Related Problems in Bipartite Graphs. - Jérôme Monnot; Sophie Toulouse (SOFSEM (1), 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 algorithms and hardness results for labeled connectivity problems. - Refael Hassin; Jérôme Monnot; Danny Segev (J. Comb. Optim., 2007)

The path partition problem and related problems in bipartite graphs. - Jérôme Monnot; Sophie Toulouse (Oper. Res. Lett., 2007)

Time slot scheduling of compatible jobs. - Marc Demange; Dominique de Werra; Jérôme Monnot; Vangelis Th. Paschos (J. Sched., 2007)

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

Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. - Bruno Escoffier; Jérôme Monnot; Olivier Spanjaard (SOFSEM, 2008)

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

Approximation results for the weighted P4 partition problem. - Jérôme Monnot; Sophie Toulouse (J. Discrete Algorithms, 2008)

Some tractable instances of interval data minmax regret problems. - Bruno Escoffier; Jérôme Monnot; Olivier Spanjaard (Oper. Res. Lett., 2008)

A note on the hardness results for the labeled perfect matching problems in bipartite graphs. - Jérôme Monnot (RAIRO Oper. Res., 2008)

A better differential approximation ratio for symmetric TSP. - Bruno Escoffier; Jérôme Monnot (Theor. Comput. Sci., 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)

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. - Dominique de Werra; Marc Demange; Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos (Discret. Appl. Math., 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)

The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. - Martin Milanic; Jérôme Monnot (Electron. Notes Discret. Math., 2009)

Reoptimization of minimum and maximum traveling salesman's tours. - Giorgio Ausiello; Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos (J. Discrete Algorithms, 2009)

Possible Winners when New Candidates Are Added: The Case of Scoring Rules. - Yann Chevaleyre; Jérôme Lang; Nicolas Maudet; Jérôme Monnot (AAAI, 2010)

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)

The Complexity of Bottleneck Labeled Graph Problems. - Refael Hassin; Jérôme Monnot; Danny Segev (Algorithmica, 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)

Approximation of the Clustered Set Covering Problem. - Laurent Alfandari; Jérôme Monnot (Electron. Notes Discret. Math., 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)

Possible winners when new alternatives join: new results coming up! - Lirong Xia; Jérôme Lang; Jérôme Monnot (AAMAS, 2011)

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

Compilation and communication protocols for voting rules with a dynamic set of candidates. - Yann Chevaleyre; Jérôme Lang; Nicolas Maudet; Jérôme Monnot (TARK, 2011)

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

Complexity Results for the Empire Problem in Collection of Stars. - Basile Couëtoux; Jérôme Monnot; Sonia Toubaline (COCOA, 2012)

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

Selective Graph Coloring in Some Special Classes of Graphs. - Marc Demange; Jérôme Monnot; Petrica C. Pop; Bernard Ries (ISCO, 2012)

New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. - Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos; Mingyu Xiao 001 (IPEC, 2012)

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. - Nicolas Boria; Jérôme Monnot; Vangelis Th. Paschos (LATIN, 2012)

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

Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. - Nicolas Boria; Jérôme Monnot; Vangelis Th. Paschos (WALCOM, 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)

New candidates welcome! Possible winners with respect to the addition of new candidates. - Yann Chevaleyre; Jérôme Lang; Nicolas Maudet; Jérôme Monnot; Lirong Xia (Math. Soc. Sci., 2012)

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

Truthful Many-to-Many Assignment with Private Weights. - Bruno Escoffier; Jérôme Monnot; Fanny Pascual; Olivier Spanjaard (CIAC, 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)

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)

Resilience and optimization of identifiable bipartite graphs. - Epameinondas Fritzilas; Martin Milanic; Jérôme Monnot; Yasmín Á. Ríos-Solís (Discret. Appl. Math., 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)

Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph. - Nicolas Boria; Jérôme Monnot; Vangelis Th. Paschos (Discret. Math. Algorithms Appl., 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)

Reoptimization of maximum weight induced hereditary subgraph problems. - Nicolas Boria; Jérôme Monnot; Vangelis Th. Paschos (Theor. Comput. Sci., 2013)

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

A Dichotomy for Upper Domination in Monogenic Classes. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries (COCOA, 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)

A note on the Clustered Set Covering Problem. - Laurent Alfandari; Jérôme Monnot (Discret. Appl. Math., 2014)

On the complexity of the selective graph coloring problem in some special classes of graphs. - Marc Demange; Jérôme Monnot; Petrica C. Pop; Bernard Ries (Theor. Comput. Sci., 2014)

Algorithmic Aspects of Upper Domination. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (CoRR, 2015)

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

A note on the traveling salesman reoptimization problem under vertex insertion. - Jérôme Monnot (Inf. Process. Lett., 2015)

On the maximum independent set problem in subclasses of subcubic graphs. - Vadim V. Lozin; Jérôme Monnot; Bernard Ries (J. Discrete Algorithms, 2015)

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. - Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos; Mingyu Xiao 001 (Theory Comput. Syst., 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)

Algorithmic Aspects of Upper Domination: A Parameterised Perspective. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (AAIM, 2016)

Optimal Reallocation under Additive and Ordinal Preferences. - Haris Aziz 001; Péter Biró 001; Jérôme Lang; Julien Lesca; Jérôme Monnot (AAMAS, 2016)

Computing Pareto Optimal Committees. - Haris Aziz 001; Jérôme Lang; Jérôme Monnot (IJCAI, 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)

A Boundary Property for Upper Domination. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries; Victor Zamaraev (IWOCA, 2016)

Upper Domination: Complexity and Approximation. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (IWOCA, 2016)

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

Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies. - Jérôme Lang; Jérôme Monnot; Arkadii Slinko; William S. Zwicker (AAMAS, 2017)

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

Extended Spanning Star Forest Problems. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Dirk Oliver Theis (COCOA (1), 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)

Weighted upper domination number. - Arman Boyaci; Jérôme Monnot (Electron. Notes Discret. Math., 2017)

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

Upper Domination: Towards a Dichotomy Through Boundary Properties. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries; Viktor Zamaraev (Algorithmica, 2018)

Computing and Testing Pareto Optimal Committees. - Haris Aziz 001; Jérôme Lang; Jérôme Monnot (CoRR, 2018)

Extension of vertex cover and independent set in some classes of graphs and generalizations. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CoRR, 2018)

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

The many facets of upper domination. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (Theor. Comput. Sci., 2018)

Extension of Vertex Cover and Independent Set in Some Classes of Graphs. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2019)

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (FCT, 2019)

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

Correction to: Weighted Upper Edge Cover: Complexity and Approximability. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (WALCOM, 2019)

Efficient reallocation under additive and responsive preferences. - Haris Aziz 001; Péter Biró 001; Jérôme Lang; Julien Lesca; Jérôme Monnot (Theor. Comput. Sci., 2019)

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

Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Dirk Oliver Theis (Theor. Comput. Sci., 2019)

On the Complexity of the Upper r-Tolerant Edge Cover Problem. - Ararat Harutyunyan; Mehdi Khosravian Ghadikolaei; Nikolaos Melissinos; Jérôme Monnot; Aris Pagourtzis (TTCS, 2020)

Computing and testing Pareto optimal committees. - Haris Aziz 001; Jérôme Monnot (Auton. Agents Multi Agent Syst., 2020)

Weighted Upper Edge Cover: Complexity and Approximability. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (J. Graph Algorithms Appl., 2020)

Maximum independent sets in subcubic graphs: New results. - Ararat Harutyunyan; Michael Lampis; Vadim V. Lozin; Jérôme Monnot (Theor. Comput. Sci., 2020)

Abundant Extensions. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 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)

Strong cliques in diamond-free graphs. - Nina Chiarelli; Berenice Martínez-Barona; Martin Milanic; Jérôme Monnot; Peter Mursic (Theor. Comput. Sci., 2021)

Algorithmic aspects of upper edge domination. - Jérôme Monnot; Henning Fernau; David F. Manlove (Theor. Comput. Sci., 2021)

On the complexity of solution extension of optimization problems. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Theor. Comput. Sci., 2022)

Extension and its price for the connected vertex cover problem. - Mehdi Khosravian Ghadikolaei; Nikolaos Melissinos; Jérôme Monnot; Aris Pagourtzis (Theor. Comput. Sci., 2022)

Complexity and algorithms for constant diameter augmentation problems. - Eun Jung Kim 002; Martin Milanic; Jérôme Monnot; Christophe Picouleau (Theor. Comput. Sci., 2022)

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

Extension of some edge graph problems: Standard, parameterized and approximation complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Discret. Appl. Math., 2023)