Supervisor: prof. Mark de Berg
Application website: https://www.tue.nl/en/working-at-tue/vacancy-overview/phd-in-computational-geometry.
Application deadline: May 2, 2016.
THE PROJECT
-----------------
The project focuses on fundamental algorithmic questions on geometric networks and, in particular, on geometric intersection graphs: graphs whose nodes correspond to disks or other objects in the plane and that have an edge between two nodes if the corresponding objects intersect. Such graphs have been used, for instance, to model sensor networks. Geometric intersections graphs are a generalization of planar graphs, and the goal of the project is to generalize results on planar graphs to intersection graphs. In particular, we wish to study generalizations of the famous Planar Separator Theorem, and investigate how such generalizations can be used to obtain efficient algorithms for geometric intersection graphs.
BEING A PHD STUDENT AT TU EINDHOVEN
------------------------------------------------------
As a PhD student working on the project, your main task will be to perform research, in close collaboration with your supervisor (prof. Mark de Berg) and possibly other PhD students. This also entails participating in international conferences and workshops to present your results. Part of the project will be done in collaboration with prof. Kisfaludi-Bak (Aalto University, Finland). 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, algorithms for massive data, geo-visualization, and computational social choice; 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. Eindhoven is a pleasant city, and the university is very close to the train station and the city center.
JOB REQUIEREMENTS
----------------------------
- A master's degree (or an equivalent university degree) in computer science or mathematics, with a strong background in algorithms.
- A passion for research and algorithms theory
- An interest in acting as a teaching assistant in algorithms-related courses
- Fluent in spoken and written English (C1 level).
WHAT WE OFFER
----------------------
- 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 <https://www.tue.nl/en/working-at-tue/why-tue/conditions-of-employment>, 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.
HOW TO APPLY
-------------------
All applications should be done through the TU/e application website; please visit https://www.tue.nl/en/working-at-tue/vacancy-overview/phd-in-computational-geometry. The application deadline is May 2, 2016.
QUESTIONS?
-----------------
If you have questions about the position or the project, please contact prof. Mark de Berg (M.T.d.Berg@tue.nl)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* 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/
*
**********************************************************
Posts
