Current Job Openings

There currently is an open position for a PhD student in the project "Dynamic Algorithms Against Strong Adversaries (DynASoAr)" funded by the ERC Starting Grant of Assistant Professor Sebastian Forster from the Efficient Algorithms Group at the University of Salzburg, Austria. The main goal of this project is to design new dynamic algorithms with theoretical guarantees for fundamental graph problems.

PhD Position

To apply for this position, please send your CV, a short letter of motivation explaining your academic background, the (tentative) abstract of your Master's thesis, and a transcript of your courses and grades to Please include the words "application" or "PhD" in the subject line. The same email address can be used to send informal inquiries as well.

About the Project

The main goal of this project is to design new algorithms for dynamic graphs. In many cases, such as social networks or road networks, algorithms need to run on dynamically evolving graphs. To be precise, the algorithm should react quickly to edge insertions and deletions in the graph. The problems being studied are fundamental in nature, including, but not limited to, shortest path, maximal matching, minimum cut, maximum flow, spanners, and sparsifiers. Depending on the interests of the applicant, it is also possible to work on the computational complexity of these problems and try for hardness results.

The following selection of representative papers exemplifies which questions regarding dynamic graph algorithms will be studied in this project.

Back to homepage