a Phd or postdoc level position in Theoretical Computer Science.
Potential areas of interest are
- database theory
- constraint satisfaction
- enumeration and counting algorithms
- computational complexity, in particular propositional proof complexity
and parameterised complexity
- knowledge compilation
- graph isomorphism
Key Dates:
- to receive full consideration apply by *Feb 1, 2026*
- informal inquiries are highly welcome and should be sent to Christoph
Berkholz via christoph.berkholz@tu-ilmenau.de
- more details about the position and link to the application portal are
available at
Best regards
Christoph Berkholz
--
Prof. Dr. Christoph Berkholz
Technische Universität Ilmenau
Fachgebiet Algorithmik
Tel: +49 3677 69-2783
Fax: +49 3677 69-1237
Email: christoph.berkholz@tu-ilmenau.de
Url: https://www.tu-ilmenau.de/algo
webex: https://tu-ilmenau.webex.com/meet/christoph.berkholz
Postanschrift / Postal address:
TU Ilmenau
Postfach 10 05 65
98684 Ilmenau
Germany
**********************************************************
*
* 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/
*
**********************************************************