Wolfgang Espelage, Frank Gurski, Egon Wanke. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. In Andreas Brandstädt, Van Bang Le, editors, Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Volume 2204 of Lecture Notes in Computer Science, pages 117-128, Springer, 2001. [doi]
Abstract is missing.