Organization: Lund University (MIAO Research Group; joint with University of Copenhagen)
Location: Lund, Sweden (with strong ties to Copenhagen, Denmark)

Position Overview
Fully funded postdoc in combinatorial optimization and/or theoretical computer science, with focus areas such as SAT/MaxSAT, constraint programming, mixed-integer programming, proof complexity, and certifying algorithms.

Duration / Type of Position

• Fully funded postdoc, usually 2–3 years (with travel money included)

Start Date

• Ideally August–September 2026 or earlier (negotiable)

Supervisor / Contact Person

• Prof. Jakob Nordström (MIAO group)

Required Qualifications

• PhD in computer science, mathematics, or related area 
• Strong background in theoretical CS / combinatorial optimization

Preferred Qualifications

• Experience with SAT/MaxSAT, CP, MIP, complexity theory, or proof systems

Application Materials

• Detailed on Lund University recruitment system; typically CV, research statement, publications, and references.

Application Deadline

• 16 January 2026 (all applications before this date receive full consideration)

Salary and Benefits

• Internationally competitive Swedish postdoc salary (with travel funds).

Apply Here (copyable link)   https://jakobnordstrom.se/openings/

Jakob Nordström

More opportunities link here!