<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<p>-------- Forwarded Message --------</p>
<div class="moz-forward-container">
<table class="moz-email-headers-table" cellspacing="0" cellpadding="0" border="0">
<tbody>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Subject:
</th>
<td>[DMANET] 1-Year Postdoctoral Researcher Position in
Graph theory starting Fall 2023.</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Sat, 17 Jun 2023 08:20:01 +0200 (CEST)</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Frédéric Havet <a class="moz-txt-link-rfc2396E" href="mailto:frederic.havet@inria.fr"><frederic.havet@inria.fr></a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Reply-To:
</th>
<td><a class="moz-txt-link-abbreviated" href="mailto:frederic.havet@inria.fr">frederic.havet@inria.fr</a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
<td>dmanet <a class="moz-txt-link-rfc2396E" href="mailto:dmanet@zpr.uni-koeln.de"><dmanet@zpr.uni-koeln.de></a></td>
</tr>
</tbody>
</table>
<br>
<br>
The [ <a class="moz-txt-link-freetext" href="https://team.inria.fr/coati/">https://team.inria.fr/coati/</a> | COATI Group ] at [
<a class="moz-txt-link-freetext" href="https://www.i3s.unice.fr/">https://www.i3s.unice.fr/</a> | I3S Laboratory ] (Sophia Antipolis,
France) has an open <br>
</div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">1-year Postdoctoral Researcher
position in Graph Theory in starting in Fall 2023. <br>
<br>
</div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">Interested candidates are invited
to apply preferably by June 30th, 2023. <br>
Applications review will start July, 1st, 2023. The offer will
remain open until filled. <br>
<br>
Applications should be made via the dedicated website. <br>
<a class="moz-txt-link-freetext" href="https://emploi.cnrs.fr/Offres/CDD/UMR7271-VIVROS-045/Default.aspx">https://emploi.cnrs.fr/Offres/CDD/UMR7271-VIVROS-045/Default.aspx</a>
<br>
<br>
Interested candidates should feel encouraged to reach out to
Frédéric Havet <a class="moz-txt-link-rfc2396E" href="mailto:frederic.havet@inria.fr"><frederic.havet@inria.fr></a> 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. <br>
<br>
Thanks for forwarding this offer to potentially interested
candidates. <br>
<br>
</div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">Research programme : <br>
<br>
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. <br>
</div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">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. <br>
<br>
<br>
Requirements : <br>
<br>
· Be interested in the overall project as stated above. <br>
· Have or are about to complete a PhD in graph theory, graph
algorithms, or a related field. <br>
<br>
</div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">Timeline : <br>
Applications review will start July, 1st, 2023. <br>
The offer will remain open until filled. <br>
<br>
</div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">Best regards, <br>
<br>
Frédéric Havet <br>
<br>
</div>
</body>
</html>