Lehre
- Sommersemester 2025
- Wintersemester 2024/25
- Sommersemester 2024
- Wintersemester 2023/24
- Sommersemester 2023
- Wintersemester 2022/23
- Sommersemester 2022
- Wintersemester 2021/22
- Sommersemester 2021
- Wintersemester 2020/21
- Sommersemester 2020
- Wintersemester 2019/20
- Sommersemester 2019
- Wintersemester 2018/19
- Sommersemester 2018
- Wintersemester 2017/18
- Sommersemester 2017
- Wintersemester 2016/2017
- Sommersemester 2016
- Wintersemester 2015/2016
- Sommersemester 2015
- Wintersemester 2014/2015
- Sommersemester 2014
- Wintersemester 2013/2014
- Sommersemester 2013
- Wintersemester 2012/2013
- Sommersemester 2012
- Wintersemester 2011/2012
- Sommersemester 2011
- Wintersemester 2010/2011
- Sommersemester 2010
- Wintersemester 2009/2010
- Sommersemester 2009
- Wintersemester 2008/2009
- Sommersemester 2008
- Wintersemester 2007/2008
- Sommersemester 2007
- Wintersemester 2006/2007
- Sommersemester 2006
- Wintersemester 2005/2006
- Sommersemester 2005
- Wintersemester 2004/2005
- Sommersemester 2004
- Wintersemester 2003/2004
- Sommersemester 2003
Sommersemester 2011
- Algorithmen für planare Graphen
- Algorithmen für Routenplanung
- Algorithmische Geometrie
- Seminar Expandergraphen
- Seminar Geometrische Algorithmen in der Computergrafik
- Proseminar: Die P-ungleich-NP-Vermutung
- Praxis der Software-Entwicklung
- Praktikum Graphengeneratoren
- Basis-Praktikum ACM ICPC Programmierwettbewerb