A PhD position is available at the University of Cologne, Germany, in
the DFG-funded project
“New Techniques and Improved Approximation Algorithms for Connectivity
Augmentation Problems”.
Scientific guidance: Felix Hommelsheim
Application link: https://jobportal.uni-koeln.de
Reference number: Wiss2606-06
Deadline: July 13, 2026
Project:
The project concerns the design and analysis of approximation algorithms
for connectivity augmentation problems and related questions in
survivable network design. The research is situated at the intersection
of combinatorial optimization, graph algorithms, and theoretical
computer science. The position is intended to lead to a doctorate.
Your profile:
We are looking for a highly motivated candidate with a strong background
in computer science, mathematics, or a related subject. Excellent
knowledge of algorithms and combinatorial optimization is expected.
Prior experience with approximation algorithms, graph algorithms,
discrete mathematics, or complexity theory is a strong asset.
The candidate should enjoy working on theoretical problems and be
motivated to conduct research both independently and collaboratively.
Our offer:
We offer a full-time doctoral research position at the University of
Cologne, fixed-term until September 30, 2029. The salary is according to
remuneration group 13 TV-L, provided the relevant requirements are met.
The position is embedded in the Department of Mathematics and Computer
Science at the University of Cologne, within the groups of Junior
Professor Kevin Schewior and Professor Christian Sohler. It offers a
stimulating scientific environment with opportunities for exchange,
collaboration, and participation in international conferences and workshops.
Interested?
The full advertisement of the position can be found here:
https://jobportal.uni-koeln.de
Please use the reference number Wiss2606-06. The application deadline is
July 13, 2026.
For inquiries or more information about the project, please contact
Felix Hommelsheim:
hommelsheim@cs.uni-koeln.de