nl en

Seminar Combinatorial Algorithms


Admission requirements

Not applicable.


In this seminar, we will discuss recent topics concerning algorithms. Each year an interesting common theme is chosen. Students present chapters from the literature, and write detailed papers (in LaTeX) explaining their lectures.
It is recommended that students have knowledge of algorithms, complexity and data structures (see for example the content of the Algorithmics, Data Structures and Complexity courses in the Leiden BSc programme in Computer Science).

Course objectives

Students should learn to read, understand, discuss and disseminate (in written and oral form) scientific papers.


The most recent timetable can be found at the students' website.

Mode of instruction

Student presentations (with peer feedback) and papers (with feedback from lecturers). Together we study recent literature on a common theme.

Course load

Total hours of study: 168 hrs.
Lectures 0:00 hrs.
Practical work 0:00 hrs.
Tutoring 0:00 hrs.
Examination 0:00 hrs.
Other 0:00 hrs.

Assessment method

No written exam. The final grade is determined by:

  • Two presentations

  • Active participation

  • Two papers

  • Peer review or programming

The teacher will inform the students how the inspection of and follow-up discussion of the exams will take place.

Reading list

  • The reading list is changing every academic year according to the subject of study. See the course website for more information.


  • You have to sign up for courses and exams (including retakes) in uSis. Check this link for information about how to register for courses.

  • Important: due to the format of the course, there is a limit on the number of participants: at most 10 students can participate in this course. Register by 1) signing up in uSis and 2) make an appointment with the lecturers in December.


Lecturers: dr. Hendrik Jan Hoogeboom & dr. Walter Kosters
Website: Seminar Combinatorial Algorithms