英國(guó)利茲大學(xué)2023年招聘博士后職位（圖論與算法）
利茲大學(xué)（University of Leeds），是一所位于英國(guó)利茲的公立綜合性研究型大學(xué)、世界百?gòu)?qiáng)名校，英國(guó)紅磚大學(xué)，是羅素大學(xué)集團(tuán)，世界大學(xué)聯(lián)盟、國(guó)際大學(xué)氣候聯(lián)盟、歐洲大學(xué)協(xié)會(huì)、英聯(lián)邦大學(xué)協(xié)會(huì)、中英大學(xué)工程教育與研究聯(lián)盟、RENKEI、N8大學(xué)聯(lián)盟、白玫瑰大學(xué)聯(lián)盟成員。利茲大學(xué)商學(xué)院獲AACSB、EQUIS和AMBA三重認(rèn)證，是全球商學(xué)院網(wǎng)絡(luò)、“一帶一路”商學(xué)院聯(lián)盟、中歐商校聯(lián)盟成員。
Research Fellow in Graph Theory and Algorithms
University of Leeds
Job Description
Are you an ambitious researcher looking for a challenge? Do you want to further your career in one of the UK’s leading research-intensive Universities?
This post is funded by DMS-EPSRC grant “The Power of Graph Structure”, that is led by Professor Kristina Vušković (University of Leeds) on the UK side and by Professor Maria Chudnovsky (Princeton University) on the USA side. You will join the thriving Algorithms and Complexity Research Group at the School of Computing at the University of Leeds and will collaborate with both PIs on the project research agenda.
This project focuses on developing techniques for structural and algorithmic study of hereditary graph classes, with the aim of gaining insight into the boundaries of what is computationaly feasible. We aim to understand how to exploit structure in order to construct efficient algorithms for classical optimization problems, such as colouring, clique and stable set problems.
Holding a PhD (or have submitted your thesis before taking up the role) in Mathematics, Computer Science or a closely allied discipline; you will have research experience in, but not limited to, structural graph theory, combinatorial optimization and graph algorithms.
To explore the post further or for any queries you may have, please contact:
Prof. Kristina Vušković, Leader of Algorithms and Complexity Research Theme
Tel: +44 (0)113 343 5443 or email: K.Vuskovic@leeds.ac.uk
