Christiana Banja

Call for applications for a fully funded PhD position in Algorithms and Complexity for Discrete Optimization Problems at Eindhoven University of Technology (TU/e) , Department of Mathematics and Computer Science. The project sits at the intersection of mathematics and computer science , with a strong focus on combinatorial optimization , complexity theory , discrete optimization , scheduling , and integer programming . The research aims to identify special structures in NP-hard problems that allow efficient solution methods, develop new algorithms for structured optimization problems, and sharpen the boundary between tractable and hard cases. The successful candidate will work under the supervision of Alexandra Lassota and Frits Spieksma in the Combinatorial Optimization group at TU/e. Responsibilities include conducting scientific research, publishing and presenting results at international venues, and contributing a small portion of time to teaching support and student supervision. Eligibility highlights: applicants should hold both a Bachelor’s and Master’s degree in Mathematics, Computer Science, or Econometrics . A strong background in combinatorics and complexity theory is required, together with good communication skills, teamwork, creativity, ambition, and a proactive, self-motivated attitude. English fluency is required; Dutch is not required . Funding and conditions: the position is fully funded for 4 years and includes a monthly salary of €3,059–€3,881 , plus 8% holiday allowance and 8.3% year-end bonus . Additional benefits include a pension scheme, leave benefits, training support, relocation support, tax benefits for internationals, and access to campus facilities. Application window: the post lists a deadline of 31 May 2026 , while the full vacancy text also notes that the position remains open until filled. Applicants should apply online through the official TU/e portal and upload a motivation letter, CV with publications and two references, and BSc/MSc transcripts.