Parameterized Algorithms Laboratory
The Parameterized Algorithms Laboratory focuses its research on solving computationally challenging problems using modern techniques of designing exact algorithms. It often involves establishing connections between different problems and investigating how the complexity of a particular problem changes on specific classes of problem instances, such as instances having bounded parameter values.
Our main research projects:
- Maximum satisfiability problem
- Various graph coloring problems
- Graph clusterization
ISAAC 2020: The 31st International Symposium on Algorithms and Computation
MFCS 2020: 45th International Symposium on Mathematical Foundations of Computer Science