[GDNET] Postdoc position in parameterized complexity and graph drawing at TU Wien, Austria

[Martin Nöllenburg]

*** Apologies for cross-posting ***

We announce one *postdoc position* as part of the project "Parameterized Graph
Drawing", which is hosted by the Algorithms and Complexity Group at TU Wien
(the Vienna University of Technology). The position will be jointly supervised
by Robert Ganian and Martin Nöllenburg.

We offer the possibility of working on exciting research projects in an
international research group, with ample travel funding, and the option of
collaborating not only within the project but also with other members of the
Algorithms and Complexity Group (https://www.ac.tuwien.ac.at/). There are
essentially no teaching obligations associated with the position and the
working language in the group is English. The starting date is flexible and
the position is offered for 2 years, with a possibility for extension. The
salary will follow the FWF's salary tables for Postdocs (see
https://www.fwf.ac.at/en/research-funding/personnel-costs/) and includes
standard bonuses in the form of a 13th and 14h salary, altogether allowing for
a convenient life in Vienna close to the city center.

Applicants are required to have (or soon receive) a PhD in Computer Science
(or a related field) and are expected to have a strong research record in
parameterized complexity and/or graph drawing, and a willingness to work in
the intersection of these two fields.

The application should include the candidate's CV, a list of publications, a
short motivation letter, and two letters of recommendation (all in a single
pdf file; alternatively, letters of recommendation may be sent directly by
their authors). The application should also mention possible starting dates
and should be sent to pgd at ac.tuwien.ac.at by May 3, 2023.

Informal enquiries and questions about the position are very welcome and
should also be sent to pgd at ac.tuwien.ac.at.

Best regards,
Martin Nöllenburg and Robert Ganian