Algorithmic Lower Bounds for Problems Parameterized with Clique-Width

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh. Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. pages 493-502, SIAM, 2010. [doi]

Abstract

Abstract is missing.