Home

About us

The Algorithms and Complexity theme is led by Kristina Vušković. Research within the theme includes graph theory, matroid theory, algorithms on graphs and discrete structures, the computational complexity of problems on discrete structures, logic and proof complexity, parameterized complexity, deterministic scheduling theory and its applications, randomised algorithms,  probabilistic analysis of algorithms, approximation algorithms, and combinatorial optimisation.