We are seeking for a postdoctoral researcher for the research
project "Time vs. Optimality in Discrete Optimization" (TODO)
funded by the French Science Foundation (ANR).
The objective is the design of efficient algorithms for combinatorial
optimization problems satisfying both running time and precision
requirements.
[for more details on the project see http://todo.lamsade.dauphine.fr/]
* Required skills *:
- Strong analytical background in algorithms and complexity.
- Background in graph and/or scheduling problems.
- Demonstrated research track and the ability to achieve
research results independently.
The successful candidate should have a PhD in computer science,
or discrete mathematics.
Please send your application in a *single* PDF file containing an
academic CV, list of publications, letter of motivation, research
statement, the names of two references, and any other supporting
material no later than
June 25th, 2011
to
Evripidis Bampis (evripidis.bampis@lip6.fr)
and
Eric Angel (Eric.Angel@ibisc.fr)
The project will take place at the laboratory LIP6,
University Pierre et Marie Curie and at the laboratory
IBISC, University of Evry.
* Starting date *: September 2011.
* Duration *: 12 months.
**********************************************************
*
* 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
