<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 at University of Leeds, UK</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
            <td>Thu, 29 Jun 2023 06:56:32 +0000</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
            <td>Kristina Vuskovic <a class="moz-txt-link-rfc2396E" href="mailto:K.Vuskovic@leeds.ac.uk"><K.Vuskovic@leeds.ac.uk></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> <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>
      Applications are invited for a 9 month EPSRC funded Research
      Fellow post at the School of Computing, University of Leeds, UK.<br>
      <br>
      <br>
      The post is funded by DMS-EPSRC grant “The Power of Graph
      Structure”, that is led by Professor Kristina Vušković (University
      of Leeds) on the UK side and by Professor Maria Chudnovsky
      (Princeton University) on the USA side. The Research Fellow will
      join the Algorithms and Complexity Research Group at the School of
      Computing at University of Leeds, and will collaborate with both
      PIs on the project research agenda.<br>
      <br>
      <br>
      <br>
      This project focuses on developing techniques for structural and
      algorithmic study of hereditary graph classes, with the aim of
      gaining insight into the boundaries of what is computationally
      feasible. We aim to understand how to exploit structure in order
      to construct efficient algorithms for classical optimization
      problems, such as coloring, clique and stable set problems.<br>
      <br>
      The applicant should have a PhD (or close to completion) in
      Mathematics, Computer Science, or a similar subject, as well as
      research experience including, but not limited to, structural
      graph theory, combinatorial optimization and graph algorithms.<br>
      <br>
      Further information about the post and instructions on how to
      apply can be found at<br>
      <br>
      <br>
      <a class="moz-txt-link-freetext" href="https://jobs.leeds.ac.uk/Vacancy.aspx?ref=EPSCP1132">https://jobs.leeds.ac.uk/Vacancy.aspx?ref=EPSCP1132</a>><br>
      Informal enquires can be sent to Kristina Vušković at
      <a class="moz-txt-link-abbreviated" href="mailto:k.vuskovic@leeds.ac.uk">k.vuskovic@leeds.ac.uk</a><a class="moz-txt-link-rfc2396E" href="mailto:k.vuskovic@leeds.ac.uk"><mailto:k.vuskovic@leeds.ac.uk></a>.<br>
      Closing date: July 25, 2023<br>
      Start date: flexible</div>
    <div class="moz-forward-container"><br>
    </div>
  </body>
</html>