Algorithmic problem seminar - NTIN119

• Title: Problémový seminář z algoritmů
• Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
• Faculty: Faculty of Mathematics and Physics
• Actual: from 2025
• Semester: both
• E-Credits: 3
• Hours per week, examination: 0/2, C [HT]
• Capacity: unlimited
• Min. number of students: unlimited
• 4EU+: no
• Virtual mobility / capacity: no
• State of the course: taught
• Language: Czech, English
• Teaching methods: full-time
• Note: you can enroll for the course repeatedly; you can enroll for the course in winter and in summer semester
• Guarantor: prof. Mgr. Michal Koucký, Ph.D.; Mgr. Václav Rozhoň, Ph.D.; Mgr. Pavel Veselý, Ph.D.
• Teacher(s): prof. Mgr. Michal Koucký, Ph.D.; Mgr. Václav Rozhoň, Ph.D.; Mgr. Pavel Veselý, Ph.D.

Syllabus

The advisors choose accessible open problems from areas that include the

design of algorithms, data structures, complexity theory, and more. The

students under the guidance of the advisors, try to solve those problems during the semester.

We put emphasis on collaborative teamwork and teaching problem-solving skills.

Last update: Pangrác Ondřej, RNDr., Ph.D. (16.09.2025)