offering a postdoctoral position in the Theoretical Computer Science
Department at the Jagiellonian University in Krakow, Poland (
www.tcs.uj.edu.pl).
Period: 12 months
Starting date: between September 1 and October 1, 2023
Application deadline: January 18, 2023
The project concerns chi-boundedness, polynomial chi-boundedness,
Erdos-Hajnal property, and complexity of computational problems in graphs
classes, with particular focus on geometric intersection graphs and graphs
with excluded induced subgraphs.
The candidate is expected to hold a PhD degree awarded no earlier than in
2016 and to have an excellent background in graph theory.
Detailed call and the list of required documents:
https://bartoszwalczak.staff.tcs.uj.edu.pl/call.pdf
Please submit the application or any further inquiries to:
Bartosz Walczak (bartosz.walczak@uj.edu.pl)
**********************************************************
*
* 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/
*
**********************************************************
Posts
