PhD Position on Parameterized and Fine-Grained Complexity of NP-Hard Problems

Join us to push the boundaries of algorithm design and uncover new insights into tackling NP-hard problems via the lens of search space decomposition methods.

This position focuses on fundamental open problems in algorithm design and computational complexity. The main theme will be a unifying theory of algorithmic power of combinatorial decompositions (such as tree decompositions) and algebraic decompositions (such as matrix-rank–based methods), combining elegant fundamental mathematics with computer science. There is also freedom to explore related topics in Parameterized/Fine-grained complexity or Theoretical Computer Science at large.

Your job

In algorithm design, the paradigm of decomposition is omnipresent. In the 5-year ERC project COALESCE we aim for new fundamental insights on this paradigm, especially in the context of Parameterized Complexity and Fine-grained complexity of NP-hard problems.

As a PhD candidate in the COALESCE project, you wi...