[DMANET] PhD in algorithmic graph theory at Chalmers

The Department of Computer Science and Engineering at Chalmers University of Technology welcomes applications for a full-time PhD position with a focus on graph algorithms and parameterized complexity. The student will be supervised by Esther Galby. The starting date is negotiable, with a preferred date of September 1, 2025.
The main goal is to investigate the complexity of graph modification problems. The ideal candidate has a solid background in graph theory and some basic knowledge of parameterized algorithms and complexity.
More information regarding the position and application procedure can be found at https://www.chalmers.se/en/about-chalmers/work-with-us/vacancies/?rmpage=job&rmjob=13908&rmlang=UK
Questions about the position are welcome and should be sent to galby@chalmers.se<mailto:galby@chalmers.se>

Application deadline: 2 June, 2025

**********************************************************
*
* 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/
*
**********************************************************