We are looking for a (tenure track) assistant / associate professor in Discrete Optimization. A successful candidate is expected to work on one or more themes from: mathematical optimization (including computational integer programming, polyhedral approaches, robust optimization), data science/machine learning, algorithmic game theory, approximation, complexity theory, graph theory, (mathematics of) operations research, algorithms in dynamic environments.
We seek excellent candidates having strong research skills in one or more of the aforementioned fields. The position involves a balanced teaching load. Good teaching and communication skills to interact successfully with students, industry and academic partners are required.
We expect the candidate to:
actively engage in acquiring research grants, and to pursue third-party funding,strengthen collaboration both within the group/section and abroad, and to connect his/her research to existing initiatives (Data Science),participate in teaching courses to the bachelor and master students of the department, andbe willing to take up administrative responsibilities.The Combinatorial Optimization group currently consists of one professor, three assistant professors, a lecturer, and part-time professors. Within the Department, the group is part of the section on Discrete Mathematics. The group takes part in the bachelor and master programs of the department (both in mathematics and in computer science).
The group is active within the Dutch national research cluster DIAMANT. Within the DIAMANT cluster researchers from Dutch mathematical institutes collaborate in an algorithmic approach to algebra, discrete mathematics, logic and number theory. The theme is interpreted broadly, with special attention given to subjects on the interface with neighboring disciplines. The DIAMANT research group consists of about 50 associate and full professors. More information on DIAMANT can be found at
websites.math.leidenuniv.nl/diamant/index.php</p