( en | de | ru )

 

Disambiguation of "Demange, Marc"

Author of the publication

copydeleteadd this publication to your clipboard
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.

, , , , and . Discret. Appl. Math., 157 (4): 819-832 (2009)

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

Complexity of the Improper Twin Edge Coloring of Graphs., , , and . Graphs Comb., 33 (4): 595-615 (2017)On the complexity of the selective graph coloring problem in some special classes of graphs., , , and . Theor. Comput. Sci., (2014)(p, k)-coloring problems in line graphs., , and . Electron. Notes Discret. Math., (2005)Algorithms and Models for the On-Line Vertex-Covering., and . WG, volume 2573 of Lecture Notes in Computer Science, page 102-113. Springer, (2002)Online Strategies for Hard Optimization Problems in Graphs.. ICORES, page IS-7. SciTePress, (2015)Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs., and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 364-374. Springer, (2008)Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation., , , , and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 896-907. Springer, (2004)Partitioning cographs into cliques and stable sets., , and . Discret. Optim., 2 (2): 145-153 (2005)On-Line Maximum-Order Induces Hereditary Subgraph Problems., , and . SOFSEM, volume 1963 of Lecture Notes in Computer Science, page 327-335. Springer, (2000)The probabilistic k-center problem., , and . RSFF, volume 2146 of CEUR Workshop Proceedings, page 62-74. CEUR-WS.org, (2018)