[DMANET] PhD position in Graph Algorithms and Parameterized Complexity at the IT University of Copenhagen

The Algorithms group at the IT University of Copenhagen welcomes applications for a PhD position with focus on graph algorithms and parameterized complexity. The position is funded by the project "Unifying Theories for Graph Modification Problems" led by Dr. Paloma Thomé de Lima. The starting date is from 1st of October 2023 (negotiable).

The project "Unifying Theories for Graph Modification Problems" (UNITMOD) is funded by the Independent Research Fund Denmark. Its main goal is to study the complexity of graph modification problems. The ideal candidate should have a solid background in algorithmic graph theory and some basic knowledge about parameterized algorithms and complexity.

More information regarding the position and application procedure can be found at PhD position in Graph Algorithms and Parameterized Complexity<https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=181582&DepartmentId=3439&MediaId=5>

Questions about the position are welcome and should be directed to Paloma T. Lima at palt@itu.dk
Application deadline: 9 June at 23:59 CEST

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