运筹Offer是运筹OR帷幄社区旗下的留学申请、求职资讯平台，聚焦运筹学、大数据、AI等领域，内容涵盖企业/高校招聘、职场/申请经历分享。
About the position
Project & Funding
• 3-year fixed-term position (possibility of 4th year with teaching duties)
• Financed by NFR grant 355137 “From Extremal Combinatorics to Algorithms and Back”
• Goal: merge algorithmic techniques with extremal combinatorics to advance parameterized / approximation algorithms and to prove new stability theorems.
You will join the algorithms research group and collaborate on topics linking:
graph algorithms
parameterized complexity
approximation algorithms
extremal & structural combinatorics
Advantages
Publications at top venues (STOC, FOCS, SODA, ICALP, ESA, TALG, JCTB, Combinatorica, etc.).
Background in extremal combinatorics and/or parameterized complexity.
Start date: negotiable (usually August–October 2026)
Enquiries about the scientific content: Petr Golovach Petr.Golovach@uib.no
Requirement
Master’s degree (or equivalent) in Mathematics (Discrete/Combinatorics) or Computer Science (Algorithms) awarded by 31 July 2026.
Strong competence in discrete mathematics & algorithms.
Ability to work independently and in teams; good oral & written English.
Personal and relational qualities will be emphasised.
Application date
Application deadline: 1 February 2026
How to apply
Full advert and electronic application portal:
https://www.jobbnorge.no/en/available-jobs/job/287363/phd-research-fellow-in-algorithms-and-extremal-combinatorics
海外硕博申请咨询
如果你想咨询申请运筹学海外硕博事宜，请扫描以下二维码或者添加微信号：or_offer 联系我们的工作人员，添加请修改备注为：海外硕博申请咨询！
微信公众号后台回复
实习：获取实习岗位投递方式
校招：获取校招岗位投递方式
社招：获取社招岗位投递方式
职场会客厅：获取职场相关直播链接和往期直播视频完整版
留学会客厅：获取留学直播链接和往期直播视频完整版
海外硕博申请：获取客服联系方式
求职群：获取加入【IT算法求职内推群】方式
留学群：获取加入【运筹学海外硕博申请群】方式