Friday, October 31, 2014

[DMANET] Postdoc positions in Budapest (parameterized complexity & algorithms)

Postdoc positions are available at the Institute for Computer Science
and Control (Hungarian Academy of Sciences), Budapest, Hungary,
supported by the European Research Council (ERC) Starting Grant
PARAMTIGHT: "Parameterized complexity and the search for tight
complexity results" held by Dániel Marx. The goal of the project is to
systematically push the boundaries of algorithmic and hardness results,
mostly in the framework of parameterized complexity, with the aim of
obtaining tight results that give an optimal understanding of the
complexity of a problem.

The candidates should have (or expect to have shortly) a PhD degree in
Computer Science or related area; research experience at postdoctoral
level is of advantage. A successful candidate should have excellent
knowledge of algorithms and/or complexity, preferably in the setting of
parameterized complexity and fixed-parameter tractability. Strong
background in graph theory, combinatorics, constraint satisfaction,
approximation, or kernelization is of advantage.

The review of applicants will begin immediately and continue until the
positions are filled. Applications received by 15 November 2014 will
receive full consideration. Informal inquires by email (Dániel Marx, are welcome.

* Contributions to be spread via DMANET are submitted to
* 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.