The Clermont Auvergne University (UCA) in Clermont-Ferrand, France,
offers an exciting opportunity to work as a PhD student at the forefront
of algorithmics and graph theory. This also includes a position for a
Master 2 internship before the PhD, starting in February/March 2025.
The successful candidate will design enumeration algorithms dedicated to
combinatorial graph problems. Transversal topics of the position could
also be approximation, parameterized complexity, and online algorithms.
We provide an exclusive (!) supervision. Supervisors are Prof. Vincent
LIMOUZY (https://dblp.org/pid/39/6870.html) and Dr. Pierre BERGE
(https://perso.isima.fr/~piberge/). The candidate will join the
laboratory LIMOS and in particular a young and talented team of
researchers in algorithmics : https://alcoloco.isima.fr/.
The position is fully paid (100%) and offered for a period of 3 years.
It will start from September/October 2025. The knowledge of French is
not necessary for the position : daily discussion can be achieved in
English with all colleagues. LIMOS is located on the Cezeaux campus, in
the suburbs of Clermont-Ferrand, with a very nice view on the
neighboring mountains. Clermont-Ferrand is part of the "chaine des
Puys", an impressive mountain range made up of old volcanos.
An excellent Masters degree (either already obtained or to be completed
soon) in (Applied) Mathematics, Computer Science, Operations Research,
Engineering or related field is required. Affinity with discrete
mathematics/graphs/algorithmics/complexity is preferred. Our objective
is to publish in the best (core rank A/A*) international
conferences/journals of theoretical computer science.
Interested individuals should submit their applications by December 18th
to the adress pierre.berge[at]uca.fr, including a short CV and at least
one recommandation letter. Late submissions will also be considered but
will not be priority.