by Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
Reference:
On the complexity of some colorful problems parameterized by treewidthMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten ThomassenInformation and Computation, volume 209, number 2, pages 143-153, 2011.
Bibtex Entry:
@string{infcomp="Information and Computation"}
@article {FellowsEtAl11,
author = {Fellows, Michael R. and Fomin, Fedor V. and Lokshtanov, Daniel
and Rosamond, Frances and Saurabh, Saket and Szeider, Stefan
and Thomassen, Carsten},
title = {On the complexity of some colorful problems parameterized by
treewidth},
journal = InfComp,
volume = {209},
year = {2011},
number = {2},
pages = {143-153},
}