The research group AlGCo (Algorithms Graphs and Combinatorics) has a PhD position available for the (flexible) Period 01/10/2018–30/09/2021
for scientific research on the fields of graph algorithms and graph mining problems.
Keywords of the related research domains are: structural graph theory, graph algorithms, parameterized algorithms, approximation algorithms,
community detection, clustering, graph similarity, graph modification problems.
Research enviroment: The AlGCo team has a strong background on the proposed research program. AlGCo is one of the leading research
teams in France in Parameterized Computation and havs an increasing interest to graph algorithms, kernelization, graph coloring, and
structural graph theory.
Candidate profile: The candidates should hold a MSc degree and should have a solid background in algorithms, complexity, and graph theory
and strong motivation to work on related areas, including parameterized computation and approximation algorithms. Moreover, english language
skills and knowledge/experience on programming in Python, C, and C++, will be appreciated.
The application, in English, must be send to paul@lirmm.fr or sedthilk@thilikos.info and should include:
Cover Letter, detailing your motivation and background for applying for the PhD project
Other information related to the candidate.
Detailed CV
Proof of diplomas and transcripts of records (BSc and MSc)
Other information for consideration, e.g. list of publications (if any),
Full contact details (Name, address, telephone & email) of 1-3 referees
**********************************************************
*
* 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
