Some algorithms that solve NP-hard problems become 1000x faster by incorporating a preprocessing step that simplifies the input before solving it. Why, how, and when does this work? We offer 2 PhD positions in the ReduceSearch project, which aims to understand and expand the power of preprocessing.What are we looking for
TU Eindhoven is offering two PhD positions for talented and motivated students 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.
Since the increase in computing power due to hardware improvements (Moore's law) has come to an end, future advances must be based on developing better algorithms. Your work on this project contributes to that future!
The positions are supervised by dr. Bart M. P. Jansen (https://www.win.tue.nl/~bjansen/
)Being a PhD student in the Netherlands
In the Netherlands, every PhD student gets paid a salary; no additional grants are needed. Moreover, although PhD students sometimes take courses, there is no minimum requirement. Hence, PhD students are more like employees than like students. Indeed, the Dutch word for PhD student translates to "research trainee". The work of a PhD student may include assisting in courses of BSc or MSc programs of the department. This amounts to at most 20% of the time; the remaining time is spent on research and research-related activities. Foreign PhD students need not speak Dutch: it is easy to get by with English, not only at the university but also in everyday life.About the research environment
TU Eindhoven features a rich environment for algorithmic research. The Algorithms group headed by prof. Mark de Berg investigates (parameterized, approximation, and classic) algorithms for problems in computational geometry and graph theory. In addition, there is a group headed by prof. Bettina Speckmann focusing on Applied Geometric Algorithms. The Combinatorial Optimization group (prof. Frits Spieksma) focuses on problems in scheduling and optimization, and includes algorithmic experts dr. Jesper Nederlof and prof. Nikhil Bansal. In addition, TU Eindhoven is one of the four cornerstones of the NETWORKS project which investigates algorithmic and stochastic problems on complex networks. All combined, this offers the PhD candidate a stimulating research environment.About TU Eindhoven
TU Eindhoven (TU/e) is a mid-size technical university located in the heart of the high-tech industry in the Netherlands, named the Brainport region. Eindhoven is the fifth largest city in the Netherlands, and including suburbs it has about 420,000 inhabitants. TU/e is a highly ranked university both in research and education. Our training and research programs are highly regarded and we foster close relationships with companies, organizations and research institutes in the Brainport region and beyond. TU/e is a social and inspiring university with a fine culture. You'll quickly feel at home, surrounded by people who share your scientific ambitions. The TU/e currently has nine departments, with over 11,000 students in total.