University in Krakow, Poland, is offering two postdoctoral positions in
research projects funded by the National Science Centre of Poland:
1) "Dimension and Boolean dimension of partial orders", PI Piotr Micek, and
2) "Colorings, cliques, and independent sets in graph classes", PI Bartosz
Walczak.
Starting date: between March and December 2024, up to agreement with the PI
Duration: 12 months
The position is full-time researcher with a monthly net salary of approx.
7400 PLN (which is more than enough for comfortable life in Krakow), with
no teaching obligations, and with a generous budget for travels and
visitors.
The projects concern:
1) structural, extremal, and algorithmic problems related to order
dimension and Boolean dimension; see
https://piotrmicek.staff.tcs.uj.edu.pl/call2023/abstract.pdf;
2) 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; see
https://bartoszwalczak.staff.tcs.uj.edu.pl/call2023/abstract.pdf.
Apart from the PIs, the Jagiellonian University in Krakow hosts an active
group of researchers in graph theory including Bartlomiej Bosek, Andrzej
Grzesik, Jakub Kozik, Jonathan Narboni, and a very strong group of
students. Our frequent collaborators within these projects are James Davies
(Cambridge), Gwenael Joret (Brussels), and William T. Trotter (Atlanta).
We expect the candidate, at the time of employment, to hold a PhD degree
received not earlier than in 2017 and to have an excellent background in
mathematics and computer science, in particular in one or more of the
following fields: structural graph theory, combinatorics of posets, graph
coloring, graph algorithms.
Applications should be sent to one or both of the following email addresses:
1) piotr.micek@uj.edu.pl for the project "Dimension and Boolean dimension
of partial orders"
2) bartosz.walczak@uj.edu.pl for the project "Colorings, cliques, and
independent sets in graph classes"
An application should include an overview of the background and scientific
achievements of the candidate, a list of the candidate's research works,
and a list of at most three experienced researchers that may serve as
references for the candidate. For a complete list of required documents
(same for both positions), see the official call:
1) https://piotrmicek.staff.tcs.uj.edu.pl/call2023/call.pdf
2) https://bartoszwalczak.staff.tcs.uj.edu.pl/call2023/call.pdf
Application deadline: 31 December 2023
**********************************************************
*
* 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
