| 2009 |
|---|
| 43 | EE | 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 |
| 2008 |
|---|
| 42 | EE | Basile Couëtoux,
Laurent Gourvès,
Jérôme Monnot,
Orestis Telelis:
On Labeled Traveling Salesman Problems.
ISAAC 2008: 776-787 |
| 41 | EE | 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 |
| 40 | EE | Laurent Gourvès,
Jérôme Monnot,
Fanny Pascual:
Cooperation in Multiorganization Matching.
WAOA 2008: 78-91 |
| 39 | EE | Laurent Gourvès,
Jérôme Monnot:
Three Selfish Spanning Tree Games.
WINE 2008: 465-476 |
| 38 | EE | Jérôme Monnot,
Sophie Toulouse:
Approximation results for the weighted P4 partition problem.
J. Discrete Algorithms 6(2): 299-312 (2008) |
| 37 | EE | 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) |
| 36 | EE | Bruno Escoffier,
Jérôme Monnot:
A better differential approximation ratio for symmetric TSP.
Theor. Comput. Sci. 396(1-3): 63-70 (2008) |
| 2007 |
|---|
| 35 | EE | Jérôme Monnot,
Sophie Toulouse:
The Pk Partition Problem and Related Problems in Bipartite Graphs.
SOFSEM (1) 2007: 422-433 |
| 34 | EE | Bruno Escoffier,
Laurent Gourvès,
Jérôme Monnot:
Complexity and Approximation Results for the Connected Vertex Cover Problem.
WG 2007: 202-213 |
| 33 | EE | Refael Hassin,
Jérôme Monnot,
Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems.
WG 2007: 328-340 |
| 32 | EE | 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 |
| 31 | EE | 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) |
| 30 | EE | 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) |
| 29 | EE | Jérôme Monnot,
Sophie Toulouse:
The path partition problem and related problems in bipartite graphs.
Oper. Res. Lett. 35(5): 677-684 (2007) |
| 2006 |
|---|
| 28 | EE | Refael Hassin,
Jérôme Monnot,
Danny Segev:
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.
MFCS 2006: 480-491 |
| 27 | EE | Giorgio Ausiello,
Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours.
SWAT 2006: 196-207 |
| 26 | EE | 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) |
| 25 | EE | Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results.
Inf. Process. Lett. 97(3): 98-103 (2006) |
| 2005 |
|---|
| 24 | EE | Eric Angel,
Evripidis Bampis,
Laurent Gourvès,
Jérôme Monnot:
(Non)-Approximability for the Multi-criteria TSP(1, 2).
FCT 2005: 329-340 |
| 23 | EE | Jérôme Monnot,
Sophie Toulouse:
Approximation Results for the Weighted P4 Partition Problems.
FCT 2005: 388-396 |
| 22 | EE | Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Weighted Coloring: Further Complexity and Approximability Results.
ICTCS 2005: 205-214 |
| 21 | EE | Jérôme Monnot:
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems.
ISAAC 2005: 934-943 |
| 20 | EE | Cristina Bazgan,
Jérôme Monnot,
Vangelis Th. Paschos,
Fabrice Serrière:
Greedy Differential Approximations for Min Set Cover.
SOFSEM 2005: 62-71 |
| 19 | EE | Cristina Bazgan,
Refael Hassin,
Jérôme Monnot:
Approximation algorithms for some vehicle routing problems.
Discrete Applied Mathematics 146(1): 27-42 (2005) |
| 18 | EE | 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) |
| 17 | EE | 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) |
| 16 | EE | Jérôme Monnot:
The labeled perfect matching in bipartite graphs.
Inf. Process. Lett. 96(3): 81-88 (2005) |
| 15 | EE | Refael Hassin,
Jérôme Monnot:
The maximum saving partition problem.
Oper. Res. Lett. 33(3): 242-248 (2005) |
| 14 | EE | 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) |
| 2004 |
|---|
| 13 | EE | 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 |
| 12 | EE | 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 |
| 11 | EE | Jérôme Monnot,
Vangelis Th. Paschos,
Sophie Toulouse:
Local approximations for maximum partial subgraph problem.
Oper. Res. Lett. 32(3): 217-224 (2004) |
| 2003 |
|---|
| 10 | EE | Cristina Bazgan,
Refael Hassin,
Jérôme Monnot:
Differential Approximation for Some Routing Problems.
CIAC 2003: 277-288 |
| 9 | EE | Jérôme Monnot,
Olivier Spanjaard:
Bottleneck shortest paths on a partially ordered scale.
4OR 1(3): 225-241 (2003) |
| 8 | EE | 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) |
| 7 | EE | 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) |
| 6 | EE | 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) |
| 5 | EE | 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) |
| 2002 |
|---|
| 4 | EE | Marc Demange,
Dominique de Werra,
Jérôme Monnot,
Vangelis Th. Paschos:
Weighted Node Coloring: When Stable Sets Are Expensive.
WG 2002: 114-125 |
| 3 | EE | Jérôme Monnot:
Differential approximation results for the traveling salesman and related problems.
Inf. Process. Lett. 82(5): 229-235 (2002) |
| 2001 |
|---|
| 2 | EE | 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 |
| 1 | EE | Jérôme Monnot:
The maximum f-depth spanning tree problem.
Inf. Process. Lett. 80(4): 179-187 (2001) |
