[DMANET] Postdoc position in Algorithms and Complexity at the LAMSADE University Paris-Dauphine (FRANCE)

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). This position is
available for the duration of 18 months possibly extended to 36
months. Starting date: January 2010.

The successful applicant must have the following essential
skills:
- Strong analytical background in algorithms and complexity and
in combinatorial optimization. Background in graph theory
should be a desired skill. In particular, the candidate should
have profound knowledge and research experience in exact
algorithms (with non-trivial complexity bounds) and in
polynomial approximation for NP-hard problems.
- Demonstrated research track and the ability to achieve
research results independently.
- Good communication skills are also necessary. The successful
candidate should have a PhD in computer science, or discrete
mathematics.

Interested applicants should e-mail curriculum vitae,
publication list, a cover letter expressing research interests
and areas, and the contact information for three references to
Vangelis Paschos (paschos@lamsade.dauphine.fr), before December
15th 2009.

The project will take place at the laboratory LAMSADE,
University Paris-Dauphine with more or less long research stays
at the laboratory IBISC, University of Evry (Paris) and at the
ESSEC Business School (Paris), both partners of the research
project TODO.

Contact:
Professor Vangelis Th. Paschos
LAMSADE
Université Paris-Dauphine

--
Vangelis Th. Paschos
LAMSADE, CNRS UMR 7024 and University Paris-Dauphine
Place du Maréchal de Lattre de Tassigny
75775, Paris Cedex 16
France
tel.: + 33 1 44 05 45 82
fax: + 33 1 44 05 40 91
http://www.lamsade.dauphine.fr/~paschos

**********************************************************
*
* 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/
*
**********************************************************