Friday, January 5, 2024

[DMANET] Faculty, postdoc, and PhD opportunities in theoretical computer science and/or combinatorial optimization in Copenhagen and Lund

We would like to advertise a range of exciting openings in Copenhagen and Lund in theoretical computer science and/or combinatorial optimization at faculty, postdoc, and PhD level. The positions below are sorted in order of deadline dates.

Deadline Jan 10: Postdoc positions at the University of Copenhagen in theoretical computer science (http://www.jakobnordstrom.se/openings/Postdoc-UCPH-240110.html)

Deadline Jan 10: PhD positions at the University of Copenhagen in theoretical computer science and/or combinatorial optimization (http://www.jakobnordstrom.se/openings/PhD-UCPH-240110.html)

Deadline Jan 15: Postdoc position at the IT University of Copenhagen in parameterized algorithms (https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=181653)

Deadline Jan 26: Tenure-track assistant professorship at Lund University in the foundations of computer science, with a focus on logic and automated reasoning (http://www.jakobnordstrom.se/openings/AsstProf-Lund-240126.html)

Deadline Jan 31: Postdoc position at Lund University in theoretical computer science (https://lu.varbi.com/en/what:job/jobID:687553/)

Deadline Jan 31: PhD positions at Lund University in theoretical computer science (https://lu.varbi.com/en/what:job/jobID:687133/)

Informal enquiries about these positions are warmly welcome --- please see the respective announcements for contact details.


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