Selected Topics in Algorithms and Complexity

Postgraduate course

Course description

Objectives and Content

The course deals with current topics in algorithms and complexity, and its content will vary from time to time the course is taught.

Topic Spring 2023: Algorithms for graphs of bounded width

Learning Outcomes

On completion of the course the student should have the following learning outcomes defined in terms of knowledge, skills and general competence:




The student knows the main methods and definitions in the considered field/topic.



The student is able to apply the main methods and definitions in the considered field in order to solve concrete problems.


General competence

The student is able to do research in the considered field as part of an MSc or PhD degree.

ECTS Credits


Level of Study


Semester of Instruction

Required Previous Knowledge
Masterstudents in informatics
Recommended Previous Knowledge
Access to the Course
Access to the course requires admission to a master's programme at The Faculty of Mathematics and Natural Sciences
Teaching and learning methods
There are 2-4 hours of lectures every week. When possible, there are also 2 hours of group sessions every week.
Forms of Assessment
Oral exam.
Grading Scale
Pass / Fail
Reading List
The reading list will be available within July 1st for the autumn semester and December 1st for the spring semester
Course Evaluation
The course will be evaluated by the students in accordance with the quality assurance system at UiB and the department.
Examination Support Material
Programme Committee
The Programme Committee is responsible for the content, structure and quality of the study programme and courses.
Course Coordinator
Course coordinator and administrative contact person can be found on Mitt UiB, or contact Student adviser
Course Administrator
The Faculty of Mathematics and Natural Sciences represented by the Department of Informatics is the course administrator for the course and study programme.