People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
On the complexity of some colorful problems parameterized by treewidth
Fellows, Michael R.
,
Fomin, Fedor V.
,
Lokshtanov, Daniel and Rosamond, Frances
,
Saurabh, Saket
,
Stefan Szeider
January 2011
Cite
Type
Journal Article
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.
Cite
×