[Example Topic] Master Thesis: Dynamic Graph Algorithms

🎯 Topic Overview

This is an example topic illustrating how open Bachelor’s, Master’s, and Project thesis proposals are formulated in our research group.

🔍 Project Description

Dynamic graph algorithms maintain structural properties (such as connectivity, shortest paths, or planar embeddings) of graphs undergoing sequences of vertex/edge insertions and deletions. In this thesis project, you will:

• Design and implement efficient dynamic graph algorithms.
• Experimentally evaluate algorithms on realistic network benchmark instances.
• Integrate visual layout algorithms to observe graph changes in real time.

📋 Prerequisites & Skills

• Solid foundation in algorithms and data structures.
• Good programming proficiency (e.g. C++, Java, or Python).
• Curiosity to tackle algorithmic challenges.

👥 Supervision & Contact

• Primary Supervisor: Prof. Martin Nöllenburg
• Research Group: Algorithms and Complexity (E192-01)