Research topics
Algorithms and complexity
- Pavel Hubáček – cryptography and computational complexity
- Petr Kolman – approximation algorithms
- Michal Koucký – algorithms and computational complexity
- Jiří Sgall – approximation and online algorithms, scheduling
- Hans Raj Tiwary – polyhedral combinatorics and extension complexity
- Pavel Veselý – algorithms and data structures, streaming algorithms
Discrete geometry and computational topology
- Martin Balko – combinatorics and discrete geometry
- Jan Kynčl – discrete geometry and combinatorics
- Martin Tancer – combinatorial and computational topology and geometry
- Pavel Valtr – combinatorics and computational geometry
Combinatorics and graph theory
- Zdeněk Dvořák – structural and algorithmic graph theory
- Andrew Goodall – algebraic graph theory
- Petr Gregor – algorithms and combinatorics
- Jan Hubička – Ramsey theory
- Vít Jelínek – combinatorics and graph theory
- Ida Kantor – combinatorics and graph theory
- Martin Klazar – enumerative combinatorics, number theory
- Jan Kratochvíl – graph theory and computational complexity
- Jaroslav Nešetřil – network science
- Irena Penev – structural and algorithmic graph theory
- Robert Šámal – combinatorics and graph theory
- Mykhaylo Tyomkyn – extremal combinatorics and graph theory
Artificial intelligence
- Roman Barták – multi-agent path finding
- Ondřej Čepek – knowledge compilation, Boolean functions
- Jirka Fink – combinatorial optimization and artificial intelligence
- Martin Schmid – algorithmic game theory and machine learning
Operations research, optimization, computational social choice
- Milan Hladík – optimization and linear algebra
- Martin Koutecký – algorithms and computational social choice
- Martin Loebl – combinatorics, optimization, and algorithmic game theory
- Josef Tkadlec – evolutionary processes
