Syllabus
In the course will be shown desing of effective algorithms for NP-hard problems on graphs of bounded treewidth. Some other graph classes (e.g. intersection graphs) will also be considered.
Annotation
Special course for advanced undergraduate and graduate students devoted to algorithm design for restricted graph classes.