Group members
Professors and Researchers
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.
Jan Volec
Extremal and probabilistic combinatorics, Ramsey theory, Structural graph theory
Hanka Řada
Extremal graph theory, graph limits, inhomogeneous random graphs.
Žaneta Genčiová
Constraint satisfaction problems, universal algebra, database theory, NP-hardness.
Postdoctoral Fellows
Krisztina Szilágyi
Graph algorithms, parameterized complexity, lower bounds
Jan Matyáš Křišťan
Graph theory, combinatorics, combinatorial and algorithmic game theory.
Šimon Schierreich
Computational social choice, social networks analysis, parameterized algorithms and complexity.
Alexander Clifton
Extremal combinatorics, Ramsey theory, graph drawing, and graphs reconstruction.
Ajinkya Ramdas Gaikwad
Graph algorithms, parameterized complexity, algorithmic graph theory, structural graph theory.
Tyler James Tuttle
Computational geometry, discrete geometry, graph spanners.
PhD Candidates
Michal Dvořák
Graph theory, parametrized complexity, NP-hardness, computational social choice.
Jan Pokorný (Čenda)
Parametrized complexity and algorithms, graph theory, general solvers (SAT, ILP, ...), positional games.
Daniela Černá (née Opočenská)
Graph theory, extremal combinatorics and combinatorics on words.
Ioannis Kakatelis
Ramsey theory, spectral graph theory, algorithmic game theory, parameterized complexity.
Richard Hartmann
Computational complexity, computational social choice, quantum computing.
Students
Jíťa Mertlová
Voting theory, data science, AI.
Former Members
- Andrzej Kaczmarczyk,
- Robert Hancock,
- Pedro Araújo,
- Arun Kumar Das,
- Radovan Červený,
- Nikolaos Melissinos,
- Foivos Fioravantes,
- Václav Blažej,
- Sanjukta Roy,
- Jocelyn Thiebaut,
- Abhishek Sahu,
- Pratibha Choudhary