Martin Fürer. Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. In Alejandro López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Volume 6034 of Lecture Notes in Computer Science, pages 49-59, Springer, 2010. [doi]
Abstract is missing.