Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier. Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. In Rudolf Fleischer, Gerhard Trippen, editors, Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings. Volume 3341 of Lecture Notes in Computer Science, pages 896-907, Springer, 2004. [doi]
@inproceedings{MonnotPWDE04,
title = {Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation},
author = {Jérôme Monnot and Vangelis Th. Paschos and Dominique de Werra and Marc Demange and Bruno Escoffier},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3341&spage=896},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MonnotPWDE04},
cites = {0},
citedby = {0},
pages = {896-907},
booktitle = {Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings},
editor = {Rudolf Fleischer and Gerhard Trippen},
volume = {3341},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-24131-0},
}