[DMANET] PhD position in Graph Algorithms and Parameterized Complexity at Chalmers University of Technology

The department of Computer Science and Engineering at Chalmers University of Technology welcomes application for a PhD position with a focus on graph algorithms and parameterized complexity. The student will be supervised by Dr. Esther Galby. The starting date is from 1st of July 2024 (negotiable).

The main goal is to study the complexity of graph modification problems. The ideal candidate should have a solid background in graph theory and some basic knowledge in 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=12806&rmlang=se

Questions about the position are welcome and should be directed to Esther Galby galby@chalmers.se
Application deadline: 21 May

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