( en | de | ru )

 

Disambiguation of "Demange, Marc"

Author of the publication

copydeleteadd this publication to your clipboard
Hardness and approximation of minimum maximal matchings.

, , and . Int. J. Comput. Math., 91 (8): 1635-1654 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jonathan Demange

Delphine Demange

Jérémie Demange

Sébastien Demange

Vincent Demange

 

Other publications of authors with the same name

Approximation Results for the Minimum Graph Coloring Problem., , and . Inf. Process. Lett., 50 (1): 19-23 (1994)Differential approximation results for the Steiner tree problem., , and . Appl. Math. Lett., 16 (5): 733-739 (2003)Constrained Alignments of a Pair of Graphs., , , and . CoRR, (2014)Structure of conflict graphs in constraint alignment problems and algorithms., , , and . Discret. Math. Theor. Comput. Sci., (2019)A robust p-Center problem under pressure to locate shelters in wildfire context., , , and . EURO J. Comput. Optim., 8 (2): 103-139 (2020)Hardness and approximation of minimum maximal matchings., , and . Int. J. Comput. Math., 91 (8): 1635-1654 (2014)On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 433-442. Springer, (2005)Weighted Node Coloring: When Stable Sets Are Expensive., , , and . WG, volume 2573 of Lecture Notes in Computer Science, page 114-125. Springer, (2002)The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small., , , and . WG, volume 3353 of Lecture Notes in Computer Science, page 377-388. Springer, (2004)Online Bounded Coloring of Permutation and Overlap Graphs., , and . Electron. Notes Discret. Math., (2008)