More information can be found here:
https://www.lamsade.dauphine.fr/~monnot/index_fichiers/ListDiffAnglais_SujetPhd_2019
The candidate must have:
-A master degree either in mathematics or computer science, ideally with specialisation either in algorithms or combinatorial optimisation
-A good knowledge of complexity theory, approximation algorithms and graph theory
-Good knowledge of English (written and spoken)
The applications with the required documents must be sent to: jerome.monnot@dauphine.fr<mailto:jerome.monnot@dauphine.fr> and ararat.harutyunyan@dauphine.fr<mailto:ararat.harutyunyan@dauphine.fr> before April 15th.
The following documents must be attached to the application:
-A short letter of motivation
-A curriculum vitae;
-Transcripts (including that of the Master degree studies). Bachelors and Master's diplomas
-Two letters of recommendation if possible.
**********************************************************
*
* 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/
*
**********************************************************