[DMANET] PhD scholarship in Krakow (graph theory, discrete geometry, algorithms)

Jagiellonian University in Krakow, Poland, is offering a 4-year PhD
scholarship position in the project "Colorings, cliques, and independent
sets in graph classes", in the Theoretical Computer Science research group (
https://www.tcs.uj.edu.pl) under the supervision of Bartosz Walczak.

The project aims at solving open problems concerning chi-boundedness,
polynomial chi-boundedness, the Erdos-Hajnal property, and computational
complexity of computing maximum independent sets in classes of graphs, with
particular focus on P_t-free graphs and geometric intersection graphs. A
detailed description of the project is available on request. We are looking
for candidates with solid background, interest, and preferably some
research experience in graph theory, discrete geometry, and algorithms.

As a formal requirement, the candidate should be admitted for the PhD
programme in computer science or mathematics by October 6, 2020. Details on
recruitment for the programme at Jagiellonian University can be found at:
https://science.phd.uj.edu.pl/en_GB/rekrutacja/rekrutacja-2020/2021

The scholarship amounts to 5000 PLN per month for up to 4 years. Additional
travel funds will be available.

The candidates should apply by email to Bartosz Walczak (
bartosz.walczak@uj.edu.pl), including their CV, transcripts, a description
of research interests, a reference letter or names of those that could
provide an opinion on the candidate, and a signed information on data
processing (https://bartoszwalczak.staff.tcs.uj.edu.pl/gdpr.pdf).
We encourage the candidates to apply at their earliest convenience;
applications received by September 20, 2020 will receive full consideration.

Please send me an email for any informal inquiries.

With best regards,
Bartosz Walczak

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