On the Complexity of Some Colorful Problems Parameterized by Treewidth

Michael Fellows, Fedor Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper published in Proceedings › peer-review

Original language	English
Title of host publication	Lecture Notes in Computer Science
Place of Publication	Berlin, Germany
Publisher	Springer
Pages	-
Number of pages	12
Publication status	Published - 2007
Event	Conference on Combinatorial Optimization and Applications (COCOA 2007) - Xi'an, China Duration: 14 Aug 2007 → 16 Aug 2007 Conference number: 2007

Conference	Conference on Combinatorial Optimization and Applications (COCOA 2007)
Abbreviated title	COCOA
Period	14/08/07 → 16/08/07

Cite this

@inproceedings{ebad962f77a6459989cd1deef3ab809f,

title = "On the Complexity of Some Colorful Problems Parameterized by Treewidth",

author = "Michael Fellows and Fedor Fomin and Daniel Lokshtanov and Frances Rosamond and Saket Saurabh and Stefan Szeider and Carsten Thomassen",

year = "2007",

language = "English",

pages = "--",

booktitle = "Lecture Notes in Computer Science",

publisher = "Springer",

address = "Switzerland",

note = "Conference on Combinatorial Optimization and Applications (COCOA 2007) , COCOA ; Conference date: 14-08-2007 Through 16-08-2007",

}

TY - GEN

T1 - On the Complexity of Some Colorful Problems Parameterized by Treewidth

AU - Fellows, Michael

AU - Fomin, Fedor

AU - Lokshtanov, Daniel

AU - Rosamond, Frances

AU - Saurabh, Saket

AU - Szeider, Stefan

AU - Thomassen, Carsten

N1 - Conference code: 2007

PY - 2007

Y1 - 2007

M3 - Conference Paper published in Proceedings

SP - -

BT - Lecture Notes in Computer Science

PB - Springer

CY - Berlin, Germany

T2 - Conference on Combinatorial Optimization and Applications (COCOA 2007)

Y2 - 14 August 2007 through 16 August 2007

ER -