Jérôme Monnot

ORCID

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 51

Top Venues

Publications

Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
Project games. Theor. Comput. Sci. 940 (Part) (2023)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. 340 (2023)
Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau
Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. 904 (2022)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
On the complexity of solution extension of optimization problems. Theor. Comput. Sci. 904 (2022)
Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
Extension and its price for the connected vertex cover problem. Theor. Comput. Sci. 904 (2022)
Jérôme Monnot, Henning Fernau, David F. Manlove
Algorithmic aspects of upper edge domination. Theor. Comput. Sci. 877 (2021)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Abundant Extensions. CIAC (2021)
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
Strong cliques in diamond-free graphs. Theor. Comput. Sci. 858 (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)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. 846 (2020)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Weighted Upper Edge Cover: Complexity and Approximability. J. Graph Algorithms Appl. 24 (2) (2020)
Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS (2020)
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
Strong Cliques in Diamond-Free Graphs. WG (2020)
Haris Aziz, Jérôme Monnot
Computing and testing Pareto optimal committees. Auton. Agents Multi Agent Syst. 34 (1) (2020)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Correction to: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM (2019)
Laurent Gourvès, Jérôme Monnot
On maximin share allocations in matroids. Theor. Comput. Sci. 754 (2019)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum Independent Sets in Subcubic Graphs: New Results. WG (2019)
Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
Extension and Its Price for the Connected Vertex Cover Problem. IWOCA (2019)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Weighted Upper Edge Cover: Complexity and Approximability. WALCOM (2019)
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
Project Games. CIAC (2019)
Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot
Efficient reallocation under additive and responsive preferences. Theor. Comput. Sci. 790 (2019)
Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
On a Simple Hedonic Game with Graph-Restricted Communication. SAGT (2019)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT (2019)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of Vertex Cover and Independent Set in Some Classes of Graphs. CIAC (2019)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. Theor. Comput. Sci. 775 (2019)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
Subset sum problems with digraph constraints. J. Comb. Optim. 36 (3) (2018)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80 (10) (2018)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Weighted Upper Edge Cover: Complexity and Approximability. CoRR (2018)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
On the Complexity of Solution Extension of Optimization Problems. CoRR (2018)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum Independent Sets in Subcubic Graphs: New Results. CoRR (2018)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
The many facets of upper domination. Theor. Comput. Sci. 717 (2018)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of vertex cover and independent set in some classes of graphs and generalizations. CoRR (2018)
Haris Aziz, Jérôme Lang, Jérôme Monnot
Computing and Testing Pareto Optimal Committees. CoRR (2018)
Jérôme Lang, Jérôme Monnot, Arkadii Slinko, William S. Zwicker
Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies. AAMAS (2017)
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)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis
Extended Spanning Star Forest Problems. COCOA (1) (2017)
Arman Boyaci, Jérôme Monnot
Weighted upper domination number. Electron. Notes Discret. Math. 62 (2017)
Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
Selfish Transportation Games. SOFSEM (2017)
Haris Aziz, Jérôme Lang, Jérôme Monnot
Computing Pareto Optimal Committees. IJCAI (2016)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
Upper Domination: towards a dichotomy through boundary properties. CoRR (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Upper Domination: Complexity and Approximation. IWOCA (2016)
Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot
Achieving Proportional Representation in Conference Programs. IJCAI (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM (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)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
A Boundary Property for Upper Domination. IWOCA (2016)
Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
Conference Program Design with Single-Peaked and Single-Crossing Preferences. WINE (2016)
Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot
Optimal Reallocation under Additive and Ordinal Preferences. CoRR (2016)
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
Subset Sum Problems With Digraph Constraints. CoRR (2016)
Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot
Optimal Reallocation under Additive and Ordinal Preferences. AAMAS (2016)
Vadim V. Lozin, Jérôme Monnot, Bernard Ries
On the maximum independent set problem in subclasses of subcubic graphs. J. Discrete Algorithms 31 (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)
Jérôme Monnot
A note on the traveling salesman reoptimization problem under vertex insertion. Inf. Process. Lett. 115 (3) (2015)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Algorithmic Aspects of Upper Domination. CoRR (2015)
Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. 56 (2) (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 Alfandari, Jérôme Monnot
A note on the Clustered Set Covering Problem. Discret. Appl. Math. 164 (2014)
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)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries
A Dichotomy for Upper Domination in Monogenic Classes. COCOA (2014)
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. 540 (2014)
Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard
Truthful Many-to-Many Assignment with Private Weights. CIAC (2013)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of maximum weight induced hereditary subgraph problems. Theor. Comput. Sci. 514 (2013)
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)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
-Free Subgraph and Max Planar Subgraph. Discret. Math. Algorithms Appl. 5 (2) (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)
Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmín Á. Ríos-Solís
Resilience and optimization of identifiable bipartite graphs. Discret. Appl. Math. 161 (4-5) (2013)
Vadim V. Lozin, Jérôme Monnot, Bernard Ries
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. IWOCA (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)
Basile Couëtoux, Jérôme Monnot, Sonia Toubaline
Complexity Results for the Empire Problem in Collection of Stars. COCOA (2012)
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
Selective Graph Coloring in Some Special Classes of Graphs. ISCO (2012)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM (2012)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN (2012)
Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot, Lirong Xia
New candidates welcome! Possible winners with respect to the addition of new candidates. Math. Soc. Sci. 64 (1) (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)
Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC (2012)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA (2011)
Lirong Xia, Jérôme Lang, Jérôme Monnot
Possible winners when new alternatives join: new results coming up! AAMAS (2011)
Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot, Lirong Xia
New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates CoRR (2011)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
The Price of Optimum in a Matching Game. SAGT (2011)
Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot
Compilation and communication protocols for voting rules with a dynamic set of candidates. TARK (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)

Jérôme Monnot.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jérôme Monnot