[Job-offers-cs] Two postdoc positions in algorithms and structural graph theory at the University of Warsaw

[Pekka Orponen]

The ERC project BOBR: Decomposition Methods for Discrete Problems, led
by Michał Pilipczuk at the Institute of Informatics of the University
of Warsaw, is seeking up to two candidates for post-doc positions.

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 October 1st and December 1st, 2024
(negotiable), and is for one year with a possible extension maximally
until March 31st, 2026. There are no teaching obligations. The monthly
salary (pre-tax) is around 12000 PLN (around 2725 EUR), which is more
than enough for a comfortable life in Warsaw.

Applications should be sent electronically, the deadline is June 17th,
2024. The full call, which in particular includes instructions on how
to apply, can be found here:
https://euraxess.ec.europa.eu/jobs/234807
https://euraxess.ec.europa.eu/sites/default/files/jobs/2024-05/bobr-postdoc-0424_eng.pdf