Parallelism" (Prof. Klaus Jansen) at the Department of Computer Science of
the Christian-Albrechts-University of Kiel, Germany, within the research
project
"Efficient polynomial time approximation schemes (EPTAS) for scheduling
and related optimization problems"
funded by the Deutsche Forschungsgemeinschaft (DFG). The position is for
three years (TV-L E 13) starting 1st October 2010 (exact date is
negotiable).
Applicants are required to have completed a diploma, master's degree, or
an equivalent degree in Computer Science or Mathematics and have a strong
interest in Theoretical Computer Science, particularly in algorithms and
complexity.
The position focuses on research in the following subjects:
- efficient approximation schemes for scheduling and knapsack problems
- approximation algorithms for linear and integer linear programming
- implementation of efficient polynomial time approximation schemes
- open questions regarding the bin packing problem
The university strives to increase the number of women in research and
teaching and would like to explicitly encourage women to apply for this
position. Female applicants will be given preference when qualifications
and suitability are equal or similar.
The university supports the employment of handicapped people. Hence,
handicapped applicants will be employed preferentially if they are
suitably qualified.
Please send your application including a detailed curriculum vitae, a list
of three references with email addresses as well as a statement of
research interests (at most one page) and copies of academic diplomas
before the deadline on the 30th July 2010 to:
Prof. Dr. Klaus Jansen
Department of Computer Science
University of Kiel
Christian-Albrechts-Platz 4
24118 Kiel, Germany
More information:
Prof. Klaus Jansen (kj@informatik.uni-kiel.de)
http://www.informatik.uni-kiel.de/en/theory-of-parallelism/
**********************************************************
*
* 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/
*
**********************************************************
Posts
