PhD in Algorithms and Complexity for Discrete Optimization Problems
This PhD position at Eindhoven University of Technology focuses on the theoretical and computational aspects of discrete optimization problems, particularly those arising in operations research such as scheduling and integer programming. Many of these problems are classically NP-hard, but specific structured cases may allow for efficient solution methods. The research aims to identify tractable structures, develop new algorithms, and clarify the boundaries between polynomial-time solvability and inherent computational hardness. The project also seeks to translate theoretical advances into practical algorithmic frameworks for combinatorial optimization, with broad applications in supply chain management, resource allocation, fair division, and voting rules.
You will join the Combinatorial Optimization group within the Department of Mathematics and Computer Science at TU/e, working under the supervision of Dr. Alexandra Lassota and Professor Frits Spieksma. Your main responsibilities include conducting scientific research, publishing and presenting results at international venues, and assisting with educational tasks such as course support and student supervision. The position offers full-time employment for four years, with an intermediate assessment after nine months. You will spend a minimum of 10% of your time on teaching tasks, with a maximum of 15% per year.
Employment conditions include a competitive salary (scale P, €3,059–€3,881 per month), year-end bonus (8.3%), annual vacation pay (8%), pension scheme, paid pregnancy and maternity leave, partially paid parental leave, and allowances for commuting, working from home, and internet costs. International candidates benefit from a Staff Immigration Team and a tax compensation scheme (the 30% facility). The university provides high-quality training programs, excellent technical infrastructure, on-campus childcare, and sports facilities.
Applicants must hold a bachelor and master degree in Mathematics, Computer Science, or Econometrics, with a strong background in Combinatorics and Complexity Theory. Good command of English is required; Dutch is not necessary. Candidates should be creative, ambitious, self-motivated, proactive, goal-oriented, and possess good communication skills. Occasional travel is expected. The application must include a cover letter, CV with publications and references, and BSc/MSc transcripts.
Eindhoven University of Technology is a leading international university in the Brainport region, known for its open and collaborative approach with high-tech industries. The Department of Mathematics and Computer Science is the largest at TU/e, with over 110 professors and nearly 300 PhD and EngD students. The university fosters a diverse and vibrant academic community, contributing to science and innovation both regionally and globally.
Applications are accepted online only via the provided link. The vacancy remains open until filled, with priority given to complete applications. A pre-employment screening (knowledge security check) may be part of the selection procedure. For further information, contact the supervisors or HR services as listed in the position description.
