Whilst the above call is open to students in all areas, applications in the area of algorithms and complexity are welcomed. Available supervisors in this area at the School include:
* Dr Yiannis Giannakopoulos (algorithmic game theory, combinatorial optimization, probabilistic analysis of algorithms, computational complexity): https://yiannisgiannakopoulos.com/
* Prof David Manlove (combinatorial and graph algorithms, optimisation, matching problems): https://www.dcs.gla.ac.uk/~davidm/
* Dr Ciaran McCreesh (constraint programming, proof logging, parallel combinatorial search, algorithm engineering): https://ciaranm.github.io/
* Dr Sofiat Olaosebikan (graph algorithms, matching theory, optimisation, resource allocation in wireless networks): https://www.dcs.gla.ac.uk/~sofiat/
To be considered for a studentship at this round, your application must be received by *31 January 2024*. For more information about how to apply, see:
https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents
This web page includes information about the research proposal, which is required as part of your application.
Applicants are strongly encouraged to contact a potential supervisor and discuss an application before the submission deadline.
**********************************************************
*
* 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/
*
**********************************************************