[DMANET] PhD in algorithms and optimization at IRIF in Paris

One PhD position is available under the supervision of Adrian Vladu (http://www.adrianvladu.org ), in the Algorithms & Complexity group of IRIF (https://www.irif.fr/en/equipes/algocomp/index ) at Université Paris Cité in Paris.

The goal is to develop fast and practical solutions for fundamental algorithmic problems. This involves designing faster algorithms for classical problems in combinatorial optimization (involving graphs, matchings, submodular functions, matroids, etc), and developing new theory relevant to modern machine learning. The mathematical toolkit is based on modern techniques from continuous optimization, and interferes with other interesting theory from convex geometry, probability and numerical linear algebra. See here for a list of related topics: https://www.irif.fr/users/vladu/projects

We seek candidates with a strong mathematical background, and a master's degree in Mathematics or Computer Science.

This position is fully funded. We provide great working conditions and generous travel support.

If you have any questions, do not hesitate to contact Adrian Vladu (vladu@irif.fr ).
**********************************************************
*
* 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/
*
**********************************************************