×

zbMATH — the first resource for mathematics

Monnot, Jérôme

Compute Distance To:
Author ID: monnot.jerome Recent zbMATH articles by "Monnot, Jérôme"
Published as: Monnot, J.; Monnot, Jerome; Monnot, Jérome; Monnot, Jérôme
Documents Indexed: 131 Publications since 1999, including 1 Book

Publications by Year

Citations contained in zbMATH

97 Publications have been cited 487 times in 307 Documents Cited by Year
Approximation algorithms and hardness results for labeled connectivity problems. Zbl 1149.90166
Hassin, Refael; Monnot, Jérôme; Segev, Danny
23
2007
Weighted coloring: further complexity and approximability results. Zbl 1181.68173
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
23
2006
Local search for the minimum label spanning tree problem with bounded color classes. Zbl 1046.90070
Brüggemann, Tobias; Monnot, Jérôme; Woeginger, Gerhard J.
23
2003
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1141.90506
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
21
2006
The labeled perfect matching in bipartite graphs. Zbl 1191.68470
Monnot, Jérôme
19
2005
Weighted node coloring: When stable sets are expensive. Zbl 1022.68092
Demange, Marc; de Werra, D.; Monnot, J.; Paschos, Vangelis Th.
17
2002
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. Zbl 1214.05162
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
16
2010
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Zbl 1173.05325
de Werra, D.; Demange, M.; Escoffier, B.; Monnot, J.; Paschos, V. Th.
16
2009
The minimum reload \(s-t\) path, trail and walk problems. Zbl 1209.05131
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme
15
2010
Time slot scheduling of compatible jobs. Zbl 1154.90439
Demange, M.; de Werra, D.; Monnot, J.; Paschos, V. Th.
15
2007
The path partition problem and related problems in bipartite graphs. Zbl 1129.05034
Monnot, Jérôme; Toulouse, Sophie
12
2007
Bridging gap between standard and differential polynomial approximation: The case of bin-packing. Zbl 0942.68144
Demange, M.; Monnot, J.; Paschos, V. Th.
11
1999
On the maximum independent set problem in subclasses of subcubic graphs. Zbl 1325.05129
Lozin, Vadim; Monnot, Jérôme; Ries, Bernard
10
2015
New candidates welcome! Possible winners with respect to the addition of new candidates. Zbl 1246.91041
Chevaleyre, Yann; Lang, Jérôme; Maudet, Nicolas; Monnot, Jérôme; Xia, Lirong
10
2012
Approximation algorithms for some vehicle routing problems. Zbl 1061.90006
Bazgan, Cristina; Hassin, Refael; Monnot, Jérôme
10
2005
On the complexity of the selective graph coloring problem in some special classes of graphs. Zbl 1418.68102
Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard
9
2014
A dichotomy for upper domination in monogenic classes. Zbl 1391.05240
AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard
8
2014
An introduction to inverse combinatorial problems. Zbl 1229.90157
Demange, Marc; Monnot, Jérôme
8
2010
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1180.90259
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis
8
2009
The maximum saving partition problem. Zbl 1274.90312
Hassin, Refael; Monnot, Jérôme
7
2005
Differential approximation results for the traveling salesman and related problems. Zbl 1338.68294
Monnot, Jérôme
7
2002
The \(P_{k}\) partition problem and related problems in bipartite graphs. Zbl 1130.68081
Monnot, Jérôme; Toulouse, Sophie
6
2007
On the differential approximation of MIN SET COVER. Zbl 1070.68153
Bazgan, Cristina; Monnot, Jérôme; Paschos, Vangelis Th.; Serriére, Fabrice
6
2005
A hypocoloring model for batch scheduling. Zbl 1115.68118
de Werra, D.; Demange, M.; Monnot, J.; Paschos, V. Th.
6
2005
Weighted coloring on planar, bipartite and split graphs: Complexity and improved approximation. Zbl 1116.68565
de Werra, Dominique; Demange, Mare; Escoffier, Bruno; Monnot, Jerome; Paschos, Vangelis Th.
6
2004
Maximizing the number of unused bins. Zbl 1204.90080
Demange, Marc; Monnot, Jérôme; Paschos, Vangelis Th.
6
2001
Upper domination: complexity and approximation. Zbl 06631025
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
5
2016
Reoptimization of maximum weight induced hereditary subgraph problems. Zbl 1277.68085
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
5
2013
Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation. Zbl 1187.90208
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme; Spanjaard, Olivier
5
2010
Differential approximation results for the traveling salesman problem with distances 1 and 2. Zbl 1012.90044
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
5
2003
Differential approximation results for the traveling salesman problem with distances 1 and 2 (extended abstract). Zbl 1003.90035
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
5
2001
Algorithmic aspects of Upper Domination: a parameterised perspective. Zbl 06649751
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2016
A boundary property for upper domination. Zbl 1392.68195
AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard; Zamaraev, Viktor
4
2016
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1328.68090
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
4
2015
The lazy matroid problem. Zbl 1417.68287
Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T.
4
2014
On the maximum independent set problem in subclasses of subcubic graphs. Zbl 1407.68366
Lozin, Vadim; Monnot, Jérôme; Ries, Bernard
4
2013
Labeled traveling salesman problems: complexity and approximation. Zbl 1264.90146
Couëtoux, Basile; Gourvès, Laurent; Monnot, Jérôme; Telelis, Orestis A.
4
2010
The max \(k\)-cut game and its strong equilibria. Zbl 1284.91076
Gourvès, Laurent; Monnot, Jérôme
4
2010
The minimum reload \(s\)-\(t\) path/trail/walk problems. Zbl 1206.68235
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme
4
2009
Polynomial approximation of hard NP-problems: local extremals and differential relation. Zbl 1140.90011
Monnot, Jérôme; Paschos, Vangelis T.; Toulouse, Sophie
4
2003
The many facets of upper domination. Zbl 1388.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
3
2018
Approximate tradeoffs on weighted labeled matroids. Zbl 1311.05028
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
3
2015
A note on the traveling salesman reoptimization problem under vertex insertion. Zbl 1318.90061
Monnot, Jerome
3
2015
A protocol for cutting matroids like cakes. Zbl 1406.91217
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
3
2013
The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design. Zbl 1391.90268
Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T.
3
2013
Complexity of trails, paths and circuits in arc-colored digraphs. Zbl 1262.05070
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos A.; Monnot, Jérôme
3
2013
Resilience and optimization of identifiable bipartite graphs. Zbl 1259.68160
Fritzilas, Epameinondas; Milanič, Martin; Monnot, Jérôme; Rios-Solis, Yasmin A.
3
2013
On paths, trails and closed trails in edge-colored graphs. Zbl 1283.05097
Gourvès, Laurent; Ramos De Lyra, Adria; Martinhon, Carlos Alberto; Monnot, Jérôme
3
2012
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1329.68137
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
3
2012
Selective graph coloring in some special classes of graphs. Zbl 1370.05167
Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard
3
2012
Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion. Zbl 1351.68306
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
3
2012
The complexity of bottleneck labeled graph problems. Zbl 1141.68534
Hassin, Refael; Monnot, Jérôme; Segev, Danny
3
2007
Complexity and approximation results for the connected vertex cover problem. Zbl 1141.68525
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
3
2007
On complexity and approximability of the labeled maximum/perfect matching problems. Zbl 1175.68203
Monnot, Jérôme
3
2005
(Non)-approximability for the multi-criteria \(\text{TSP}(1,2)\). Zbl 1122.90083
Angel, Eric; Bampis, Evripidis; Gourvès, Laurent; Monnot, Jérôme
3
2005
Approximation algorithms for the traveling salesman problem. Zbl 1064.90572
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
3
2002
The maximum \(f\)-depth spanning tree problem. Zbl 1032.68087
Monnot, J.
3
2001
Upper domination: towards a dichotomy through boundary properties. Zbl 1391.05241
AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard; Zamaraev, Viktor
2
2018
Extended Spanning Star Forest problems. Zbl 06843488
Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Theis, Dirk Oliver
2
2017
Approximate maximin share allocations in matroids. Zbl 1407.68546
Gourvès, Laurent; Monnot, Jérôme
2
2017
Congestion games with capacitated resources. Zbl 1327.91041
Gourvès, Laurent; Monnot, Jérôme; Moretti, Stefano; Thang, Nguyen Kim
2
2015
Near fairness in matroids. Zbl 1366.91101
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
2
2014
Strategic coloring of a graph. Zbl 1257.91009
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2012
On the impact of local taxes in a set cover game. Zbl 1284.91089
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2010
Strategic coloring of a graph. Zbl 1284.05168
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2010
The exact weighted independent set problem in perfect graphs and related classes. Zbl 1268.05152
Milanič, Martin; Monnot, Jérôme
2
2009
Some tractable instances of interval data minmax regret problems. Zbl 1155.90467
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier
2
2008
On labeled traveling salesman problems. Zbl 1183.90336
Couëtoux, Basile; Gourvès, Laurent; Monnot, Jérôme; Telelis, Orestis A.
2
2008
A better differential approximation ratio for symmetric TSP. Zbl 1145.68051
Escoffier, Bruno; Monnot, Jérôme
2
2008
Some tractable instances of interval data minmax regret problems: Bounded distance from triviality. Zbl 1132.68505
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier
2
2008
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s). Zbl 1176.90508
Monnot, Jérôme
2
2005
Bottleneck shortest paths on a partially ordered scale. Zbl 1039.05061
Monnot, Jérôme; Spanjaard, Olivier
2
2003
Differential approximation for some routing problems. Zbl 1032.90074
Bazgan, Cristina; Hassin, Refael; Monnot, Jérôme
2
2003
Differential approximation of NP-hard problems with equal size feasible solutions. Zbl 1037.90059
Monnot, Jérôme
2
2002
Maximum independent sets in subcubic graphs: new results. Zbl 07173289
Harutyunyan, Ararat; Lampis, Michael; Lozin, Vadim; Monnot, Jérôme
1
2019
Weighted upper edge cover: complexity and approximability. Zbl 1420.68093
Khoshkhah, Kaveh; Ghadikolaei, Mehdi Khosravian; Monnot, Jérôme; Sikora, Florian
1
2019
Efficient reallocation under additive and responsive preferences. Zbl 1442.91047
Aziz, Haris; Biró, Péter; Lang, Jérôme; Lesca, Julien; Monnot, Jérôme
1
2019
Complexity and approximability of extended spanning star forest problems in general and complete graphs. Zbl 1422.68121
Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Theis, Dirk Oliver
1
2019
Subset sum problems with digraph constraints. Zbl 1414.90345
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
1
2018
Weighted upper domination number. Zbl 1383.05228
Boyacı, Arman; Monnot, Jérôme
1
2017
Conference program design with single-peaked and single-crossing preferences. Zbl 1406.91115
Fotakis, Dimitris; Gourvès, Laurent; Monnot, Jérôme
1
2016
Worst case compromises in matroids with applications to the allocation of indivisible goods. Zbl 1320.91098
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
1
2015
Approximation with a fixed number of solutions of some multiobjective maximization problems. Zbl 1334.68299
Bazgan, Cristina; Gourvès, Laurent; Monnot, Jérôme
1
2013
Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph. Zbl 1271.05063
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
1
2013
Single approximation for the biobjective Max TSP. Zbl 1267.68316
Bazgan, Cristina; Gourvès, Laurent; Monnot, Jérôme; Pascual, Fanny
1
2013
Approximate tradeoffs on matroids. Zbl 1327.68297
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
1
2012
Congestion games with capacitated resources. Zbl 1284.91285
Gourvès, Laurent; Monnot, Jérôme; Moretti, Stefano; Thang, Nguyen Kim
1
2012
Complexity results for the empire problem in collection of stars. Zbl 1301.05239
Couetoux, Basile; Monnot, Jérome; Toubaline, Sonia
1
2012
Reoptimization of some maximum weight induced hereditary subgraph problems. Zbl 1297.68081
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
1
2012
Complexity of paths, trails and circuits in arc-colored digraphs. Zbl 1284.05285
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme
1
2010
On \(s\)–\(t\) paths and trails in edge-colored graphs. Zbl 1268.05112
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme; Protti, Fábio
1
2009
Cooperation in multiorganization matching. Zbl 1209.91117
Gourvès, Laurent; Monnot, Jérôme; Pascual, Fanny
1
2009
A note on the hardness results for the labeled perfect matching problems in bipartite graphs. Zbl 1157.68053
Monnot, Jérôme
1
2008
Approximation results for the weighted \(P_4\) partition problem. Zbl 1146.05315
Monnot, Jérôme; Toulouse, Sophie
1
2008
Weighted coloring: Further complexity and approximability results. Zbl 1171.68611
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
1
2005
Differential approximation results for the Steiner tree problem. Zbl 1046.90096
Demange, M.; Monnot, J.; Paschos, V. Th
1
2003
Approximation results toward nearest neighbor heuristic. Zbl 1045.90089
Monnot, Jérôme
1
2002
Maximum independent sets in subcubic graphs: new results. Zbl 07173289
Harutyunyan, Ararat; Lampis, Michael; Lozin, Vadim; Monnot, Jérôme
1
2019
Weighted upper edge cover: complexity and approximability. Zbl 1420.68093
Khoshkhah, Kaveh; Ghadikolaei, Mehdi Khosravian; Monnot, Jérôme; Sikora, Florian
1
2019
Efficient reallocation under additive and responsive preferences. Zbl 1442.91047
Aziz, Haris; Biró, Péter; Lang, Jérôme; Lesca, Julien; Monnot, Jérôme
1
2019
Complexity and approximability of extended spanning star forest problems in general and complete graphs. Zbl 1422.68121
Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Theis, Dirk Oliver
1
2019
The many facets of upper domination. Zbl 1388.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
3
2018
Upper domination: towards a dichotomy through boundary properties. Zbl 1391.05241
AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard; Zamaraev, Viktor
2
2018
Subset sum problems with digraph constraints. Zbl 1414.90345
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
1
2018
Extended Spanning Star Forest problems. Zbl 06843488
Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Theis, Dirk Oliver
2
2017
Approximate maximin share allocations in matroids. Zbl 1407.68546
Gourvès, Laurent; Monnot, Jérôme
2
2017
Weighted upper domination number. Zbl 1383.05228
Boyacı, Arman; Monnot, Jérôme
1
2017
Upper domination: complexity and approximation. Zbl 06631025
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
5
2016
Algorithmic aspects of Upper Domination: a parameterised perspective. Zbl 06649751
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2016
A boundary property for upper domination. Zbl 1392.68195
AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard; Zamaraev, Viktor
4
2016
Conference program design with single-peaked and single-crossing preferences. Zbl 1406.91115
Fotakis, Dimitris; Gourvès, Laurent; Monnot, Jérôme
1
2016
On the maximum independent set problem in subclasses of subcubic graphs. Zbl 1325.05129
Lozin, Vadim; Monnot, Jérôme; Ries, Bernard
10
2015
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1328.68090
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
4
2015
Approximate tradeoffs on weighted labeled matroids. Zbl 1311.05028
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
3
2015
A note on the traveling salesman reoptimization problem under vertex insertion. Zbl 1318.90061
Monnot, Jerome
3
2015
Congestion games with capacitated resources. Zbl 1327.91041
Gourvès, Laurent; Monnot, Jérôme; Moretti, Stefano; Thang, Nguyen Kim
2
2015
Worst case compromises in matroids with applications to the allocation of indivisible goods. Zbl 1320.91098
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
1
2015
On the complexity of the selective graph coloring problem in some special classes of graphs. Zbl 1418.68102
Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard
9
2014
A dichotomy for upper domination in monogenic classes. Zbl 1391.05240
AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard
8
2014
The lazy matroid problem. Zbl 1417.68287
Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T.
4
2014
Near fairness in matroids. Zbl 1366.91101
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
2
2014
Reoptimization of maximum weight induced hereditary subgraph problems. Zbl 1277.68085
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
5
2013
On the maximum independent set problem in subclasses of subcubic graphs. Zbl 1407.68366
Lozin, Vadim; Monnot, Jérôme; Ries, Bernard
4
2013
A protocol for cutting matroids like cakes. Zbl 1406.91217
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
3
2013
The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design. Zbl 1391.90268
Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T.
3
2013
Complexity of trails, paths and circuits in arc-colored digraphs. Zbl 1262.05070
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos A.; Monnot, Jérôme
3
2013
Resilience and optimization of identifiable bipartite graphs. Zbl 1259.68160
Fritzilas, Epameinondas; Milanič, Martin; Monnot, Jérôme; Rios-Solis, Yasmin A.
3
2013
Approximation with a fixed number of solutions of some multiobjective maximization problems. Zbl 1334.68299
Bazgan, Cristina; Gourvès, Laurent; Monnot, Jérôme
1
2013
Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph. Zbl 1271.05063
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
1
2013
Single approximation for the biobjective Max TSP. Zbl 1267.68316
Bazgan, Cristina; Gourvès, Laurent; Monnot, Jérôme; Pascual, Fanny
1
2013
New candidates welcome! Possible winners with respect to the addition of new candidates. Zbl 1246.91041
Chevaleyre, Yann; Lang, Jérôme; Maudet, Nicolas; Monnot, Jérôme; Xia, Lirong
10
2012
On paths, trails and closed trails in edge-colored graphs. Zbl 1283.05097
Gourvès, Laurent; Ramos De Lyra, Adria; Martinhon, Carlos Alberto; Monnot, Jérôme
3
2012
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1329.68137
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
3
2012
Selective graph coloring in some special classes of graphs. Zbl 1370.05167
Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard
3
2012
Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion. Zbl 1351.68306
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
3
2012
Strategic coloring of a graph. Zbl 1257.91009
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2012
Approximate tradeoffs on matroids. Zbl 1327.68297
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia
1
2012
Congestion games with capacitated resources. Zbl 1284.91285
Gourvès, Laurent; Monnot, Jérôme; Moretti, Stefano; Thang, Nguyen Kim
1
2012
Complexity results for the empire problem in collection of stars. Zbl 1301.05239
Couetoux, Basile; Monnot, Jérome; Toubaline, Sonia
1
2012
Reoptimization of some maximum weight induced hereditary subgraph problems. Zbl 1297.68081
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
1
2012
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. Zbl 1214.05162
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
16
2010
The minimum reload \(s-t\) path, trail and walk problems. Zbl 1209.05131
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme
15
2010
An introduction to inverse combinatorial problems. Zbl 1229.90157
Demange, Marc; Monnot, Jérôme
8
2010
Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation. Zbl 1187.90208
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme; Spanjaard, Olivier
5
2010
Labeled traveling salesman problems: complexity and approximation. Zbl 1264.90146
Couëtoux, Basile; Gourvès, Laurent; Monnot, Jérôme; Telelis, Orestis A.
4
2010
The max \(k\)-cut game and its strong equilibria. Zbl 1284.91076
Gourvès, Laurent; Monnot, Jérôme
4
2010
On the impact of local taxes in a set cover game. Zbl 1284.91089
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2010
Strategic coloring of a graph. Zbl 1284.05168
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2010
Complexity of paths, trails and circuits in arc-colored digraphs. Zbl 1284.05285
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme
1
2010
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Zbl 1173.05325
de Werra, D.; Demange, M.; Escoffier, B.; Monnot, J.; Paschos, V. Th.
16
2009
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1180.90259
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis
8
2009
The minimum reload \(s\)-\(t\) path/trail/walk problems. Zbl 1206.68235
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme
4
2009
The exact weighted independent set problem in perfect graphs and related classes. Zbl 1268.05152
Milanič, Martin; Monnot, Jérôme
2
2009
On \(s\)–\(t\) paths and trails in edge-colored graphs. Zbl 1268.05112
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme; Protti, Fábio
1
2009
Cooperation in multiorganization matching. Zbl 1209.91117
Gourvès, Laurent; Monnot, Jérôme; Pascual, Fanny
1
2009
Some tractable instances of interval data minmax regret problems. Zbl 1155.90467
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier
2
2008
On labeled traveling salesman problems. Zbl 1183.90336
Couëtoux, Basile; Gourvès, Laurent; Monnot, Jérôme; Telelis, Orestis A.
2
2008
A better differential approximation ratio for symmetric TSP. Zbl 1145.68051
Escoffier, Bruno; Monnot, Jérôme
2
2008
Some tractable instances of interval data minmax regret problems: Bounded distance from triviality. Zbl 1132.68505
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier
2
2008
A note on the hardness results for the labeled perfect matching problems in bipartite graphs. Zbl 1157.68053
Monnot, Jérôme
1
2008
Approximation results for the weighted \(P_4\) partition problem. Zbl 1146.05315
Monnot, Jérôme; Toulouse, Sophie
1
2008
Approximation algorithms and hardness results for labeled connectivity problems. Zbl 1149.90166
Hassin, Refael; Monnot, Jérôme; Segev, Danny
23
2007
Time slot scheduling of compatible jobs. Zbl 1154.90439
Demange, M.; de Werra, D.; Monnot, J.; Paschos, V. Th.
15
2007
The path partition problem and related problems in bipartite graphs. Zbl 1129.05034
Monnot, Jérôme; Toulouse, Sophie
12
2007
The \(P_{k}\) partition problem and related problems in bipartite graphs. Zbl 1130.68081
Monnot, Jérôme; Toulouse, Sophie
6
2007
The complexity of bottleneck labeled graph problems. Zbl 1141.68534
Hassin, Refael; Monnot, Jérôme; Segev, Danny
3
2007
Complexity and approximation results for the connected vertex cover problem. Zbl 1141.68525
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
3
2007
Weighted coloring: further complexity and approximability results. Zbl 1181.68173
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
23
2006
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1141.90506
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
21
2006
The labeled perfect matching in bipartite graphs. Zbl 1191.68470
Monnot, Jérôme
19
2005
Approximation algorithms for some vehicle routing problems. Zbl 1061.90006
Bazgan, Cristina; Hassin, Refael; Monnot, Jérôme
10
2005
The maximum saving partition problem. Zbl 1274.90312
Hassin, Refael; Monnot, Jérôme
7
2005
On the differential approximation of MIN SET COVER. Zbl 1070.68153
Bazgan, Cristina; Monnot, Jérôme; Paschos, Vangelis Th.; Serriére, Fabrice
6
2005
A hypocoloring model for batch scheduling. Zbl 1115.68118
de Werra, D.; Demange, M.; Monnot, J.; Paschos, V. Th.
6
2005
On complexity and approximability of the labeled maximum/perfect matching problems. Zbl 1175.68203
Monnot, Jérôme
3
2005
(Non)-approximability for the multi-criteria \(\text{TSP}(1,2)\). Zbl 1122.90083
Angel, Eric; Bampis, Evripidis; Gourvès, Laurent; Monnot, Jérôme
3
2005
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s). Zbl 1176.90508
Monnot, Jérôme
2
2005
Weighted coloring: Further complexity and approximability results. Zbl 1171.68611
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
1
2005
Weighted coloring on planar, bipartite and split graphs: Complexity and improved approximation. Zbl 1116.68565
de Werra, Dominique; Demange, Mare; Escoffier, Bruno; Monnot, Jerome; Paschos, Vangelis Th.
6
2004
Local search for the minimum label spanning tree problem with bounded color classes. Zbl 1046.90070
Brüggemann, Tobias; Monnot, Jérôme; Woeginger, Gerhard J.
23
2003
Differential approximation results for the traveling salesman problem with distances 1 and 2. Zbl 1012.90044
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
5
2003
Polynomial approximation of hard NP-problems: local extremals and differential relation. Zbl 1140.90011
Monnot, Jérôme; Paschos, Vangelis T.; Toulouse, Sophie
4
2003
Bottleneck shortest paths on a partially ordered scale. Zbl 1039.05061
Monnot, Jérôme; Spanjaard, Olivier
2
2003
Differential approximation for some routing problems. Zbl 1032.90074
Bazgan, Cristina; Hassin, Refael; Monnot, Jérôme
2
2003
Differential approximation results for the Steiner tree problem. Zbl 1046.90096
Demange, M.; Monnot, J.; Paschos, V. Th
1
2003
Weighted node coloring: When stable sets are expensive. Zbl 1022.68092
Demange, Marc; de Werra, D.; Monnot, J.; Paschos, Vangelis Th.
17
2002
Differential approximation results for the traveling salesman and related problems. Zbl 1338.68294
Monnot, Jérôme
7
2002
Approximation algorithms for the traveling salesman problem. Zbl 1064.90572
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
3
2002
Differential approximation of NP-hard problems with equal size feasible solutions. Zbl 1037.90059
Monnot, Jérôme
2
2002
Approximation results toward nearest neighbor heuristic. Zbl 1045.90089
Monnot, Jérôme
1
2002
Maximizing the number of unused bins. Zbl 1204.90080
Demange, Marc; Monnot, Jérôme; Paschos, Vangelis Th.
6
2001
Differential approximation results for the traveling salesman problem with distances 1 and 2 (extended abstract). Zbl 1003.90035
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
5
2001
The maximum \(f\)-depth spanning tree problem. Zbl 1032.68087
Monnot, J.
3
2001
Bridging gap between standard and differential polynomial approximation: The case of bin-packing. Zbl 0942.68144
Demange, M.; Monnot, J.; Paschos, V. Th.
11
1999
all top 5

Cited by 533 Authors

43 Monnot, Jérôme
24 Paschos, Vangelis Th.
13 Escoffier, Bruno
13 Gourvès, Laurent
11 Bazgan, Cristina
10 Demange, Marc
8 Fernau, Henning
8 Ries, Bernard
7 Böckenhauer, Hans-Joachim
7 Hassin, Refael
6 Boria, Nicolas
6 Mömke, Tobias
6 Sau, Ignasi
5 Branković, Ljiljana
5 Gözüpek, Didem
5 Lucarelli, Giorgio
5 Malaguti, Enrico
5 Mikhailyuk, Victor A.
5 Milis, Ioannis
5 Shalom, Mordechai
4 Bilò, Davide
4 Casel, Katrin
4 de Werra, Dominique
4 Ekim, Tınaz
4 Furini, Fabio
4 Karthick, T.
4 Lê, Ngoc Chi
4 Lozin, Vadim Vladislavovich
4 Malyshev, Dmitry S.
4 Paulusma, Daniël
4 Rothe, Jörg-Matthias
4 Tamir, Tami
4 Toulouse, Sophie
4 Zhang, Peng
4 Zych, Anna
3 Bourgeois, Nicolas
3 Brause, Christoph
3 Bredereck, Robert
3 Chen, Jiehua
3 Consoli, Sergio
3 Cornaz, Denis
3 Couëtoux, Basile
3 Fujito, Toshihiro
3 Galbiati, Giulia
3 Galeana-Sánchez, Hortensia
3 Hromkovič, Juraj
3 Johnson, Matthew
3 Komm, Dennis
3 Královič, Richard
3 Lampis, Michael
3 Liedloff, Mathieu
3 Maffioli, Francesco
3 Michail, Othon
3 Milanič, Martin
3 Niedermeier, Rolf
3 Paul, Christophe
3 Pop, Petrică Claudiu
3 Schiermeyer, Ingo
3 Tang, Linqing
3 Tlilane, Lydia
3 Toth, Paolo
3 Zamaraev, Victor A.
3 Zhang, Zhao
2 AbouEisha, Hassan
2 Araújo, Júlio César Silva
2 Bampis, Evripidis
2 Baste, Julien
2 Baumeister, Dorothea
2 Bermond, Jean-Claude
2 Betzler, Nadja
2 Bonomo, Flavia
2 Buchheim, Christoph
2 Cabral, Lucidio dos Anjos Formiga
2 Chalopin, Jérémie
2 Chung, Yerim
2 Coelho, Rafael S.
2 Cordero-Michel, Narda
2 Cygan, Marek
2 da Silva, Thiago Gouveia
2 Della Croce, Federico
2 Dey, Palash
2 Dolgui, Alexandre B.
2 Faria, Luerbio
2 Froese, Vincent
2 Fu, Bin
2 Gentili, Monica
2 Golden, Bruce L.
2 Gualandi, Stefano
2 Gueye, Serigne
2 Hemaspaandra, Edith
2 Hemaspaandra, Lane A.
2 Hussain, Shahid
2 Jansen, Klaus
2 Jost, Vincent
2 Kanté, Mamadou Moustapha
2 Kasperski, Adam
2 Khoshkhah, Kaveh
2 Khosravian Ghadikolaei, Mehdi
2 Klein, Kim-Manuel
2 Knust, Sigrid
...and 433 more Authors
all top 5

Cited in 67 Serials

53 Theoretical Computer Science
29 Discrete Applied Mathematics
20 Journal of Combinatorial Optimization
15 Algorithmica
15 European Journal of Operational Research
10 Information Processing Letters
9 Operations Research Letters
9 Journal of Discrete Algorithms
8 RAIRO. Operations Research
7 Discrete Optimization
6 Discrete Mathematics
6 Theory of Computing Systems
5 Cybernetics and Systems Analysis
4 Journal of Computer and System Sciences
4 Networks
4 Computers & Operations Research
3 Journal of Global Optimization
3 INFORMS Journal on Computing
3 Optimization Letters
2 Journal of Graph Theory
2 Naval Research Logistics
2 Graphs and Combinatorics
2 Mathematical Programming. Series A. Series B
2 Discussiones Mathematicae. Graph Theory
2 International Transactions in Operational Research
2 Journal of Heuristics
2 4OR
1 Artificial Intelligence
1 Bulletin of Mathematical Biology
1 Acta Mathematica Vietnamica
1 Information Sciences
1 International Journal of Game Theory
1 Journal of Computational and Applied Mathematics
1 Journal of Mathematical Economics
1 Journal of Optimization Theory and Applications
1 Mathematics of Operations Research
1 SIAM Journal on Computing
1 European Journal of Combinatorics
1 Mathematical Social Sciences
1 Combinatorica
1 Acta Mathematicae Applicatae Sinica. English Series
1 Information and Computation
1 SIAM Journal on Discrete Mathematics
1 International Journal of Computational Geometry & Applications
1 Computational Geometry
1 International Journal of Foundations of Computer Science
1 Discrete Mathematics and Applications
1 Annals of Mathematics and Artificial Intelligence
1 Mathematical Problems in Engineering
1 Optimization Methods & Software
1 Taiwanese Journal of Mathematics
1 Soft Computing
1 Mathematical Methods of Operations Research
1 Journal of Scheduling
1 Journal of Graph Algorithms and Applications
1 Journal of Systems Science and Complexity
1 Journal of Applied Mathematics
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Internet Mathematics
1 Discrete Mathematics, Algorithms and Applications
1 Advances in Operations Research
1 Symmetry
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Journal of Theoretical Biology
1 EURO Journal on Computational Optimization
1 Computer Science Review
1 Journal of Dynamics and Games

Citations by Year