<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] Postdoc position on temporal graph algorithms
in Bordeaux</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Fri, 9 Jun 2023 10:23:57 +0200</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Arnaud Casteigts <a class="moz-txt-link-rfc2396E" href="mailto:arnaud.casteigts@u-bordeaux.fr"><arnaud.casteigts@u-bordeaux.fr></a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
<td><a class="moz-txt-link-abbreviated" href="mailto:dmanet@zpr.uni-koeln.de">dmanet@zpr.uni-koeln.de</a></td>
</tr>
</tbody>
</table>
<br>
<br>
Dear colleagues,<br>
<br>
The TEMPOGRAL ANR Project (LaBRI, LITIS, IRIF) is offering a
postdoc<br>
position for one or two years on the topic of *temporal graph<br>
algorithms* in the CS department of the University of Bordeaux
(LaBRI).<br>
<br>
Temporal graphs arise when the edges of a graph appear at certain
points<br>
in time. Classical graph problems can then be revisited to take
into<br>
account temporal aspects. The project aims at understanding the
nature<br>
of temporal graph problems and how to overcome their specific<br>
difficulties. A description is available at :<br>
<a class="moz-txt-link-freetext" href="https://www.labri.fr/perso/acasteig/tempogral/">https://www.labri.fr/perso/acasteig/tempogral/</a>><br>
The position is full-time and fixed-term for 12 months (possibly<br>
renewable for another 12 months), to start in September 2023 or
later.<br>
It is required to have defended a PhD thesis in computer science
or<br>
mathematics before starting. The net salary after taxes is between
2100€<br>
and 2500€ depending on the candidate experience. The gross salary
before<br>
taxes includes all the social benefits of a usual French contract<br>
(health benefits, free school for the kids, ...).<br>
<br>
The candidate is expected to have a solid background and a strong<br>
interest in any of the following topics: graph algorithms,
structural<br>
aspects of graphs, modeling of dynamic networks, distributed
algorithms,<br>
and computational complexity. Experience with temporal graphs is
not<br>
necessary but appreciated.<br>
<br>
The candidate must be able to interact (in English or French) on
some<br>
of the above topics with the members of the project (see the link
above)<br>
and possibly also with other local sympathizers from our group.<br>
<br>
Contact: <a class="moz-txt-link-abbreviated" href="mailto:Arnaud.Casteigts@labri.fr">Arnaud.Casteigts@labri.fr</a>. Contact by e-mail, with a CV,
a link<br>
to your PhD thesis, and some motivation text (either as a letter
or in<br>
the email).<br>
<br>
Application deadline: June 30, 2023.<br>
<br>
Best regards,<br>
Arnaud Casteigts<br>
<br>
</div>
</body>
</html>