The Algorithms group of TU Eindhoven is offering two PhD positions, funded by the ERC Starting grant 'ReduceSearch'. For more information about the positions and how to apply, please visit:
https://jobs.tue.nl/en/vacancy/postdoc-position-reducesearch-475623.html
For your convenience I have copied the text from this website below.
-- Bart M. P. Jansen
==================
We offer a postdoc position in the ReduceSearch project, which aims to understand and expand the power of preprocessing.
-- What are we looking for --
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/ )
-- 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 research environment offers the postdoctoral researcher interesting possibilities for collaboration.
-- 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.
-- Job requirements --
The postdoctoral candidate is required to have a strong background in algorithms or computational complexity. Experience within the domain of parameterized complexity, kernelization, or constraint satisfaction problems is a plus. Candidates are expected to be fluent in English, both oral and in writing, and to have obtained a PhD degree.
The postdoctoral candidate will be expected to conduct independent research on topics relevant to the above agenda, to publish this research at conferences and journals, and to cooperate with the PhD candidates and principal investigator of the ReduceSearch project. The position does not have any required teaching duties. If the postdoctoral candidate wishes to further their development by assisting with the daily supervision of master- or PhD students, there will be opportunities to do so.
The position is available to start early 2019. It is offered for a period of two years, which may be extended.
-- Conditions of employment --
We offer:
A full-time temporary appointment for at least 2 years (with the possibility of an extension);
Salary in accordance with CAO of the Dutch universities (scale 10 € 2.709 - € 4.274 depending on experience;
The position comes with ample travel budget to engage in research activities abroad;
An extensive package of fringe benefits, including excellent technical infrastructure, child care, savings schemes, and excellent sports facilities, extra holiday allowance (8%, May), and end-of-year bonus (8.3%, December);
Foreign applicants may benefit from the 30% tax regulation in order to get a higher net salary, when granted.
-- Information and application --
If you are interested in the postdoc position and would like to apply, please send us your application by using the 'apply for this job' button at the top of this page. Your application must contain the following documents:
* A motivation letter describing your background and reasons for applying for this position.
* A 1-page research statement describing research interests and goals.
* A detailed CV including a publications list and overview of presentations at scientific meetings.
* Names and contact information of two academic references.
You can upload only 5 documents up to 2 MB each. Please send us your application before April 1st 2019; you can only apply using the "Apply now button" on the website of the Technical University of Eindhoven.
Screening of applicants will start as soon as applications are received and will continue until the positions have been filled.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* 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.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************