- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j42 |      | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Fair solutions for some multiagent optimization problems. Autonomous Agents and Multi-Agent Systems 26(2): 184-201 (2013) |
| j41 | | Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmin A. Rios-Solis: Resilience and optimization of identifiable bipartite graphs. Discrete Applied Mathematics 161(4-5): 593-603 (2013) |
| j40 | | 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 Mathematics 161(6): 819-828 (2013) |
| j39 | | Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Single approximation for the biobjective Max TSP. Theor. Comput. Sci. 478: 41-50 (2013) |
| c43 | | Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard: Truthful Many-to-Many Assignment with Private Weights. CIAC 2013: 209-220 |
| 2012 | ||
| j38 | | 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 Science 14(2): 57-74 (2012) |
| j37 | | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Strategic Coloring of a Graph. Internet Mathematics 8(4): 424-455 (2012) |
| j36 | | 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 Sciences 64(1): 74-88 (2012) |
| c42 | | Basile Couëtoux, Jérôme Monnot, Sonia Toubaline: Complexity Results for the Empire Problem in Collection of Stars. COCOA 2012: 73-82 |
| c41 | | Laurent Gourvès, Jérôme Monnot, Lydia Tlilane: Approximate Tradeoffs on Matroids. ECAI 2012: 360-365 |
| c40 | | Marc Demange, Jérôme Monnot, Petrica Pop, Bernard Ries: Selective Graph Coloring in Some Special Classes of Graphs. ISCO 2012: 320-331 |
| c39 | | 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 |
| c38 | | Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos: Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN 2012: 73-84 |
| c37 | | Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Nguyen Kim Thang: Congestion Games with Capacitated Resources. SAGT 2012: 204-215 |
| c36 | | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti: Cost allocation protocols for network formation on connection situations. VALUETOOLS 2012: 228-234 |
| c35 | | 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 |
| 2011 | ||
| c34 | | Lirong Xia, Jérôme Lang, Jérôme Monnot: Possible winners when new alternatives join: new results coming up! AAMAS 2011: 829-836 |
| c33 | | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: The Price of Optimum in a Matching Game. SAGT 2011: 81-92 |
| c32 | | 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 |
| c31 | | Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62 |
| c30 | | 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 |
| i2 | | 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 abs/1111.3690 (2011) |
| 2010 | ||
| j35 | | Refael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58(2): 245-262 (2010) |
| j34 | | 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 Mathematics 158(13): 1404-1417 (2010) |
| j33 | | Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis: Labeled Traveling Salesman Problems: Complexity and approximation. Discrete Optimization 7(1-2): 74-85 (2010) |
| j32 | | Laurent Alfandari, Jérôme Monnot: Approximation of the Clustered Set Covering Problem. Electronic Notes in Discrete Mathematics 36: 479-485 (2010) |
| j31 | | 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 Research 205(1): 19-30 (2010) |
| j30 | | 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): 36-49 (2010) |
| c29 | | 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 |
| c28 | | |
| c27 | | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13 |
| c26 | | Hatem Chatti, Laurent Gourvès, Jérôme Monnot: On a Labeled Vehicle Routing Problem. SOFSEM 2010: 271-282 |
| c25 | | 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 |
| c24 | | |
| i1 | | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Minimum regulation of uncoordinated matchings. CoRR abs/1012.3889 (2010) |
| 2009 | ||
| j29 | | 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 Mathematics 157(4): 819-832 (2009) |
| j28 | | 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 Mathematics 35: 221-226 (2009) |
| j27 | | Martin Milanic, Jérôme Monnot: The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. Electronic Notes in Discrete Mathematics 35: 317-322 (2009) |
| j26 | | Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7(4): 453-463 (2009) |
| c23 | | 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 |
| c22 | | Laurent Gourvès, Jérôme Monnot, Orestis Telelis: Selfish Scheduling with Setup Times. WINE 2009: 292-303 |
| c21 | | |
| 2008 | ||
| j25 | | Jérôme Monnot, Sophie Toulouse: Approximation results for the weighted P4 partition problem. J. Discrete Algorithms 6(2): 299-312 (2008) |
| j24 | | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard: Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. 36(4): 424-429 (2008) |
| j23 | | Jérôme Monnot: A note on the hardness results for the labeled perfect matching problems in bipartite graphs. RAIRO - Operations Research 42(3): 315-324 (2008) |
| j22 | | Bruno Escoffier, Jérôme Monnot: A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. 396(1-3): 63-70 (2008) |
| c20 | | Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis: On Labeled Traveling Salesman Problems. ISAAC 2008: 776-787 |
| c19 | | 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 |
| c18 | | Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Cooperation in Multiorganization Matching. WAOA 2008: 78-91 |
| c17 | | |
| 2007 | ||
| j21 | | Refael Hassin, Jérôme Monnot, Danny Segev: Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14(4): 437-453 (2007) |
| j20 | | Jérôme Monnot, Sophie Toulouse: The path partition problem and related problems in bipartite graphs. Oper. Res. Lett. 35(5): 677-684 (2007) |
| j19 | | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos: Time slot scheduling of compatible jobs. J. Scheduling 10(2): 111-127 (2007) |
| c16 | | Jérôme Monnot, Sophie Toulouse: The Pk Partition Problem and Related Problems in Bipartite Graphs. SOFSEM (1) 2007: 422-433 |
| c15 | | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213 |
| c14 | | Refael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340 |
| c13 | | 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 |
| 2006 | ||
| j18 | | Jérôme Monnot: A simple approximation algorithm for WIS based on the approximability in k. European Journal of Operational Research 171(1): 346-348 (2006) |
| j17 | | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. 97(3): 98-103 (2006) |
| c12 | | Refael Hassin, Jérôme Monnot, Danny Segev: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491 |
| c11 | | Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT 2006: 196-207 |
| 2005 | ||
| j16 | | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos: A hypocoloring model for batch scheduling. Discrete Applied Mathematics 146(1): 3-26 (2005) |
| j15 | | Cristina Bazgan, Refael Hassin, Jérôme Monnot: Approximation algorithms for some vehicle routing problems. Discrete Applied Mathematics 146(1): 27-42 (2005) |
| j14 | | Jérôme Monnot: Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s). European Journal of Operational Research 161(3): 721-735 (2005) |
| j13 | | Jérôme Monnot: The labeled perfect matching in bipartite graphs. Inf. Process. Lett. 96(3): 81-88 (2005) |
| j12 | | Refael Hassin, Jérôme Monnot: The maximum saving partition problem. Oper. Res. Lett. 33(3): 242-248 (2005) |
| j11 | | 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): 497-513 (2005) |
| c10 | | Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot: (Non)-Approximability for the Multi-criteria TSP(1, 2). FCT 2005: 329-340 |
| c9 | | Jérôme Monnot, Sophie Toulouse: Approximation Results for the Weighted P4 Partition Problems. FCT 2005: 388-396 |
| c8 | | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Weighted Coloring: Further Complexity and Approximability Results. ICTCS 2005: 205-214 |
| c7 | | Jérôme Monnot: On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. ISAAC 2005: 934-943 |
| c6 | | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière: Greedy Differential Approximations for Min Set Cover. SOFSEM 2005: 62-71 |
| 2004 | ||
| j10 | | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse: Local approximations for maximum partial subgraph problem. Oper. Res. Lett. 32(3): 217-224 (2004) |
| c5 | | 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 |
| c4 | | 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 |
| 2003 | ||
| j9 | | Jérôme Monnot, Olivier Spanjaard: Bottleneck shortest paths on a partially ordered scale. 4OR 1(3): 225-241 (2003) |
| j8 | | Marc Demange, Jérôme Monnot, Vangelis Th. Paschos: Differential approximation results for the Steiner tree problem. Appl. Math. Lett. 16(5): 733-739 (2003) |
| j7 | | 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 Research 145(3): 557-568 (2003) |
| j6 | | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse: Approximation algorithms for the traveling salesman problem. Math. Meth. of OR 56(3): 387-405 (2003) |
| j5 | | 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): 195-201 (2003) |
| j4 | | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse: Optima locaux garantis pour l'approximation différentielle. Technique et Science Informatiques 22(3): 257-288 (2003) |
| c3 | | Cristina Bazgan, Refael Hassin, Jérôme Monnot: Differential Approximation for Some Routing Problems. CIAC 2003: 277-288 |
| 2002 | ||
| j3 | | Jérôme Monnot: Differential approximation results for the traveling salesman and related problems. Inf. Process. Lett. 82(5): 229-235 (2002) |
| j2 | | Jérôme Monnot: Differential approximation of NP-hard problems with equal size feasible solutions. RAIRO - Operations Research 36(4): 279-297 (2002) |
| c2 | | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos: Weighted Node Coloring: When Stable Sets Are Expensive. WG 2002: 114-125 |
| 2001 | ||
| j1 | | |
| c1 | | 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page