 |
Marc DEMANGE
|
|
|
|
Université Panthéon-Sorbonne Paris I
CERMSEM - Centre de recherche de mathématiques, statistiques et d'économie mathématique
Maître de Conférences, Informatique
Maison des Sciences Economiques,
106-112 bd de l'Hopital
75013 Paris
FRANCE
|
|
|
 Related authors
 SOUTIF, Eric
| | Working papers and articles: (8)
 A tutorial on the use of graph coloring for some problems in robotics 
Demange, Marc & Ekim, TInaz & de Werra, Dominique (2009)
Polynomial approximation algorithms with performance guarantees: An introduction-by-example
DEMANGE, Marc
& Paschos, Vangelis Th. (2005)
A generalization of Konig-Egervary graphs and heuristics for the maximum independent set problem with improved approximation rat
Paschos, Vangelis Th. & DEMANGE, Marc
(1997)
The 0-1 inverse maximum stable set problem 
Chung Y., DEMANGE M.
On-line computation and maximum-weighted hereditary subgraph problems
DEMANGE M.
, Kouakou B., SOUTIF E.
On-line bin-packing problem : maximizing the number of unused bins
Kouakou B., DEMANGE M.
, SOUTIF E.
On-line computation and maximum-weighted hereditary subgraph problems
DEMANGE M.
, Kouakou B., SOUTIF E.
On-line bin-packing problem : maximizing the number of unused bins
Kouakou B., DEMANGE M.
, SOUTIF E.
|
