运筹Offer是运筹OR帷幄社区旗下的留学申请、求职资讯平台，聚焦运筹学、大数据、AI等领域，内容涵盖企业/高校招聘、职场/申请经历分享。
About the position
Senior Research Associate on New Approaches to Approximability of Satisfiable Problems
Department of Computer Science, Parks Road, Oxford
Senior Research Associate on New Approaches to Approximability of Satisfiable Problems
Fixed-term contract for 12 months starting in January 2026
Grade 08RS: £48,235-£57,255 per annum inclusive of Oxford University weighting
Potential to under fill at grade 07RS: £38,674-£46,913 per annum inclusive of Oxford University weighting
The Department of Computer Science has a new opening for Postdoctoral Researchers on New Approaches to Approximability of Satisfiable Problems. The post holder will work with the Principal Investigator, Professor Standa Zivny to investigate:
• computational complexity of constraint satisfaction problems (CSPs), and
• combinatorics related to CSPs.
The goal of this project is to investigate structural properties of CSPs, develop novel approaches for proving hardness, and devise new algorithms.
You will be expected to conduct individual research and develop research questions, regularly write research articles at a national level for peer-reviewed journals, agree clear task objectives, organise, and delegate work to other members of the team, and share responsibility for shaping the research group’s plans.
This post is based at the Department of Computer Science and on-site working is required. Remote working is possible in agreement with Professor Standa Zivny.
What We Offer
As an employer, we genuinely care about our employees’ wellbeing and this is reflected in the range of benefits that we offer including:
• An excellent contributory pension scheme
• 38 days annual leave (pro-rata for part-time jobs)
• A comprehensive range of childcare services
• Family leave schemes
• Cycle loan scheme
• Discounted bus travel and Season Ticket travel loans
• Membership to a variety of social and sports clubs
Requirement
You will have a doctoral degree in Computer Science or related mathematical discipline together with a strong publication record and familiarity with the existing literature in the area of algorithms, or complexity, or combinatorics. Knowledge of mathematics relevant to the study of constraint satisfaction, postdoctoral experience, and experience working in collaborative environments is desirable but not essential.
Application date
The closing date for applications is 12 noon (UK time) on Wednesday 17 September 2025.
How to apply
https://my.corehr.com/pls/uoxrecruit/erq_jobspec_version_4.display_form?p_company=10&p_internal_external=E&p_display_in_irish=N&p_process_type=&p_applicant_no=&p_form_profile_detail=&p_display_apply_ind=Y&p_refresh_search=Y&p_recruitment_id=181228
海外硕博申请咨询
如果你想咨询申请运筹学海外硕博事宜，请扫描以下二维码或者添加微信号：or_offer 联系我们的工作人员，添加请修改备注为：海外硕博申请咨询！
微信公众号后台回复
实习：获取实习岗位投递方式
校招：获取校招岗位投递方式
社招：获取社招岗位投递方式
职场会客厅：获取职场相关直播链接和往期直播视频完整版
留学会客厅：获取留学直播链接和往期直播视频完整版
海外硕博申请：获取客服联系方式
求职群：获取加入【IT算法求职内推群】方式
留学群：获取加入【运筹学海外硕博申请群】方式