Search result: Course units in Spring Semester 2024
Computer Science Master  | ||||||
 Minors | ||||||
| Minor in Theoretical Computer Science | ||||||
| Number | Title | Type | ECTS | Hours | Lecturers | |
|---|---|---|---|---|---|---|
| 272-0300-00L | Algorithmics for Hard Problems Does not take place this semester. This course d o e s n o t include the Mentored Work Specialised Courses with an Educational Focus in Computer Science A. | W | 5 credits | 2V + 1U + 1A | D. Komm | |
| 272-0302-00L | Approximation and Online Algorithms | W | 5 credits | 2V + 1U + 1A | H.‑J. Böckenhauer, D. Komm, M. Wettstein | |
| 401-3052-10L | Graph Theory | W | 9 credits | 4V + 1U | B. Sudakov | |
| 401-3902-21L | Network & Integer Optimization: From Theory to Application | W | 5 credits | 3G | R. Zenklusen | |
Page
3
of
3
All