Are you an early career researcher looking for your next challenge?
Do you have a background in graph theory?
Do you want to further your career in one of the UK’s leading research intensive universities?
This is an opportunity for a motivated researcher to work on the EPSRC grant EP/N019660/1 "Structure of Hereditary Graph Classes and Its Algorithmic Consequences". You will join the thriving Algorithms and Complexity Research Group at the School of Computing, University of Leeds, UK.
This project will focus on developing techniques for structural and algorithmic study of hereditary graph classes, with the aim of gaining insight into the boundaries of what is computationally feasible.
You will have an undergraduate or masters degree in Computer Science or a closely allied discipline, or equivalent research experience. You will also have research experience including, 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škovic, Leader of Algorithms and Complexity Research Theme
Tel: +44 (0)113 343 5443 or email: email@example.com