On the complexity of some colorful problems parameterized by treewidth

Abstract

Full Citation:

Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen. On the complexity of some colorful problems parameterized by treewidth. Information and Computation, volume 209, number 2, pages 143-153, 2011.

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.