Algorithms and complexity of graph problems and combinatorial games

In this line of research, we are interested in determining how efficiently problems can be solved.

The problems we deal with include graph problems and combinatorial games. Usually, polynomial-time algorithms are developed, when the problem admits an efficient solution, or NP-hardness proofs are given, when the problem fits in this complexity class. For hard problems, many approaches are used, either with the development of exact exponential algorithms, parameterized algorithms or even restricting the input to some well-behaved sets, such as graph classes, in a way that the additional structure of the input allows the development of efficient algorithms.