graph algorithms, approximation algorithms, fixed-parameter
tractability, and geometric intersection graph theory within the
School of Computing at the University of Leeds.
A competition for funding and the application procedure is advertised
here: https://phd.leeds.ac.uk/funding/356-epsrc-doctoral-training-partnership-2024-25-computing
The details of the project can be found here:
https://phd.leeds.ac.uk/project/1854-efficient-algorithms-for-combinatorial-optimisation-problems-on-dense-graph-classes
The deadline for application is 19th February 2024.
Supervisor would be Dr. Dibyayan Chakraborty and Dr. Sebastian
Ordyniak. The selected candidate will be placed in the Algorithms and
Complexity group. See https://algorithms.leeds.ac.uk/.
Besides the advertised competition, there may be an additional opening
for a funded PhD position soon. Therefore, interested applicants are
encouraged to contact Dr. Dibyayan Chakraborty
(D.Chakraborty@leeds.ac.uk) and Dr. Sebastian Ordyniak
(s.ordyniak@leeds.ac.uk) with their CV. Interested candidates may
provide a short motivation letter (strictly not exceeding one page)
describing their research interests, background and (if possible) the
topic of their final year thesis. Applicants may contact Dr. Dibyayan
Chakraborty with any enquiries related to the position.
--
Dr. Dibyayan Chakraborty
**********************************************************
*
* 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
