Jean-Sébastien Sereni (LIAFA, Paris) is available (http://liafa.jussieu.fr/~sereni/Heredia/).
Candidates should have a strong background in graph theory. The fields of research are
pretty open, with a preference for the areas of hereditary classes of graphs, algorithmic graph theory,
and extremal graph theory, the main areas of the grant.
The chosen candidate will join a team formed by Pierre Charbit, Louis Esperet and Nicolas Trotignon.
The candidate will also have the opportunity to collaborate with other members of LIAFA working in the area of
algorithmic graph theory. Moreover, there are opportunities to spend a part of the post-doc at G-Scop (Grenoble)
and/or LIP (ENS Lyon).
Informal inquiries as well as formal applications should be addressed to Jean-Sébastien Sereni
(Jean-Sebastien.Sereni@liafa.jussieu.fr).
The formal applications should include a CV with a list of publications and a list of
academic references.
The dates of appointments are flexible, starting from October 2011.
**********************************************************
*
* 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
