Saturday, June 17, 2023

[DMANET] 1-Year Postdoctoral Researcher Position in Graph theory starting Fall 2023.

The [ https://team.inria.fr/coati/ | COATI Group ] at [ https://www.i3s.unice.fr/ | I3S Laboratory ] (Sophia Antipolis, France) has an open

1-year Postdoctoral Researcher position in Graph Theory in starting in Fall 2023.

Interested candidates are invited to apply preferably by June 30th, 2023.

Applications review will start July, 1st, 2023. The offer will remain open until filled.

Applications should be made via the dedicated website.

https://emploi.cnrs.fr/Offres/CDD/UMR7271-VIVROS-045/Default.aspx

Interested candidates should feel encouraged to reach out to Frédéric Havet <frederic.havet@inria.fr> informally. He will be very happy to respond to informal inquiries about any aspect of the position, from technical ones to ones about life in Sophia Antipolis.

Thanks for forwarding this offer to potentially interested candidates.

Research programme :

Directed graphs (digraphs for short) are naturally used to model many real-world problems. For example, many graphs modelling networks are by essence directed. This is the case for the web graph (its vertices are the web pages and there is an arc from a page to another if the first one points towards the second), the Twitter graph or Facebook. To address those problems, we need to have a better understanding of structural and algorithmic aspects of digraphs.

The post-doc will follow the line of the ANR Digraph project whose objective is to make some advances on digraph theory in order to get a better understanding of important aspects of digraphs and to have more insight on the differences and the similarities between graphs and digraphs. In particular, we expect the candidate to consider various graph colouring theorems and investigate whether corresponding statements for symmetric digraphs and dicolouring generalize to digraphs and if they can be improved for special classes of digraphs like oriented graphs. Moreover, for each polynomial-time algorithm solving a graph colouring problem, it should be studied whether there exists a polynomial-time algorithm for solving the corresponding dicolouring problem for digraphs and some special classes of digraphs.

Requirements :

· Be interested in the overall project as stated above.

· Have or are about to complete a PhD in graph theory, graph algorithms, or a related field.

Timeline :

Applications review will start July, 1st, 2023.

The offer will remain open until filled.

Best regards,

Frédéric Havet


**********************************************************
*
* 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/
*
**********************************************************