Group members

Ondřej Suchý

Head of the group

FPT algorithms, parameterized complexity, kernelization, NP-hardness, graph algorithms.

Tomáš Valla

Combinatorics, graph theory, (algorithmic) game theory.

Dušan Knop

FPT algorithms, parameterized complexity, integer linear programming, NP-hardness, graph algorithms, (computational) social choice, game theory, (approximate) kernelization.

Michal Opler

Parameterized and computational complexity, permutation classes, graph theory, structural combinatorics.

Maria Saumell

Computational geometry, combinatorics, graph drawing.

Radek Hušek

Graph theory, cycle space of graphs, graph algorithms, combinatorics.

Tomáš Jakl

Game comonads, duality theory, pointfree topology, paraconsistent and modal logics.

Foivos Fioravantes

Structural and algorithmical graph theory, graph colouring, combinatorial game theory, efficient (parameterised) algorithms and lower bounds on complexity results.

Nikolaos Melissinos

Computational complexity, graph theory, (in)approximability, and parameterized algorithms.

Krisztina Szilágyi

Graph algorithms, parameterized complexity, lower bounds

Jan Matyáš Křišťan

Graph theory, combinatorics, combinatorial and algorithmic game theory.

Šimon Schierreich

Parameterized complexity and algorithms, computational social choice, social networks analysis and graph theory.

Martin Slávik

Parameterized complexity, graph algorithms, combinatorics, computational social choice, and graph theory.

Michal Dvořák

Graph theory, parametrized complexity, NP-hardness, computational social choice.

Jan Pokorný

Parametrized complexity and algorithms, graph theory, general solvers (SAT, ILP, ...), positional games.