Dauphine on Communities in Networks: Detection of dense subgraphs and
partitions.
The ideal candidate has a keen interest and strong background in
combinatorial optimization, graph theory, exact complexity. Notions on
parameterized complexity and approximation algorithms are a plus.
He/she must have a Master degree or equivalent in these areas. He/she
should have excellent academic qualifications.
The position is fully funded for 3 years. There is no obligation to
teach, but it will be possible (with additional payment). Funding for
attending international conferences, summer schools, and visiting other
research centers will also be provided. Starting date is expected in
September-October 2022.
Any interested candidate is invited to email his/her application
(including CV, letter of motivation, academic record during the last two
years and possibly the name and email of reference persons) to
cristina.bazgan@dauphine.fr by April 20th, 2022.
**********************************************************
*
* 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
