[DMANET] PhD position in Algorithms and Extremal Combinatorics at the University of Bergen

There is a vacancy for a PhD Research Fellow in Algorithms and Extremal Combinatorics at the Department of Informatics of the University of Bergen, Norway. The position is for a fixed-term period of 3 years with the possibility of a 4th year with career-promoting work (e.g., teaching at the Department). The position is subject to financing by the Research Council of Norway (NFR) grant 355137 "From Extremal Combinatorics to Algorithms and Back".

This project bridges two foundational fields in computer science and mathematics: Theory of Algorithms and Extremal Combinatorics. By integrating these areas, the project seeks to develop innovative computational techniques and theoretical insights that extend the frontiers of both fields. It focuses on leveraging recent breakthroughs that combine algorithmic approaches with classical results in extremal combinatorics. The anticipated outcomes are twofold: advancing state-of-the-art parameterized and approximation algorithms to address challenging computational problems with high efficiency, and formulating new stability theorems in extremal combinatorics, driven by practical algorithmic applications.

For the position, we are looking for a researcher who will contribute to the success and visibility of the project. A successful candidate for this position will conduct research within algorithms and extremal combinatorics, as well as interact with other members of the algorithms research group. We are looking for excellent candidates with a background and experience in one or more of the following areas: graph algorithms, parameterized complexity, approximation algorithms, extremal combinatorics, structural graph theory, and related fields.

Qualifications and personal qualities

- Applicants must hold a master's degree or equivalent education in Mathematics (Combinatorics and/or Discrete Mathematics) or Computer Science (Algorithms). Master students can apply, provided they complete their final master's exam before 31.07.2026. It is a condition of employment that the master's degree has been awarded.)
- Competence in Discrete Mathematics and Algorithms is a requirement.
- Competence in Extremal Combinatorics and/or Parameterized Complexity is an advantage.
- A solid publication record at the top Computer Science conferences, such as STOC, FOCS, SODA, ICALP, ESA, or high-ranked journals, like TALG, JCTB, Combinatorica, or equivalent top venues, is an advantage.
- Applicants must be able to work independently and in a structured manner and demonstrate good collaborative skills.
- Applicants must have good written and oral English skills.
- Personal and relational qualities will be emphasized.
- Research experience, ambitions, and potential will also count when evaluating the candidates.

The application deadline is February 1, 2026.

For more details about the position and the application process, please see the official advertisement: https://www.jobbnorge.no/en/available-jobs/job/287363/phd-research-fellow-in-algorithms-and-extremal-combinatorics <https://www.jobbnorge.no/en/available-jobs/job/287363/phd-research-fellow-in-algorithms-and-extremal-combinatorics>

If you have any questions regarding the position, you can contact Petr Golovach at Petr.Golovach@uib.no
**********************************************************
*
* 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/
*
**********************************************************