Department of Software Engineering and Theoretical Computer Science
Technische Universität Berlin
2 PhD positions in Parameterized Complexity
Research Assistant (100% TV-L 13)
Two PhD positions are available in the DFG-funded Junior Research Group
"Efficient preprocessing for hard problems"
led by Stefan Kratsch at TU Berlin. Successful candidates will perform
research on parameterized complexity and kernelization, and related topics.
The main focus of research is on rigorous study of polynomial-time
preprocessing for hard combinatorial problems.
Both positions are fulltime for an intended length of 3 to 4 years, with an
initial contract period of 2 years. There are no teaching obligations. The
positions are available immediately. Starting salary is roughly 1800 Euros net
(includes mandatory health insurance; 3000 Euros gross).
The junior research group is associated with the "Algorithms and complexity"
group chaired by Prof. Rolf Niedermeier. (http://www.akt.tu-berlin.de/)
The group currently consists of 9 further PhD students and postdocs
and is hosting visiting professor Gerhard Woeginger from TU Eindhoven.
Berlin offers a strong scientific landscape including three universities.
Furthermore there are a DFG (German Research Foundation) research
training group, called "Methods for Discrete Structures" (MDS) and the DFG
research center MATHEON; these offer opportunities for joint research and
support for PhD students (e.g., meetings, lecture series, summer schools).
Besides sciences, Berlin offers a rich, multicultural living environment, that
should cater to most interests and hobbies.
Candidates must hold a master's degree (or equivalent) in computer science,
mathematics or a related area and should have a very good knowledge about
algorithms and complexity. Background in parameterized complexity and, e.g.,
algebra and probability theory as well as programming skills are beneficial.
Good communication skills and solid English writing skills are mandatory.
Knowledge of German is not required, but successful candidates will be
encouraged to learn some basics.
Interested applicants should send their application containing
- cover and motivation letter (please include your favorite/strongest field(s)
of theoretical computer science/mathematics)
- curriculum vitae
- copies of diplomas
- summary of master/diploma thesis (English, about 3 pages)
- names and email addresses of at least two referees, including the thesis advisor
- (optionally) complete thesis and any other scientific publications
by
December 1, 2012
to
Dr. Stefan Kratsch
skratsch@mpi-inf.mpg.de
www.mpi-inf.mpg.de/~skratsch
Applications arriving by December 1 will receive full consideration, however, the search remains open until the positions are filled.
Do not hesitate to contact skratsch@mpi-inf.mpg.de if you have any questions regarding the positions or your application.
Technische Universität Berlin
2 PhD positions in Parameterized Complexity
Research Assistant (100% TV-L 13)
Two PhD positions are available in the DFG-funded Junior Research Group
"Efficient preprocessing for hard problems"
led by Stefan Kratsch at TU Berlin. Successful candidates will perform
research on parameterized complexity and kernelization, and related topics.
The main focus of research is on rigorous study of polynomial-time
preprocessing for hard combinatorial problems.
Both positions are fulltime for an intended length of 3 to 4 years, with an
initial contract period of 2 years. There are no teaching obligations. The
positions are available immediately. Starting salary is roughly 1800 Euros net
(includes mandatory health insurance; 3000 Euros gross).
The junior research group is associated with the "Algorithms and complexity"
group chaired by Prof. Rolf Niedermeier. (http://www.akt.tu-berlin.de/)
The group currently consists of 9 further PhD students and postdocs
and is hosting visiting professor Gerhard Woeginger from TU Eindhoven.
Berlin offers a strong scientific landscape including three universities.
Furthermore there are a DFG (German Research Foundation) research
training group, called "Methods for Discrete Structures" (MDS) and the DFG
research center MATHEON; these offer opportunities for joint research and
support for PhD students (e.g., meetings, lecture series, summer schools).
Besides sciences, Berlin offers a rich, multicultural living environment, that
should cater to most interests and hobbies.
Candidates must hold a master's degree (or equivalent) in computer science,
mathematics or a related area and should have a very good knowledge about
algorithms and complexity. Background in parameterized complexity and, e.g.,
algebra and probability theory as well as programming skills are beneficial.
Good communication skills and solid English writing skills are mandatory.
Knowledge of German is not required, but successful candidates will be
encouraged to learn some basics.
Interested applicants should send their application containing
- cover and motivation letter (please include your favorite/strongest field(s)
of theoretical computer science/mathematics)
- curriculum vitae
- copies of diplomas
- summary of master/diploma thesis (English, about 3 pages)
- names and email addresses of at least two referees, including the thesis advisor
- (optionally) complete thesis and any other scientific publications
by
December 1, 2012
to
Dr. Stefan Kratsch
skratsch@mpi-inf.mpg.de
www.mpi-inf.mpg.de/~skratsch
Applications arriving by December 1 will receive full consideration, however, the search remains open until the positions are filled.
Do not hesitate to contact skratsch@mpi-inf.mpg.de if you have any questions regarding the positions or your application.
Posts
