Expires

01 Apr 2019

Institution

TU Eindhoven

Country

Netherlands

Description

TU Eindhoven is offering a 2-year postdoc position for a talented and motivated researcher with a strong interest in algorithms and complexity. The research is supported by ERC Starting grant "Rigorous Search Space Reduction" and is aimed at advancing the theory of algorithmic preprocessing. The project investigates questions such as: why does preprocessing lead to such large speedups for some NP-hard problems? How does a preprocessing algorithm reduce the search space of the follow-up algorithm? Which aspects of a problem input make it amenable to preprocessing? How can new preprocessing algorithms be developed that deliver speedups of several orders of magnitude? These questions are tackled using the framework of parameterized complexity and kernelization, and are asked for a diverse set of NP-hard problems concerning graphs, logic, and constraint satisfaction.

The position is supervised by dr. Bart M. P. Jansen (https://www.win.tue.nl/~bjansen/ )