The number of participants in this lab is limited. If you would to like to participate, please write an informal application email to Jonas Sauer. Please mention the following:

• Your previous experience with graph algorithms.
• A list of the algorithmics-related courses you have attended.
• Your previous experience with the practical implementation of algorithms.

The lab will be about algorithms for dynamic graphs, i.e., graphs where edges are inserted and/or deleted over time. Problems that may be covered include shortest paths, spanning trees, minimum cuts, and matchings.

The lab will follow the Algorithm Engineering methodology. This means that the focus will not only be on the design and theoretical analysis of algorithms, but also on a practical implementation (in C++) and evaluation on real-world instances.

* Recent Advances in Fully Dynamic Graph Algorithms

_{DozentInnen: Mutzel, Sauer}