Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Jerome Monnot

Email : Jerome.Monnot@dauphine.fr

Tel : 01 44 05 41 62
Bureau : P614
Site Personnel: http://www.lamsade.dauphine.fr/~monnot/
Pole : Optimisation combinatoire algorithmique
Status : Directeur de Recherche
Domaines de Recherche : Algorithmic Game Theory; Computational Complexity; Computational Social choice; Approximation


Encadrement de these de doctorat :


  • Mehdi Khosravian : La recherche de solutions max-min pour des problèmes algotithmiques ( Début : 2016-03-01)
voir toutes les theses

Publications Dblp


  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    The Price of Optimum: Complexity and Approximation for a Matching Game.Algorithmica77(3) 2017:836-866

  • Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten
    Bi-objective matchings with the triangle inequality.Theor. Comput. Sci.670 2017:1-10

  • 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:24-32

  • Laurent Gourvès, Jérôme Monnot
    Approximate Maximin Share Allocations in Matroids.CIAC 2017:310-321

  • Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
    Selfish Transportation Games.SOFSEM 2017:176-187

  • 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:113-124

  • Haris Aziz 0001, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot
    Optimal Reallocation under Additive and Ordinal Preferences.AAMAS 2016:402-410

  • Haris Aziz 0001, Jérôme Lang, Jérôme Monnot
    Computing Pareto Optimal Committees.IJCAI 2016:60-66

  • Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot
    Achieving Proportional Representation in Conference Programs.IJCAI 2016:144-150

  • 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:257-263

  • Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
    A Boundary Property for Upper Domination.IWOCA 2016:229-240

  • 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:241-252

  • Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
    Conference Program Design with Single-Peaked and Single-Crossing Preferences.WINE 2016:221-235

  • Haris Aziz 0001, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot
    Optimal Reallocation under Additive and Ordinal Preferences.CoRRabs/1604.01091 2016:

  • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
    Subset Sum Problems With Digraph Constraints.CoRRabs/1609.01078 2016:

  • Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
    Upper Domination: towards a dichotomy through boundary properties.CoRRabs/1609.01510 2016:

  • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
    Approximate tradeoffs on weighted labeled matroids.Discrete Applied Mathematics184 2015:154-166

  • Jérôme Monnot
    A note on the traveling salesman reoptimization problem under vertex insertion.Inf. Process. Lett.115(3) 2015:435-438

  • Vadim V. Lozin, Jérôme Monnot, Bernard Ries
    On the maximum independent set problem in subclasses of subcubic graphs.J. Discrete Algorithms31 2015:104-112

  • 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:330-346

  • Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Nguyen Kim Thang
    Congestion Games with Capacitated Resources.Theory Comput. Syst.57(3) 2015:598-616

  • 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:121-140

  • 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:89-102

  • 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.CoRRabs/1506.07260 2015:

  • Laurent Alfandari, Jérôme Monnot
    A note on the Clustered Set Covering Problem.Discrete Applied Mathematics164 2014:13-19

  • 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:89-102

  • Diodato Ferraioli, Laurent Gourvès, Jérôme Monnot
    On regular and approximately fair allocations of indivisible goods.AAMAS 2014:997-1004

  • Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries
    A Dichotomy for Upper Domination in Monogenic Classes.COCOA 2014:258-267

  • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
    Near Fairness in Matroids.ECAI 2014:393-398

  • Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
    The Lazy Matroid Problem.IFIP TCS 2014:66-77

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    Fair solutions for some multiagent optimization problems.Autonomous Agents and Multi-Agent Systems26(2) 2013:184-201

  • Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmin A. Rios-Solis
    Resilience and optimization of identifiable bipartite graphs.Discrete Applied Mathematics161(4-5) 2013:593-603

  • Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
    Complexity of trails, paths and circuits in arc-colored digraphs.Discrete Applied Mathematics161(6) 2013:819-828

  • Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization under Vertex Insertion: Max P-Free Subgraph and Max Planar Subgraph.Discrete Math., Alg. and Appl.5(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 Algorithms22 2013:19-29

  • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
    Single approximation for the biobjective Max TSP.Theor. Comput. Sci.478 2013:41-50

  • Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization of maximum weight induced hereditary subgraph problems.Theor. Comput. Sci.514 2013:61-74

  • Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries
    Possible Winners in Approval Voting.ADT 2013:57-70

  • Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard
    Truthful Many-to-Many Assignment with Private Weights.CIAC 2013:209-220

  • Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
    The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.FCT 2013:171-182

  • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
    A Matroid Approach to the Worst Case Allocation of Indivisible Goods.IJCAI 2013:136-142

  • Vadim V. Lozin, Jérôme Monnot, Bernard Ries
    On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs.IWOCA 2013:314-326

  • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
    A Protocol for Cutting Matroids Like Cakes.WINE 2013:216-229

  • Laurent Gourvès, Jérôme Monnot, Fanny Pascual
    Cooperation in multiorganization matching.Algorithmic Operations Research7(2) 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.Discrete Mathematics & Theoretical Computer Science14(2) 2012:57-74

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    Strategic Coloring of a Graph.Internet Mathematics8(4) 2012:424-455

  • 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.Mathematical Social Sciences64(1) 2012:74-88

  • Basile Couëtoux, Jérôme Monnot, Sonia Toubaline
    Complexity Results for the Empire Problem in Collection of Stars.COCOA 2012:73-82

  • Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
    Approximate Tradeoffs on Matroids.ECAI 2012:360-365

  • Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
    Selective Graph Coloring in Some Special Classes of Graphs.ISCO 2012:320-331

  • 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:25-36

  • Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems.LATIN 2012:73-84

  • Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Nguyen Kim Thang
    Congestion Games with Capacitated Resources.SAGT 2012:204-215

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti
    Cost allocation protocols for network formation on connection situations.VALUETOOLS 2012:228-234

  • Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion.WALCOM 2012:76-87

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

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    The Price of Optimum in a Matching Game.SAGT 2011:81-92

  • 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:153-160

  • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
    Single Approximation for Biobjective Max TSP.WAOA 2011:49-62

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

  • 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 CandidatesCoRRabs/1111.3690 2011:

  • Refael Hassin, Jérôme Monnot, Danny Segev
    The Complexity of Bottleneck Labeled Graph Problems.Algorithmica58(2) 2010:245-262

  • Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
    The minimum reload s-t path, trail and walk problems.Discrete Applied Mathematics158(13) 2010:1404-1417

  • Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
    Labeled Traveling Salesman Problems: Complexity and approximation.Discrete Optimization7(1-2) 2010:74-85

  • Laurent Alfandari, Jérôme Monnot
    Approximation of the Clustered Set Covering Problem.Electronic Notes in Discrete Mathematics36 2010:479-485

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard
    Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.European Journal of Operational Research205(1) 2010:19-30

  • 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 Algorithms8(1) 2010:36-49

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

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    Strategic Coloring of a Graph.CIAC 2010:155-166

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    On the Impact of Local Taxes in a Set Cover Game.SIROCCO 2010:2-13

  • Hatem Chatti, Laurent Gourvès, Jérôme Monnot
    On a Labeled Vehicle Routing Problem.SOFSEM 2010:271-282

  • 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:222-233

  • Laurent Gourvès, Jérôme Monnot
    The Max -Cut Game and Its Strong Equilibria.TAMC 2010:234-246

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    Minimum regulation of uncoordinated matchingsCoRRabs/1012.3889 2010:

  • Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.Discrete Applied Mathematics157(4) 2009:819-832

  • 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.Electronic Notes in Discrete Mathematics35 2009:221-226

  • Martin Milanic, Jérôme Monnot
    The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes.Electronic Notes in Discrete Mathematics35 2009:317-322

  • Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization of minimum and maximum traveling salesman's tours.J. Discrete Algorithms7(4) 2009:453-463

  • Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
    The Minimum Reload s-tPath/Trail/Walk Problems.SOFSEM 2009:621-632

  • Laurent Gourvès, Jérôme Monnot, Orestis Telelis
    Selfish Scheduling with Setup Times.WINE 2009:292-303

  • Laurent Gourvès, Jérôme Monnot
    On Strong Equilibria in the Max Cut Game.WINE 2009:608-615

  • Jérôme Monnot, Sophie Toulouse
    Approximation results for the weighted P partition problem.J. Discrete Algorithms6(2) 2008:299-312

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

  • Jérôme Monnot
    A note on the hardness results for the labeled perfect matching problems in bipartite graphs.RAIRO - Operations Research42(3) 2008:315-324

  • Bruno Escoffier, Jérôme Monnot
    A better differential approximation ratio for symmetric TSP.Theor. Comput. Sci.396(1-3) 2008:63-70

  • Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
    On Labeled Traveling Salesman Problems.ISAAC 2008:776-787

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

  • Laurent Gourvès, Jérôme Monnot, Fanny Pascual
    Cooperation in Multiorganization Matching.WAOA 2008:78-91

  • Laurent Gourvès, Jérôme Monnot
    Three Selfish Spanning Tree Games.WINE 2008:465-476

  • Refael Hassin, Jérôme Monnot, Danny Segev
    Approximation algorithms and hardness results for labeled connectivity problems.J. Comb. Optim.14(4) 2007:437-453

  • Jérôme Monnot, Sophie Toulouse
    The path partition problem and related problems in bipartite graphs.Oper. Res. Lett.35(5) 2007:677-684

  • Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
    Time slot scheduling of compatible jobs.J. Scheduling10(2) 2007:111-127

  • Jérôme Monnot, Sophie Toulouse
    The P Partition Problem and Related Problems in Bipartite Graphs.SOFSEM (1) 2007:422-433

  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    Complexity and Approximation Results for the Connected Vertex Cover Problem.WG 2007:202-213

  • Refael Hassin, Jérôme Monnot, Danny Segev
    The Complexity of Bottleneck Labeled Graph Problems.WG 2007:328-340

  • Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos
    On the Performance of Congestion Games for Optimum Satisfiability Problems.WINE 2007:220-231

  • Jérôme Monnot
    A simple approximation algorithm for WIS based on the approximability in k.European Journal of Operational Research171(1) 2006:346-348

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

  • Refael Hassin, Jérôme Monnot, Danny Segev
    Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.MFCS 2006:480-491

  • Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization of Minimum and Maximum Traveling Salesman's Tours.SWAT 2006:196-207

  • Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    A hypocoloring model for batch scheduling.Discrete Applied Mathematics146(1) 2005:3-26

  • Cristina Bazgan, Refael Hassin, Jérôme Monnot
    Approximation algorithms for some vehicle routing problems.Discrete Applied Mathematics146(1) 2005:27-42

  • Jérôme Monnot
    Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s).European Journal of Operational Research161(3) 2005:721-735

  • Jérôme Monnot
    The labeled perfect matching in bipartite graphs.Inf. Process. Lett.96(3) 2005:81-88

  • Refael Hassin, Jérôme Monnot
    The maximum saving partition problem.Oper. Res. Lett.33(3) 2005:242-248

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

  • Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot
    (Non)-Approximability for the Multi-criteria (1, 2).FCT 2005:329-340

  • Jérôme Monnot, Sophie Toulouse
    Approximation Results for the Weighted P Partition Problems.FCT 2005:388-396

  • Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Weighted Coloring: Further Complexity and Approximability Results.ICTCS 2005:205-214

  • Jérôme Monnot
    On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems.ISAAC 2005:934-943

  • Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
    Greedy Differential Approximations for Min Set Cover.SOFSEM 2005:62-71

  • Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Local approximations for maximum partial subgraph problem.Oper. Res. Lett.32(3) 2004:217-224

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

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

  • Jérôme Monnot, Olivier Spanjaard
    Bottleneck shortest paths on a partially ordered scale.4OR1(3) 2003:225-241

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

  • Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Differential approximation results for the traveling salesman problem with distances 1 and 2.European Journal of Operational Research145(3) 2003:557-568

  • Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Approximation algorithms for the traveling salesman problem.Math. Meth. of OR56(3) 2003:387-405

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

  • Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Optima locaux garantis pour l'approximation différentielle.Technique et Science Informatiques22(3) 2003:257-288

  • Cristina Bazgan, Refael Hassin, Jérôme Monnot
    Differential Approximation for Some Routing Problems.CIAC 2003:277-288

  • Jérôme Monnot
    Differential approximation results for the traveling salesman and related problems.Inf. Process. Lett.82(5) 2002:229-235

  • Jérôme Monnot
    Differential approximation of NP-hard problems with equal size feasible solutions.RAIRO - Operations Research36(4) 2002:279-297

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

  • Jérôme Monnot
    The maximum f-depth spanning tree problem.Inf. Process. Lett.80(4) 2001:179-187

  • Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.FCT 2001:275-286



Publications DFIS


Publications HAL