On an approximation measure founded on the links between optimization and polynomial approximation theory. Zbl 0871.90069
Demange, Marc; Paschos, Vangelis Th |
|
1996
|
New results on maximum induced matchings in bipartite graphs and beyond. Zbl 1267.68118
Dabrowski, Konrad K.; Demange, Marc; Lozin, Vadim V. |
|
2013
|
Differential approximation algorithms for some combinatorial optimization problems. Zbl 0912.68061
Demange, Marc; Grisoni, Pascal; Paschos, Vangelis Th. |
|
1998
|
On some applications of the selective graph coloring problem. Zbl 1357.05041
Demange, Marc; Ekim, Tınaz; Ries, Bernard; Tanasescu, Cerasela |
|
2015
|
Weighted node coloring: When stable sets are expensive. Zbl 1022.68092
Demange, Marc; de Werra, D.; Monnot, J.; Paschos, Vangelis Th. |
|
2002
|
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. |
|
2009
|
Algorithms for the on-line quota traveling salesman problem. Zbl 1178.90282
Ausiello, G.; Demange, M.; Laura, L.; Paschos, V. |
|
2004
|
Partitioning cographs into cliques and stable sets. Zbl 1136.05315
Demange, Marc; Ekim, Tınaz; de Werra, Dominique |
|
2005
|
An introduction to inverse combinatorial problems. Zbl 1229.90157
Demange, Marc; Monnot, Jérôme |
|
2010
|
On-line vertex-covering. Zbl 1070.68118
Demange, Marc; Paschos, Vangelis Th. |
|
2005
|
Time slot scheduling of compatible jobs. Zbl 1154.90439
Demange, M.; de Werra, D.; Monnot, J.; Paschos, V. Th. |
|
2007
|
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 |
|
2014
|
Oriented coloring: complexity and approximation. Zbl 1175.05054
Culus, Jean-François; Demange, Marc |
|
2006
|
Bridging gap between standard and differential polynomial approximation: The case of bin-packing. Zbl 0942.68144
Demange, M.; Monnot, J.; Paschos, V. Th. |
|
1999
|
Approximation results for the minimum graph coloring problem. Zbl 0806.68085
Demange, Marc; Grisoni, Pascal; Paschos, Vangelis Th. |
|
1994
|
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios. Zbl 0919.90140
Paschos, Vangelis Th.; Demange, Marc |
|
1997
|
Efficient recognition of equimatchable graphs. Zbl 1329.05243
Demange, Marc; Ekim, Tınaz |
|
2014
|
Minimum maximal matching is NP-hard in regular bipartite graphs. Zbl 1139.05337
Demange, M.; Ekim, T. |
|
2008
|
A tutorial on the use of graph coloring for some problems in robotics. Zbl 1198.05045
Demange, Marc; Ekim, Tınaz; De Werra, Dominique |
|
2009
|
The 0-1 inverse maximum stable set problem. Zbl 1152.68039
Chung, Yerim; Demange, Marc |
|
2008
|
Improved approximations for maximum independent set via approximation chains. Zbl 0883.68067
Demange, M.; Paschos, V. Th. |
|
1997
|
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. |
|
2004
|
A hypocoloring model for batch scheduling. Zbl 1115.68118
de Werra, D.; Demange, M.; Monnot, J.; Paschos, V. Th. |
|
2005
|
Maximizing the number of unused bins. Zbl 1204.90080
Demange, Marc; Monnot, Jérôme; Paschos, Vangelis Th. |
|
2001
|
Completeness in differential approximation classes. Zbl 1124.68365
Ausiello, G.; Bazgan, C.; Demange, M.; Paschos, V. Th. |
|
2003
|
On-line maximum-order induced hereditary subgraph problems. Zbl 1043.68615
Demange, Marc; Paradon, Xavier; Paschos, Vangelis Th. |
|
2000
|
On the online track assignment problem. Zbl 1238.90088
Demange, Marc; Di Stefano, Gabriele; Leroy-Beaulieu, Benjamin |
|
2012
|
Improved approximations for weighted and unweighted graph problems. Zbl 1085.68105
Demange, Marc; Paschos, Vangelis |
|
2005
|
Completeness in differential approximation classes. Zbl 1081.68121
Ausiello, Giorgio; Bazgan, Cristina; Demange, Marc; Paschos, Vangelis Th. |
|
2005
|
A note on the approximation of a minimum-weight maximal independent set. Zbl 0958.90093
Demange, Marc |
|
1999
|
On the minimum and maximum selective graph coloring problems in some graph classes. Zbl 1333.05106
Demange, Marc; Ekim, Tınaz; Ries, Bernard |
|
2016
|
On inverse traveling salesman problems. Zbl 1261.90041
Chung, Yerim; Demange, Marc |
|
2012
|
\((p,k)\)-coloring problems in line graphs. Zbl 1086.05029
Demange, Marc; Ekim, Tınaz; de Werra, Dominique |
|
2005
|
A note on the NP-hardness of two matching problems in induced subgrids. Zbl 1281.68122
Demange, Marc; Ekim, Tınaz |
|
2013
|
Hardness and approximation of minimum maximal matchings. Zbl 1305.05188
Demange, Marc; Ekim, Tınaz; Tanasescu, Cerasela |
|
2014
|
On inverse chromatic number problems (extended abstract). Zbl 1274.05152
Chung, Yerim; Culus, Jean-François; Demange, Marc |
|
2010
|
On some coloring problems in grids. Zbl 1257.68071
Demange, Marc; De Werra, Dominique |
|
2013
|
Selective graph coloring in some special classes of graphs. Zbl 1370.05167
Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard |
|
2012
|
On the approximation of min split-coloring and min cocoloring. Zbl 1161.68652
Demange, Marc; Ekim, Tinaz; De Werra, Dominique |
|
2006
|
Inverse booking problem: Inverse chromatic number problem in interval graphs. Zbl 1132.90372
Chung, Yerim; Culus, Jean-François; Demange, Marc |
|
2008
|
Some steps towards the conciliation of approximation and optimization theory: a new suggested approximation measure and preliminary results.
(Quelques étapes vers la conciliation de la théorie d’approximation et celle d’optimisation: une nouvelle théorie d’approximation polynomiale et résultats préliminaires.) Zbl 0785.90074
Demange, Marc; Paschos, Vangelis Th. |
|
1993
|
Polynomial approximation algorithms with performance guarantees: an introduction-by-example. Zbl 1062.90053
Demange, Marc; Paschos, Vangelis Th. |
|
2005
|
On-line maximum-order induced hereditary subgraph problems. Zbl 1063.90059
Demange, Marc; Paradon, Xavier; Paschos, Vangelis Th. |
|
2005
|
On new notions for the analysis of approximation algorithms: a unified formalism and approximation classes.
(Autour de nouvelles notions pour l’analyse des algorithmes d’approximation: formalisme unifié et classes d’approximation.) Zbl 1089.68668
Demage, Marc; Paschos, Vangelis |
|
2002
|
Some inverse traveling salesman problems. Zbl 1278.90332
Chung, Yerim; Demange, Marc |
|
2008
|
The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems. Zbl 0872.90106
DeMange, Marc; Paschos, Vangelis Th. |
|
1997
|
Extremal values of a combinatorial optimization problem and polynomial approximation.
(Valeurs extrémales d’un problème d’optimisation combinatoire et approximation polynomiale.) Zbl 0885.90093
Demange, Marc; Paschos, Vangelis Th. |
|
1996
|
A note on online colouring problems in overlap graphs and their complements. Zbl 1498.68201
Demange, Marc; Olsen, Martin |
|
2018
|
Inverse chromatic number problems in interval and permutation graphs. Zbl 1346.05062
Chung, Yerim; Culus, Jean-François; Demange, Marc |
|
2015
|
About some robustness and complexity properties of \(G\)-graphs networks. Zbl 1306.05230
Culus, Jean-François; Demange, Marc; Marinescu-Ghemeci, Ruxandra; Tanasescu, Cerasela |
|
2015
|
Approximation algorithms: a small traveling salesman problem.
(Algorithmes d’approximation: un petit tour en compagnie d’un voyageur de commerce.) Zbl 1177.90415
Demange, Marc |
|
2004
|
About new notions for the analysis of approximation algorithms: from the NPO structure to the structure of instants.
(Autour de nouvelles notions pour l’analyse des algorithmes d’approximation: De la structure de NPO à la structure des instances.) Zbl 1096.68783
Demange, Marc; Paschos, Vangelis |
|
2002
|
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. Zbl 0961.90084
Demange, Marc; Paschos, Vangelis Th. |
|
1999
|
Differential approximation results for the Steiner tree problem. Zbl 1046.90096
Demange, M.; Monnot, J.; Paschos, V. Th |
|
2003
|
Generalised online colouring problems in overlap graphs. Zbl 1516.68058
Demange, Marc; Olsen, Martin |
|
2021
|
Online bounded coloring of permutation and overlap graphs. Zbl 1341.05069
Demange, Marc; Di Stefano, Gabriele; Leroy-Beaulieu, Benjamin |
|
2008
|
Some results in the frame of a new polynomial approximation theory.
(Quelques résultats dans le cadre d’une nouvelle théorie de l’approximation polynomiale.) Zbl 0793.41011
Demange, Marc; Grisoni, Pascal; Paschos, Vangelis Th. |
|
1994
|
A robust \(p\)-center problem under pressure to locate shelters in wildfire context. Zbl 1476.90175
Demange, Marc; Gabrel, Virginie; Haddad, Marcel A.; Murat, Cécile |
|
2020
|
Generalised online colouring problems in overlap graphs. Zbl 1516.68058
Demange, Marc; Olsen, Martin |
|
2021
|
A robust \(p\)-center problem under pressure to locate shelters in wildfire context. Zbl 1476.90175
Demange, Marc; Gabrel, Virginie; Haddad, Marcel A.; Murat, Cécile |
|
2020
|
A note on online colouring problems in overlap graphs and their complements. Zbl 1498.68201
Demange, Marc; Olsen, Martin |
|
2018
|
On the minimum and maximum selective graph coloring problems in some graph classes. Zbl 1333.05106
Demange, Marc; Ekim, Tınaz; Ries, Bernard |
|
2016
|
On some applications of the selective graph coloring problem. Zbl 1357.05041
Demange, Marc; Ekim, Tınaz; Ries, Bernard; Tanasescu, Cerasela |
|
2015
|
Inverse chromatic number problems in interval and permutation graphs. Zbl 1346.05062
Chung, Yerim; Culus, Jean-François; Demange, Marc |
|
2015
|
About some robustness and complexity properties of \(G\)-graphs networks. Zbl 1306.05230
Culus, Jean-François; Demange, Marc; Marinescu-Ghemeci, Ruxandra; Tanasescu, Cerasela |
|
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 |
|
2014
|
Efficient recognition of equimatchable graphs. Zbl 1329.05243
Demange, Marc; Ekim, Tınaz |
|
2014
|
Hardness and approximation of minimum maximal matchings. Zbl 1305.05188
Demange, Marc; Ekim, Tınaz; Tanasescu, Cerasela |
|
2014
|
New results on maximum induced matchings in bipartite graphs and beyond. Zbl 1267.68118
Dabrowski, Konrad K.; Demange, Marc; Lozin, Vadim V. |
|
2013
|
A note on the NP-hardness of two matching problems in induced subgrids. Zbl 1281.68122
Demange, Marc; Ekim, Tınaz |
|
2013
|
On some coloring problems in grids. Zbl 1257.68071
Demange, Marc; De Werra, Dominique |
|
2013
|
On the online track assignment problem. Zbl 1238.90088
Demange, Marc; Di Stefano, Gabriele; Leroy-Beaulieu, Benjamin |
|
2012
|
On inverse traveling salesman problems. Zbl 1261.90041
Chung, Yerim; Demange, Marc |
|
2012
|
Selective graph coloring in some special classes of graphs. Zbl 1370.05167
Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard |
|
2012
|
An introduction to inverse combinatorial problems. Zbl 1229.90157
Demange, Marc; Monnot, Jérôme |
|
2010
|
On inverse chromatic number problems (extended abstract). Zbl 1274.05152
Chung, Yerim; Culus, Jean-François; Demange, Marc |
|
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. |
|
2009
|
A tutorial on the use of graph coloring for some problems in robotics. Zbl 1198.05045
Demange, Marc; Ekim, Tınaz; De Werra, Dominique |
|
2009
|
Minimum maximal matching is NP-hard in regular bipartite graphs. Zbl 1139.05337
Demange, M.; Ekim, T. |
|
2008
|
The 0-1 inverse maximum stable set problem. Zbl 1152.68039
Chung, Yerim; Demange, Marc |
|
2008
|
Inverse booking problem: Inverse chromatic number problem in interval graphs. Zbl 1132.90372
Chung, Yerim; Culus, Jean-François; Demange, Marc |
|
2008
|
Some inverse traveling salesman problems. Zbl 1278.90332
Chung, Yerim; Demange, Marc |
|
2008
|
Online bounded coloring of permutation and overlap graphs. Zbl 1341.05069
Demange, Marc; Di Stefano, Gabriele; Leroy-Beaulieu, Benjamin |
|
2008
|
Time slot scheduling of compatible jobs. Zbl 1154.90439
Demange, M.; de Werra, D.; Monnot, J.; Paschos, V. Th. |
|
2007
|
Oriented coloring: complexity and approximation. Zbl 1175.05054
Culus, Jean-François; Demange, Marc |
|
2006
|
On the approximation of min split-coloring and min cocoloring. Zbl 1161.68652
Demange, Marc; Ekim, Tinaz; De Werra, Dominique |
|
2006
|
Partitioning cographs into cliques and stable sets. Zbl 1136.05315
Demange, Marc; Ekim, Tınaz; de Werra, Dominique |
|
2005
|
On-line vertex-covering. Zbl 1070.68118
Demange, Marc; Paschos, Vangelis Th. |
|
2005
|
A hypocoloring model for batch scheduling. Zbl 1115.68118
de Werra, D.; Demange, M.; Monnot, J.; Paschos, V. Th. |
|
2005
|
Improved approximations for weighted and unweighted graph problems. Zbl 1085.68105
Demange, Marc; Paschos, Vangelis |
|
2005
|
Completeness in differential approximation classes. Zbl 1081.68121
Ausiello, Giorgio; Bazgan, Cristina; Demange, Marc; Paschos, Vangelis Th. |
|
2005
|
\((p,k)\)-coloring problems in line graphs. Zbl 1086.05029
Demange, Marc; Ekim, Tınaz; de Werra, Dominique |
|
2005
|
Polynomial approximation algorithms with performance guarantees: an introduction-by-example. Zbl 1062.90053
Demange, Marc; Paschos, Vangelis Th. |
|
2005
|
On-line maximum-order induced hereditary subgraph problems. Zbl 1063.90059
Demange, Marc; Paradon, Xavier; Paschos, Vangelis Th. |
|
2005
|
Algorithms for the on-line quota traveling salesman problem. Zbl 1178.90282
Ausiello, G.; Demange, M.; Laura, L.; Paschos, V. |
|
2004
|
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. |
|
2004
|
Approximation algorithms: a small traveling salesman problem.
(Algorithmes d’approximation: un petit tour en compagnie d’un voyageur de commerce.) Zbl 1177.90415
Demange, Marc |
|
2004
|
Completeness in differential approximation classes. Zbl 1124.68365
Ausiello, G.; Bazgan, C.; Demange, M.; Paschos, V. Th. |
|
2003
|
Differential approximation results for the Steiner tree problem. Zbl 1046.90096
Demange, M.; Monnot, J.; Paschos, V. Th |
|
2003
|
Weighted node coloring: When stable sets are expensive. Zbl 1022.68092
Demange, Marc; de Werra, D.; Monnot, J.; Paschos, Vangelis Th. |
|
2002
|
On new notions for the analysis of approximation algorithms: a unified formalism and approximation classes.
(Autour de nouvelles notions pour l’analyse des algorithmes d’approximation: formalisme unifié et classes d’approximation.) Zbl 1089.68668
Demage, Marc; Paschos, Vangelis |
|
2002
|
About new notions for the analysis of approximation algorithms: from the NPO structure to the structure of instants.
(Autour de nouvelles notions pour l’analyse des algorithmes d’approximation: De la structure de NPO à la structure des instances.) Zbl 1096.68783
Demange, Marc; Paschos, Vangelis |
|
2002
|
Maximizing the number of unused bins. Zbl 1204.90080
Demange, Marc; Monnot, Jérôme; Paschos, Vangelis Th. |
|
2001
|
On-line maximum-order induced hereditary subgraph problems. Zbl 1043.68615
Demange, Marc; Paradon, Xavier; Paschos, Vangelis Th. |
|
2000
|
Bridging gap between standard and differential polynomial approximation: The case of bin-packing. Zbl 0942.68144
Demange, M.; Monnot, J.; Paschos, V. Th. |
|
1999
|
A note on the approximation of a minimum-weight maximal independent set. Zbl 0958.90093
Demange, Marc |
|
1999
|
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. Zbl 0961.90084
Demange, Marc; Paschos, Vangelis Th. |
|
1999
|
Differential approximation algorithms for some combinatorial optimization problems. Zbl 0912.68061
Demange, Marc; Grisoni, Pascal; Paschos, Vangelis Th. |
|
1998
|
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios. Zbl 0919.90140
Paschos, Vangelis Th.; Demange, Marc |
|
1997
|
Improved approximations for maximum independent set via approximation chains. Zbl 0883.68067
Demange, M.; Paschos, V. Th. |
|
1997
|
The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems. Zbl 0872.90106
DeMange, Marc; Paschos, Vangelis Th. |
|
1997
|
On an approximation measure founded on the links between optimization and polynomial approximation theory. Zbl 0871.90069
Demange, Marc; Paschos, Vangelis Th |
|
1996
|
Extremal values of a combinatorial optimization problem and polynomial approximation.
(Valeurs extrémales d’un problème d’optimisation combinatoire et approximation polynomiale.) Zbl 0885.90093
Demange, Marc; Paschos, Vangelis Th. |
|
1996
|
Approximation results for the minimum graph coloring problem. Zbl 0806.68085
Demange, Marc; Grisoni, Pascal; Paschos, Vangelis Th. |
|
1994
|
Some results in the frame of a new polynomial approximation theory.
(Quelques résultats dans le cadre d’une nouvelle théorie de l’approximation polynomiale.) Zbl 0793.41011
Demange, Marc; Grisoni, Pascal; Paschos, Vangelis Th. |
|
1994
|
Some steps towards the conciliation of approximation and optimization theory: a new suggested approximation measure and preliminary results.
(Quelques étapes vers la conciliation de la théorie d’approximation et celle d’optimisation: une nouvelle théorie d’approximation polynomiale et résultats préliminaires.) Zbl 0785.90074
Demange, Marc; Paschos, Vangelis Th. |
|
1993
|