==========================================================================================
----------------------
PhD position in Graph Algorithms
----------------------
The Graph, Algorithms and Models of Computation research group at the Computer Science Laboratory of Orleans (LIFO)
of University of Orléans, France, has the financial support for a PhD position.
The position is for three years starting October 1, 2017 (standard french PhD support).
The successful candidate will be working under the supervision of Dr Mathieu Liedloff and Professor Ioan Todinca.
The application deadline is March 22, 2017.
----------------------
RESEARCH DESCRIPTION
----------------------
The main goal of this PhD project is to design exponential-time algorithms to solve NP-hard graph problems.
Indeed, we cannot expect polynomial worst-case time algorithms solving exactly such problems, except if P=NP.
Thus we aim at designing and analyzing algorithms with running-time O(c^n), where n is the instance size
and c is a (suitably small) constant. An exponential running-time is also unavoidable when we want to enumerate
an exponential number of objects (e.g., subset of vertices in a graph fulfilling some properties). Other
algorithmic approaches will be studied as well during the PhD project, especially parameterized algorithms.
----------------------
SALARY AND LOCATION
----------------------
The monthly gross salary is about 1760 euros. The PhD student will be located in Orléans in
the research group GAMoC (Graphs, Algorithms and Computational Models). The city of Orléans
is situated in the Center of France, 1 hour by train from Paris.
----------------------
REQUIREMENTS
----------------------
We are looking for highly motivated Ph.D. candidates, with a strong background
in construction and analysis of algorithms. Background in algorithmic graph theory is highly desirable.
Knowledge in discrete mathematics, complexity, computability and graph theory is appreciated.
Background in moderately exponential algorithms or FPT algorithms would be an asset.
The applicants must have a Master's degree in Computer Science or related fields.
English is a required language; French may be useful in every day life, teaching, etc.
----------------------
APPLICATION
----------------------
Applications (including detailed CV, examination results from last 2 years, letter of motivation, possibly letters of recommendation) should be send
to Dr. Mathieu Liedloff (Mathieu.Liedloff@univ-orleans.fr <mailto:Mathieu.Liedloff@univ-orleans.fr>) and Prof. Ioan Todinca (Ioan.Todinca@univ-orleans.fr <mailto:Ioan.Todinca@univ-orleans.fr>),
the supervisors of the PhD project.
The application deadline is March 22, 2017.
----------------------
CONTACT
----------------------
Mathieu Liedloff (Mathieu.Liedloff@univ-orleans.fr <mailto:Mathieu.Liedloff@univ-orleans.fr>)
Ioan Todinca (Ioan.Todinca@univ-orleans.fr <mailto:Ioan.Todinca@univ-orleans.fr>)
LIFO - Université d'Orléans
**********************************************************
*
* 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
