[Proof Complexity] PhD positions in TCS and/or combinatorial optimization in Copenhagen

Jakob Nordström jn at di.ku.dk
Sat May 11 21:20:18 CEST 2024

Dear colleagues,

I would be most grateful for any assistance in spreading the information below regarding PhD positions in theoretical computer science and/or combinatorial optimization at the University of Copenhagen.

Best regards,
Jakob Nordstrom


PhD positions in TCS and/or combinatorial optimization in Copenhagen

The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for PhD positions in theoretical computer science and/or combinatorial optimization.

The PhD students will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (https://jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge.

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, Groebner 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. Our most recent new line of research is on how to verify the correctness of state-of-the-art algorithms for combinatorial optimization. Such algorithms are often highly complex, and even mature commercial solvers are known to sometimes produce wrong results. Our work on designing a new generation of certifying combinatorial solvers, which output not only an answer but also a machine-verifiable mathematical proof that this answer is correct, has already led to several prestigious international awards, but many more exciting problems are still waiting to be solved!

We are fortunate to be part of the Algorithms and Complexity Section at DIKU, which is world-leading in algorithms and complexity theory. DIKU hosts the Basic Algorithms Research Copenhagen (BARC) centre joint with the IT University of Copenhagen (ITU), and we also have extensive collaborations with the Technical University of Denmark (DTU) and with Lund University on the Swedish side of the Oresund Bridge, as well as with our many visitors. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

These positions are available for period of 3-5 years, depending on the current education level of the applicant. All our PhD positions are fully funded, employed positions (including travel money) that come with an internationally competitive salary. The starting date is flexible, but will be in October 2024 or thereafter.

The application deadline is July 1, 2024. Please see https://jakobnordstrom.se/openings/PhD-UCPH-240701.html for more information and instructions how to apply. Informal enquiries are welcome and can be made to Jakob Nordstrom at jn at di.ku.dk.

Jakob Nordström, Professor
University of Copenhagen and Lund University
Phone: +45 28 78 38 11 / +46 70 742 21 98

More information about the Proof-Complexity mailing list