dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Jérôme Monnot Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicolas Boria, Jérôme Monnot, Vangelis Th. Paschos: Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN 2012: 73-84
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicolas 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
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLirong Xia, Jérôme Lang, Jérôme Monnot: Possible winners when new alternatives join: new results coming up! AAMAS 2011: 829-836
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Laurent Gourvès, Jérôme Monnot: The Price of Optimum in a Matching Game. SAGT 2011: 81-92
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYann 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
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Laurent Gourvès, Jérôme Monnot: Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA 2011: 233-246
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual: Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYann 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
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYann 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
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Laurent Gourvès, Jérôme Monnot: Strategic Coloring of a Graph. CIAC 2010: 155-166
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Laurent Gourvès, Jérôme Monnot: On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHatem Chatti, Laurent Gourvès, Jérôme Monnot: On a Labeled Vehicle Routing Problem. SOFSEM 2010: 271-282
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent 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
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Gourvès, Jérôme Monnot: The Max k-Cut Game and Its Strong Equilibria. TAMC 2010: 234-246
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRefael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58(2): 245-262 (2010)
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Laurent Gourvès, Jérôme Monnot: Minimum regulation of uncoordinated matchings CoRR abs/1012.3889: (2010)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent 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)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBasile 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)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Alfandari, Jérôme Monnot: Approximation of the Clustered Set Covering Problem. Electronic Notes in Discrete Mathematics 36: 479-485 (2010)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno 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)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno 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)
2009
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot: The Minimum Reload s-tPath/Trail/Walk Problems. SOFSEM 2009: 621-632
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Gourvès, Jérôme Monnot, Orestis Telelis: Selfish Scheduling with Setup Times. WINE 2009: 292-303
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Gourvès, Jérôme Monnot: On Strong Equilibria in the Max Cut Game. WINE 2009: 608-615
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDominique 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)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent 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)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiorgio 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)
2008
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBasile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis: On Labeled Traveling Salesman Problems. ISAAC 2008: 776-787
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Jérôme Monnot, Olivier Spanjaard: Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM 2008: 280-291
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Gourvès, Jérôme Monnot, Fanny Pascual: Cooperation in Multiorganization Matching. WAOA 2008: 78-91
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Gourvès, Jérôme Monnot: Three Selfish Spanning Tree Games. WINE 2008: 465-476
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot, Sophie Toulouse: Approximation results for the weighted P4 partition problem. J. Discrete Algorithms 6(2): 299-312 (2008)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Jérôme Monnot, Olivier Spanjaard: Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. 36(4): 424-429 (2008)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJé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)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Jérôme Monnot: A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. 396(1-3): 63-70 (2008)
2007
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot, Sophie Toulouse: The Pk Partition Problem and Related Problems in Bipartite Graphs. SOFSEM (1) 2007: 422-433
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Laurent Gourvès, Jérôme Monnot: Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRefael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAristotelis 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
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRefael Hassin, Jérôme Monnot, Danny Segev: Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14(4): 437-453 (2007)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos: Time slot scheduling of compatible jobs. J. Scheduling 10(2): 111-127 (2007)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot, Sophie Toulouse: The path partition problem and related problems in bipartite graphs. Oper. Res. Lett. 35(5): 677-684 (2007)
2006
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRefael Hassin, Jérôme Monnot, Danny Segev: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT 2006: 196-207
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJé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)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. 97(3): 98-103 (2006)
2005
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot: (Non)-Approximability for the Multi-criteria TSP(1, 2). FCT 2005: 329-340
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot, Sophie Toulouse: Approximation Results for the Weighted P4 Partition Problems. FCT 2005: 388-396
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Weighted Coloring: Further Complexity and Approximability Results. ICTCS 2005: 205-214
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot: On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. ISAAC 2005: 934-943
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière: Greedy Differential Approximations for Min Set Cover. SOFSEM 2005: 62-71
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Refael Hassin, Jérôme Monnot: Approximation algorithms for some vehicle routing problems. Discrete Applied Mathematics 146(1): 27-42 (2005)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDominique 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)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJé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)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot: The labeled perfect matching in bipartite graphs. Inf. Process. Lett. 96(3): 81-88 (2005)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRefael Hassin, Jérôme Monnot: The maximum saving partition problem. Oper. Res. Lett. 33(3): 242-248 (2005)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina 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)
2004
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJé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
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDominique 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
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse: Local approximations for maximum partial subgraph problem. Oper. Res. Lett. 32(3): 217-224 (2004)
2003
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Refael Hassin, Jérôme Monnot: Differential Approximation for Some Routing Problems. CIAC 2003: 277-288
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot, Olivier Spanjaard: Bottleneck shortest paths on a partially ordered scale. 4OR 1(3): 225-241 (2003)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Jérôme Monnot, Vangelis Th. Paschos: Differential approximation results for the Steiner tree problem. Appl. Math. Lett. 16(5): 733-739 (2003)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJé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)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias 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)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJé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)
2002
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos: Weighted Node Coloring: When Stable Sets Are Expensive. WG 2002: 114-125
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot: Differential approximation results for the traveling salesman and related problems. Inf. Process. Lett. 82(5): 229-235 (2002)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot: Differential approximation of NP-hard problems with equal size feasible solutions. RAIRO - Operations Research 36(4): 279-297 (2002)
2001
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJé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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJérôme Monnot: The maximum f-depth spanning tree problem. Inf. Process. Lett. 80(4): 179-187 (2001)

Coauthor Index

1Laurent Alfandari [54]
2Eric Angel [25]
3Giorgio Ausiello [28] [45]
4Evripidis Bampis [25]
5Cristina Bazgan [11] [15] [20] [21] [66] [67]
6Nicolas Boria [71] [72]
7Tobias Brüggemann [7]
8Hatem Chatti [61]
9Yann Chevaleyre [64] [65] [68]
10Basile Couëtoux [44] [55]
11Marc Demange [5] [9] [13] [14] [19] [31] [48]
12Bruno Escoffier [14] [23] [26] [28] [35] [37] [39] [43] [45] [48] [52] [53] [57] [62] [63] [69]
13Aristotelis Giannakos (Telis Giannakos) [33]
14Laurent Gourvès [25] [33] [35] [41] [42] [44] [47] [49] [50] [51] [52] [53] [55] [56] [57] [59] [60] [61] [62] [63] [66] [67] [69]
15Refael Hassin [11] [16] [20] [29] [32] [34] [58]
16Jérôme Lang [64] [65] [68] [70]
17Adria Lyra [47] [51] [56] [60]
18Carlos A. J. Martinhon [47] [51] [56] [60]
19Nicolas Maudet [64] [65] [68]
20Martin Milanic [46]
21Vangelis Th. Paschos [2] [5] [6] [8] [9] [12] [13] [14] [15] [19] [21] [23] [26] [28] [31] [33] [45] [48] [71] [72]
22Fanny Pascual [42] [66]
23Fábio Protti [47]
24Danny Segev [29] [32] [34] [58]
25Fabrice Serrière [15] [21]
26Olivier Spanjaard [10] [39] [43] [53]
27Orestis Telelis [44] [50] [55]
28Sophie Toulouse [2] [6] [8] [12] [24] [30] [36] [40]
29Dominique de Werra [5] [13] [14] [19] [31] [48]
30Gerhard J. Woeginger [7]
31Lirong Xia [65] [70]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page