Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Stefan Szeider
January 2007
Cite
Type
Conference Paper
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.
Cite
×