Two PhD Positions at TU Eindhoven

TLDR: Two PhD positions in Computational Geometry and Computational Topology at TU Eindhoven (TU/e)

Apply here by May 31: https://www.tue.nl/en/working-at-tue/vacancy-overview/phd-in-computational-geometry-and-computational-topology

The Project
Computational geometry and computational topology are areas of research focused on the design and analysis of algorithms for spatial data. These algorithms typically leverage geometric and topological structure present in the data to obtain efficient solutions. This project focuses on computing similarities between networks in a spatial context, such as networks embedded in the Euclidean plane, or on a terrain. We intend to develop topology- and geometry-aware graph edit distances, drawing inspiration from well-studied variants of the Fréchet distance between curves. The project is led by dr. Tim Ophelders and will employ two PhD students.

Tasks
As a PhD student working on the project, your main task will be to perform research, in close collaboration with your supervisory team and others involved in the project. Each PhD student will be guided by two advisors: dr. Tim Ophelders and prof. dr. Bettina Speckmann. Your tasks as a PhD student also include participating in international conferences and workshops to present your results. Besides working on your research project, you will also assist in some algorithms-related courses, as a teaching assistant (TA).

You will be working in the TU/e Algorithms cluster, one of the largest research groups world-wide that focuses on algorithms research. The cluster currently has 10 faculty members, whose research interests include computational geometry and topology, graph and FPT algorithms, moving object analysis, geo-visualization, and mobile agents; please visit https://algo.win.tue.nl/ for more details on the cluster. The cluster provides a lively and international environment for your research.

As a PhD student, you do need not speak Dutch: it is easy to get by with English, not only at the university (where all courses are taught in English) but also in everyday life.

Requirements
 - A master’s degree (or an equivalent university degree) in computer science or mathematics, with a strong background in algorithms.
 - A passion for research in computational geometry and computational topology
 - An interest in teaching algorithms-related courses
 - Fluency in spoken and written English (C1 level)

Employment Benefits
 - Full-time employment for four years, with an intermediate assessment after nine months. You will spend a minimum of 10% of your four-year employment on teaching tasks, with a maximum of 15% per year of your employment.
 - Salary and benefits (such as a pension scheme, paid pregnancy and maternity leave, partially paid parental leave) in accordance with the Collective Labour Agreement for Dutch Universities, scale P (min. € 3,059 - max. € 3,881), with a year-end bonus of 8.3% and annual vacation pay of 8%.
 - An excellent technical infrastructure, on-campus children's day care and sports facilities.
 - A tax compensation scheme (the 30% facility) for international candidates.

Applying
All applications should be submitted through the TU/e application website: https://www.tue.nl/en/working-at-tue/vacancy-overview/phd-in-computational-geometry-and-computational-topology
For full consideration, apply by May 31, 2026.

Questions
If you have questions about the position or project, please contact dr. Tim Ophelders ([email protected])

**********************************************************
*
*   Contributions to be spread via DMANET are submitted to
*
*                   [email protected]
*
*   Replies to a  message carried  on DMANET should NOT be
*   addressed to DMANET  but to  the original sender.  The
*   original  sender,  however,  is invited  to prepare an
*   update  of the replies  received and to communicate it
*   via DMANET.
*
*    DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
*      http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************