We have a new opening for a student position.
A successful applicant is expected to implement and performing tests on fixed-parameter and approximation algorithms for the Steiner Tree problem, take a major role in preparing an entry to 3rd Parameterized Algorithms and Computational Experiments Challenge (PACE 2018), including synchronization of the contributions of other team members, and after the deadline of the competition, perform experiments on various approaches and report the results of the experiments in the form of a scientific publication.
Participating in the project gets you in touch with the state-of-the-art research in parameterized complexity, a rapidly developing subarea of theoretical computer science. The group at University of Warsaw is one of the leading research groups in parameterized complexity.
We expect from an applicant a strong background in discrete mathematics and algorithm design and strong programming skills. Strong track in previous participation in mathematical or programming contests (e.g., Topcoder, ACM ICPC, Codeforces) is a necessity.
The positions are not restricted to students of University of Warsaw. On the contrary, we welcome students from other Polish universities as well as from abroad. However, please note that a successful applicant is expected to meet with the PI and the team in person on a regular basis (at least once every two-three weeks).
The position comes with a 6-month stipend of 2500 PLN monthly for the period March – August 2018. A successful applicant needs to be a student during this period.
To apply, send your CV to the PI by 20th January 2018. Selected candidates will be invited for an interview held on 29th January 2018.