On the Complexity of Some Colorful Problems Parameterized by Treewidth

Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten

by Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. 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 A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten ThomassenProceedings of COCOA 2007, Combinatorial Optimization and Applications, First International Conference, Xi'an, China, August 14-16, 2007, volume 4616 of Lecture Notes in Computer Science, pages 366-377, 2007, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@inproceedings{FellowsEtal07,
  author    = {Michael R. Fellows and
               Fedor V. Fomin and
               Daniel Lokshtanov and
               Frances A. Rosamond and
               Saket Saurabh and
               Stefan Szeider and
               Carsten Thomassen},
  title     = {On the Complexity of Some Colorful Problems Parameterized
               by Treewidth},
  booktitle = {Proceedings of COCOA 2007, 
               Combinatorial Optimization and Applications, First International
               Conference, Xi'an, China, August 14-16, 2007},
  year      = {2007},
  pages     = {366-377},
  series    = LNCS,
  volume    = {4616},
  publisher = Springer,
}