Search the dblp DataBase
Jérôme Monnot :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Cristina Bazgan , Refael Hassin , Jérôme Monnot Differential Approximation for Some Routing Problems. [Citation Graph (0, 0)][DBLP ] CIAC, 2003, pp:277-288 [Conf ] Eric Angel , Evripidis Bampis , Laurent Gourvès , Jérôme Monnot (Non)-Approximability for the Multi-criteria TSP (1, 2). [Citation Graph (0, 0)][DBLP ] FCT, 2005, pp:329-340 [Conf ] Jérôme Monnot , Vangelis Th. Paschos , Sophie Toulouse Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. [Citation Graph (0, 0)][DBLP ] FCT, 2001, pp:275-286 [Conf ] Jérôme Monnot , Sophie Toulouse Approximation Results for the Weighted P4 Partition Problems. [Citation Graph (0, 0)][DBLP ] FCT, 2005, pp:388-396 [Conf ] Bruno Escoffier , Jérôme Monnot , Vangelis Th. Paschos Weighted Coloring: Further Complexity and Approximability Results. [Citation Graph (0, 0)][DBLP ] ICTCS, 2005, pp:205-214 [Conf ] Jérôme Monnot On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2005, pp:934-943 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:896-907 [Conf ] Refael Hassin , Jérôme Monnot , Danny Segev Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 2006, pp:480-491 [Conf ] Cristina Bazgan , Jérôme Monnot , Vangelis Th. Paschos , Fabrice Serrière Greedy Differential Approximations for Min Set Cover. [Citation Graph (0, 0)][DBLP ] SOFSEM, 2005, pp:62-71 [Conf ] Giorgio Ausiello , Bruno Escoffier , Jérôme Monnot , Vangelis Th. Paschos Reoptimization of Minimum and Maximum Traveling Salesman's Tours. [Citation Graph (0, 0)][DBLP ] SWAT, 2006, pp:196-207 [Conf ] Marc Demange , Dominique de Werra , Jérôme Monnot , Vangelis Th. Paschos Weighted Node Coloring: When Stable Sets Are Expensive. [Citation Graph (0, 0)][DBLP ] WG, 2002, pp:114-125 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:377-388 [Conf ] Jérôme Monnot , Olivier Spanjaard Bottleneck shortest paths on a partially ordered scale. [Citation Graph (0, 0)][DBLP ] 4OR, 2003, v:1, n:3, pp:225-241 [Journal ] Marc Demange , Jérôme Monnot , Vangelis Th. Paschos Differential approximation results for the Steiner tree problem. [Citation Graph (0, 0)][DBLP ] Appl. Math. Lett., 2003, v:16, n:5, pp:733-739 [Journal ] Cristina Bazgan , Refael Hassin , Jérôme Monnot Approximation algorithms for some vehicle routing problems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:146, n:1, pp:27-42 [Journal ] Dominique de Werra , Marc Demange , Jérôme Monnot , Vangelis Th. Paschos A hypocoloring model for batch scheduling. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:146, n:1, pp:3-26 [Journal ] Bruno Escoffier , Jérôme Monnot , Vangelis Th. Paschos Weighted Coloring: further complexity and approximability results. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:3, pp:98-103 [Journal ] Jérôme Monnot The maximum f-depth spanning tree problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:80, n:4, pp:179-187 [Journal ] Jérôme Monnot Differential approximation results for the traveling salesman and related problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:82, n:5, pp:229-235 [Journal ] Jérôme Monnot The labeled perfect matching in bipartite graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2005, v:96, n:3, pp:81-88 [Journal ] Tobias Brüggemann , Jérôme Monnot , Gerhard J. Woeginger Local search for the minimum label spanning tree problem with bounded color classes. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2003, v:31, n:3, pp:195-201 [Journal ] Refael Hassin , Jérôme Monnot The maximum saving partition problem. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2005, v:33, n:3, pp:242-248 [Journal ] Jérôme Monnot , Vangelis Th. Paschos , Sophie Toulouse Local approximations for maximum partial subgraph problem. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:3, pp:217-224 [Journal ] Marc Demange , Dominique de Werra , Jérôme Monnot , Vangelis Th. Paschos Time slot scheduling of compatible jobs. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2007, v:10, n:2, pp:111-127 [Journal ] Cristina Bazgan , Jérôme Monnot , Vangelis Th. Paschos , Fabrice Serrière On the differential approximation of MIN SET COVER. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:332, n:1-3, pp:497-513 [Journal ] Jérôme Monnot , Vangelis Th. Paschos , Sophie Toulouse Optima locaux garantis pour l'approximation différentielle. [Citation Graph (0, 0)][DBLP ] Technique et Science Informatiques, 2003, v:22, n:3, pp:257-288 [Journal ] Jérôme Monnot A simple approximation algorithm for WIS based on the approximability in k. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2006, v:171, n:1, pp:346-348 [Journal ] Jérôme Monnot Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s). [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:161, n:3, pp:721-735 [Journal ] Jérôme Monnot , Vangelis Th. Paschos , Sophie Toulouse Differential approximation results for the traveling salesman problem with distances 1 and 2. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2003, v:145, n:3, pp:557-568 [Journal ] Jérôme Monnot , Sophie Toulouse The Pk Partition Problem and Related Problems in Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] SOFSEM (1), 2007, pp:422-433 [Conf ] Possible Winners when New Candidates Are Added: The Case of Scoring Rules. [Citation Graph (, )][DBLP ] Strategic Coloring of a Graph. [Citation Graph (, )][DBLP ] On Labeled Traveling Salesman Problems. [Citation Graph (, )][DBLP ] On the Impact of Local Taxes in a Set Cover Game. [Citation Graph (, )][DBLP ] Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. [Citation Graph (, )][DBLP ] The Minimum Reload s-tPath/Trail/Walk Problems. [Citation Graph (, )][DBLP ] On a Labeled Vehicle Routing Problem. [Citation Graph (, )][DBLP ] Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. [Citation Graph (, )][DBLP ] The Max k -Cut Game and Its Strong Equilibria. [Citation Graph (, )][DBLP ] Cooperation in Multiorganization Matching. [Citation Graph (, )][DBLP ] The Complexity of Bottleneck Labeled Graph Problems. [Citation Graph (, )][DBLP ] Complexity and Approximation Results for the Connected Vertex Cover Problem. [Citation Graph (, )][DBLP ] Selfish Scheduling with Setup Times. [Citation Graph (, )][DBLP ] Three Selfish Spanning Tree Games. [Citation Graph (, )][DBLP ] On Strong Equilibria in the Max Cut Game. [Citation Graph (, )][DBLP ] On the Performance of Congestion Games for Optimum Satisfiability Problems. [Citation Graph (, )][DBLP ] Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. [Citation Graph (, )][DBLP ] The minimum reload s-t path, trail and walk problems. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.304secs