Teaching - Earlier Terms

Winter 2015/2016 (Switch to Typo3)

Lecture: Algorithms and Data Structures (Martin Hoefer, Raimund Seidel)
Lecture: Approximation Algorithms (Mayank Goswami, Andreas Wiese)
Lecture: Theory of Distributed Systems (Christoph Lenzen)
Lecture: Ideen und Konzepte der Informatik (Kurt Mehlhorn)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Marvin Künnemann, Ruben Becker)
Seminar: Algorithmic Lower Bound Techniques (Parinya Chalermsook)
Seminar: Optimization and Entrepreneurship (Andreas Karrenbauer)

Summer 2015

Lecture: Optimization (Andreas Karrenbauer)
Lecture: Graphs, Algorithms and Complexity (Parinya Chalermsook, Erik Jan van Leeuwen)
Lecture: Parameterized Algorithms (Geevarghese Philip, Erik Jan van Leeuwen)
Lecture: Beyond classical chip design (Matthias Függer)
Lecture: Algorithmic Game Theory (Xiaohui Bei, Thomas Kesselheim)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Marvin Künnemann, Ruben Becker)

Winter 2014/2015

Lecture: Ideen der Informatik (Kurt Mehlhorn)
Lecture: Distributed Computing (Christoph Lenzen)
Lecture: Computer Algebra (Michael Sagraloff)
Lecture: Algorithms and Data Structures (Martin Hoefer, Michael Kerber)
Lecture: Integer Programming (Andreas Karrenbauer)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Marvin Künnemann, Ruben Becker)

Summer 2014

Lecture: Optimization (Andreas Karrenbauer, Parinya Chalermsook)
Lecture: Efficient Data Structures (Paweł Gawrychowski, Mayank Goswami, Patrick Nicholson)
Lecture: Parameterized Algorithms (Erik Jan van Leeuwen, Geevarghese Philip)
Lecture: Online Algorithms (Antonios Antoniadis, Martin Hoefer)
Lecture: Great Ideas in Theoretical Computer Science (Kurt Mehlhorn, He Sun)
Lecture: Random Discrete Structures (Kunal Dutta, Arjit Ghosh)
Lecture: Approximation Algorithms and Hardness of Approximation (Anna Adamaszek, Andreas Wiese)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Karl Bringmann)
Seminar: Topological Optimization Problems (Michal Adamaszek, Michael Kerber)

Winter 2013/2014

Lecture: Computational Geometry (Eric Berberich, Michael Kerber )
Lecture: Topics in Approximation Algorithms (Sayan Bhattacharya, Parinya Chalermsook)
Lecture: Ideen der Informatik (Kurt Mehlhorn, Adrian Neumann )
Seminar: Beyond Worst-Case Analysis (Martin Hoefer, Marvin Künnenmann)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Karl Bringmann)
Doctoral Privatissima: Spectral Graph Theory (He Sun)

Summer 2013

Lecture: Optimization (Andreas Karrenbauer, Matthias Mnich)
Lecture: Algorithms on Strings (Pawel Gawrychowski)
Lecture: Graph Theory (Artur Jez, Jens M. Schmidt)
Lecture: Great Ideas in Theoretical Computer Science (He Sun, Kurt Mehlhorn)
Lecture: Natural Algorithms (Kurt Mehlhorn) (cancelled)
Lecture: Learning, Game Theory and Optimization (Martin Hoefer)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Karl Bringmann)

Winter 2012/2013

Lecture: Algorithmic Game Theory (Sayan Bhattacharya, Rob van Stee)
Lecture: Ideen der Informatik (Kurt Mehlhorn, Adrian Neumann)
Lecture: Sublinear Algorithms (Thomas Sauerwald)
Lecture: Basic Mathematical Techniques for Computer Scientists (Geevarghese Philip")
Lecture: Randomized Methods in Computer Science (Benjamin Doerr)
Seminar: Graphs on Surfaces (Matthias Mnich, Jens M. Schmidt)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Karl Bringmann)
Seminar: Social Choice Theory (Rob van Stee, Christine Rizkallah)

Summer 2012

Lecture Optimization (Reto Spöhel, Rob van Stee)
Lecture Algorithm Engineering (Eric Berberich, Kurt Mehlhorn, Paweł Gawrychowski)
Lecture Advanced Graph Algorithms (Ran Duan, Jens M. Schmidt, Magnus Wahlström)
Lecture Computational Number Theory and Algebra (Markus Bläser, Chandan Saha)
Lecture Exponential-Time Algorithms (Matthias Mnich)
Lecture Basic Mathematical Techniques for Computer Scientists (Timo Kötzing, Xavier Pérez Giménez, Chandan Saha, Thomas Sauerwald, Reto Spöhel, Jens M. Schmidt, Carola Winzen)
Lecture Limits of Computational Learning (Timo Kötzing)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Carola Winzen)

Winter 2011/2012

Lecture Computational Thinking (Kurt Mehlhorn, Konstantinos Panagiotou)
Lecture Spectral Graph Theory (He Sun, Thomas Sauerwald)
Lecture Advanced Randomized Methods in Computer Science (Benjamin Doerr, Konstantinos Panagiotou, Thomas Sauerwald, Reto Spöhel)
Lecture Grundzüge Algorithmen und Datenstrukturen (Benjamin Doerr, Reto Spöhel)
Lecture Optimization II (Khaled Elbassioni, Saurabh Ray)
Seminar: Multi-Core Programming Lab on Swarm Algorithms (Tobias Friedrich, Timo Kötzing)
Seminar: Reading Group Algorithms (Kurt Mehlhorn, Carola Winzen)
Seminar: Algorithmic Game Theory (Rob van Stee)

Summer 2011

Lecture Algorithmic Game Theory (Kurt Mehlhorn, Rob van Stee)
Lecture Computer Algebra (Michael Sagraloff)
Lecture Optimization (Anke van Zuylen, Khaled Elbassioni)
Lecture Graph Theory (Benjamin Doerr, Danny Hermelin, Reto Spöhel)
Lecture The Probabilistic Method and Randomised Algorithms (Jane Gao, Xavier Pérez Giménez, Thomas Sauerwald)
Lecture Topological Methods in Geometry (Saurabh Ray, Nabil H. Mustafa)
Seminar: Theoretical Foundations of Swarm Intelligence (Tobias Friedrich, Timo Kötzing)
Seminar: Reading Group (Kurt Mehlhorn, Carola Winzen)

Winter 2010/2011

Lecture Optimization II- Approximation and Online algorithms (Chien-Chung Huang, Rob van Stee)
Lecture Models of Computation, an Algorithmic Perspective (Kurt Mehlhorn, Konstantinos Panagiotou, Reto Spöhel)
Lecture Expander Graphs in CS (He Sun)
Seminar: Randomized Algorithms (Tobias Friedrich, Thomas Sauerwald)
Seminar: Parameterized Algorithms and Complexity (Jiong Guo, Danny Hermelin, Magnus Wahlström)

Summer 2010

Lecture Optimization (Nicole Megow, Kurt Mehlhorn, Julian Mestre)
Lecture Mathematik für Informatiker II (Benjamin Doerr)
Lecture Algorithmic Game Theory (Vincenzo Bonifaci, Khaled Elbassioni, Angelina Vidali)
Lecture Algorithms and Randomization (Chinmoy Dutta, Nikolaos Fountoulakis, Anna Huber)
Seminar: Modern Topics in Algorithmics (NN)
Seminar Computational Geometry and Geometric Computing (Eric Berberich, Michael Sagraloff, Ben Galehouse)

Winter 2009/2010

Lecture Algorithms and Data Structures (Tobias Friedrich, Frank Neumann, Rob van Stee)
Lecture Computational Geometry and Geometric Computing (Eric Berberich, Kurt Mehlhorn, Michael Sagraloff)
Lecture Optimization II (Julián Mestre, Khaled Elbassioni)
Seminar: Theory of Randomized Search Heuristics (Benjamin Doerr, Kosta Panagiotou)
Seminar: Theory of Algorithms (Benjamin Doerr, Carola Winzen)
Seminar: Modern Topics in Algorithmics: Game Theory (Kurt Mehlhorn, Chien-Chung Huang)

Summer 2009

Lecture Optimization
Lecture Computational Discrete Mathematics
Lecture Discrete Geometry
Lecture Selected Topics in Algorithms
Lecture The Probabilistic Method
Seminar: Optimization under Uncertainty: Stochastic and Online Models

Winter 2008/2009

Lecture Randomized Algorithms (Selected Topics)
Lecture Approximation Algorithms
Lecture Nonlinear Computational Geometry
Seminar: Optimization of Submodular Functions and Their Applications

Summer 2008

Lecture Tropical Geometry and Algebraic Statistics
Lecture Internet Economics
Lecture Optimization
Lecture: Algorithms and Data Structures
Seminar: Bio-inspired Computation

Winter 2007/2008

Lecture Algorithms and Datastructures

Summer 2007

Lecture Optimization
Lecture Machine Learning

Winter 2006/2007

Lecture Evolutionary Algorithms
Lecture Graph Theory
Seminar: Computational Topology
Seminar: Searching with Suffix Arrays

Summer 2006

Lecture Algorithms for Large Data Sets
Lecture Optimization
Lecture Computational Geometry
Lecture Advanced Data Structures
Lecture Combinatorial Geometry
Lecture Einführung in die Informatik für Hörer aller Fakultäten I
Seminar: Liar Games and Noisy Channels

Winter 2005/2006

Lecture Approximation Algorithms
Lecture Discrepancy Theory
Lecture Datastructures and Algorithms
Lecture Randomized Algorithms
Seminar: Computational and Algebraic Geometry
Seminar: Information Retrieval

Summer 2005

Lecture Algorithm Engineering
Lecture Optimization
Lecture Online- and Approximation Algorithms
Seminar: Geometrische Algorithmen

Winter 2004/2005

Lecture Exakte und Effiziente Algorithmen für Kurven und Flächen
Lecture Data Structures and Algorithms
Seminar: Geometrisches Runden
Seminar: Advanced Topics in Information Retrieval

Summer 2004

Lecture Optimization
Lecture Large Scale Optimization
Lecture Algorithmic Aspects of Wireless Networking
Lecture Algorithmic Graph Theory
Proseminar: Das BUCH der Beweise - Proofs from THE BOOK
Seminar: Das BUCH der Beweise - Proofs from THE BOOK
Proseminar: Theorie und Praxis geometrischer Algorithmen
Seminar: Theorie und Praxis geometrischer Algorithmen

Winter 2003/2004

Vorlesung: Theoretische Informatik
Vorlesung: Data Structures and Algorithms
Vorlesung: Effective Computational Geometry for Curves and Surfaces
Vorlesung: Parallel and Distributed Algorithms
Seminar: Integer Programming and Combinatorial Optimization

Sommer 2003

Vorlesung: Algorithm Library Design
Vorlesung: Optimierung
Vorlesung: Network Flows
Seminar: Parallel and External Memory Graph Algorithms

Winter 2002/2003

Vorlesung: Randomized Algorithms
Mini-course: Selected Topics in Algorithms
Seminar: Approximation Algorithms

Sommer 2002

Vorlesung: Computational Geometry
Vorlesung: Parallel and Distributed Algorithms
Mini-course: Selected Topics in Algorithms

Winter 2001/2002

Vorlesung: Theory and Practice of Implementing Geometric Algorithms
Vorlesung: Data Structures and Algorithms
Vorlesung: Complexity Theory
Seminar: Algorithmic Aspects of Networks
Seminar: Theory and Practics of Implementing Geometric Algorithms

Sommer 2001

Seminar: Algorithmen für Große Datenmengen
Vorlesung: Randomisierte Algorithmen
Vorlesung: Optimization: Linear and Integer Programming and Approximation Algs

Winter 2000/2001

Vorlesung: Grundlagen zu Algorithmen und Datenstrukturen
Vorlesung: Algorithmen und Datenstrukturen
Vorlesung: Advanced Algorithms and Data Structures for Different Models of Computation
Vorlesung: Geometry of Mesh Generation

Sommer 2000

Vorlesung: Informatik V: Grundlagen von Datenstrukturen u. Algorithmen
Vorlesung: Software Design Praktikum

Winter 1999/2000

Vorlesung: Bioinformatik
Vorlesung: Praxis des Programmierens
Seminar: Algorithm Engineering
Seminar Parallel Algorithms
FoPra: Anbindung von LEDA an Java

Sommer 1999

Vorlesung: Parallel Algorithms

Winter 1998/98

Vorlesung: Komplexitätstheorie
Vorlesung: Praxis des Programmierens
Vorlesung: Datenstrukturen und Algorithmen
FoPra: Implementierung geometrischer Algorithmen
FoPra: Algorithmen für große Datenmengen
FoPra: Algorithmen zum Zeichnen von Graphen

Sommer 1998

Vorlesung: Advanced C++
Vorlesung: Parallele Programmierung
Seminar: Quantencomputer
Seminar: Randomisierte Algorithmen
FoPra: Geometrische Algorithmen
FoPra: Erläuterung von Algorithmen mittels Applets

Winter 1997/98

Vorlesung: Datenstructuren und Algorithmen
Vorlesung: Computational Molecular Biology
Vorlesung: Ganzzahlige Optimierung
FoPra: Implementierung von Dynamischen Graphenalgorithmen

Sommer 1997

Vorlesung: Optimierung
Vorlesung: Praxis des Programmierens
Vorlesung: Parallele Algorithmen

Winter 1996/97

Vorlesung: Praxis des Programmierens
Vorlesung: Datenstrukturen und Algorithmen
FoPra: Distributed Protocols Implementation and Evaluation
FoPra: Geometrische Algorithmen
FoPra: Implementierung von parallelen Algorithmen mit Hilfe von PAD
FoPra Implementierung von Dynamischen Graphenalgorithmen

Sommer 1996

Vorlesung: Informatik 4