Postdoctoral position in complexity theory, Budapest (Hungary)

Postdoc positions are available at the Computer and Automation Research Institute (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 hardess 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 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 earliest starting date is January 2012. The review of applicants will begin immediately and continue until the positions are filled. Applications received by 1 November 2012 will receive full consideration. For more information, see http://www.cs.bme.hu/~dmarx/job.html Or contact Dániel Marx at dmarx at cs.bme.hu