PhD position in theoretical computer science and combinatorial optimization at the Department of Computer Science at Lund University.
Subject description
The PhD student will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group (https://jakobnordstrom.github.io/miao-group/) headed by Jakob Nordström (https://jakobnordstrom.github.io/), which is active at both Lund University and the University of Copenhagen.
The MIAO research group has a unique profile in that we are doing cutting-edge research both on the mathematical foundations of efficient computation and on state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where we do not only conduct in-depth research on different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise. Much of the activities of the group revolve around powerful algorithmic paradigms such as, e.g., Boolean satisfiability (SAT) solving, Gröbner basis computations, integer linear programming, and constraint programming. This leads to classical questions in computational complexity theory—though often with new, fascinating twists—but also involves work on devising clever algorithms that can exploit the power of such paradigms in practice.