The 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. The Research Fellow will join the Algorithms and Complexity Research Group at the School of Computing at 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 computationally feasible. We aim to understand how to exploit structure in order to construct efficient algorithms for classical optimization problems, such as coloring, clique and stable set problems.
The applicant should have a PhD (or close to completion) in Mathematics, Computer Science, or a similar subject, as well as research experience including, but not limited to, structural graph theory, combinatorial optimization and graph algorithms.
Further information about the post and instructions on how to apply can be found at
https://jobs.leeds.ac.uk/Vacancy.aspx?ref=EPSCP1132
Informal enquires can be sent to Kristina Vušković at k.vuskovic@leeds.ac.uk<mailto:k.vuskovic@leeds.ac.uk>.
Closing date: July 25, 2023
Start date: flexible
**********************************************************
*
* 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/
*
**********************************************************
Posts
