Algorithms with performance guarantees

This research workshop focuses on complexity theory, exact and parameterized algorithms, approximation theory, dynamic optimization models and algorithmic games. Its connecting thread is the solution of discrete problems coming for several combinatorial optimization models by algorithms that guarantee several types of requirements (time, space, solution’s quality, etc.).

All these themes lead to several proposals for Master dissertations.