PhD Position in Theoretical Computer Science: The Department of Computer Science at Lund University (Sweden) is offering a funded PhD position in theoretical computer science and/or combinatorial optimization. This is an incredible opportunity to conduct groundbreaking research in fields such as algorithms, complexity theory, Boolean satisfiability, integer linear programming, and certifying combinatorial optimization algorithms—all within a cutting-edge research environment.
PhD Position in Theoretical Computer Science and/or Combinatorial Optimization
Designation
PhD Candidate
Research Area
- Theoretical Computer Science
- Combinatorial Optimization
- Algorithms and Computational Complexity
- Boolean Satisfiability (SAT)
- Integer Linear Programming
- Certifying Algorithms
Location
Department of Computer Science, Lund University, Sweden
Eligibility/Qualification
To be eligible, candidates must meet the following criteria:
- Hold or be nearing completion of either:
- MSc degree
- 4-year BSc degree
- Suitable academic backgrounds:
- Computer Science
- Mathematics
- Electrical Engineering
- Technical Physics (with a theoretical emphasis)
- Strong background and interest in computer science and mathematics, demonstrated through:
- Excellent grades
- Performance in the Mathematics/Informatics Olympiads
- Research publications in reputable conferences/journals
- Problem-solving ability, creativity, and (for applied research) strong programming skills.
- Proficiency in English.
Job Description
PhD students will join the Mathematical Insights into Algorithms for Optimization (MIAO) group led by Jakob Nordström. MIAO is a premier and interdisciplinary research group working on the mathematical foundations of computation and state-of-the-art practical algorithms. Specific highlights of the role include:
- Primary Research Focus:
- Development of certifying algorithms that produce both results and mathematically verifiable proofs.
- This work revolves around ensuring correctness in combinatorial optimization solvers, a prominent and award-winning project supported by the Wallenberg AI, Autonomous Systems, and Software Program (WASP).
- Work Structure:
- Four-year full-time PhD position (extendable to five years if teaching responsibilities are included).
- Fully funded, internationally competitive salary, including travel allowances.
- Be part of Basic Algorithms Research Copenhagen (BARC), a globally renowned research hub in algorithms and complexity theory.
- Collaborate with researchers in the vibrant environment of Lund University as well as institutions across Denmark and Sweden.
How to Apply
Applicants must submit the following documents online via Lund University’s recruitment system:
- Curriculum Vitae (CV)
- Brief statement describing:
- Reason for pursuing doctoral studies.
- Qualifications and research interests.
- Diplomas and transcripts (BSc and MSc, as applicable).
- Copies of BSc/MSc thesis or published research papers (if available).
- Contact details (names and addresses) for three references who can be contacted.
Note: All documents should be in English (or official documents, possibly in Swedish).
Last Date to Apply
January 17, 2025 (Local Time, Lund)
Contact Information
Inquiries and additional details can be directed to Prof. Jakob Nordström. Email: jakob.nordstrom@cs.lth.se
For more details and to apply, visit the official job listing at Lund University Recruitment System.
This funded PhD position is a rare opportunity to work at the forefront of theoretical and applied research at one of the world’s top universities, while also living in a region recognized globally for its high quality of life. Don’t miss out!
