by Michał Pilipczuk at the Institute of Informatics of the University
of Warsaw, is seeking a candidate for a post-doc position.
BOBR aims to explore connections between algorithm design (with a
particular focus on parameterized and approximation algorithms),
structural graph theory (particularly, graph decompositions), and
(finite) model theory (particularly, elements of the theory of
stability). Specific research directions are (1) the theory of sparse
and structurally sparse graphs, (2) dynamic data structures for
parameterized problems, (3) algorithms for problems in topologically
constrained graph classes, and (4) algorithmic and structural aspects
of graph classes defined by forbidding induced subgraphs. We expect
the candidates to have relevant background and research experience in
one or more of these areas.
The employment may start between between January 1st, 2025, and May
1st, 2025, while the ending date should be no later than March 31st,
2026. There are no teaching obligations. The monthly salary (pre-tax)
is around 12000 PLN (around 2760 EUR), which is more than enough for a
comfortable life in Warsaw.
Applications should be sent electronically, the deadline is December
13th, 2024. The full call, which in particular includes instructions
on how to apply, can be found here:
https://euraxess.ec.europa.eu/jobs/289104
https://euraxess.ec.europa.eu/sites/default/files/jobs/2024-11/SOBD11020242PA60-0936216.pdf
**********************************************************
*
* 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
