Research group

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.

Main projects

  • Maximum satisfiability problem
  • Different graph coloring problems
  • Graph clusterization

Publications