<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 in graph theory at Jagiellonian
              University in Krakow</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
            <td>Thu, 12 Jan 2023 19:16:06 +0100</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
            <td>Bartosz Walczak <a class="moz-txt-link-rfc2396E" href="mailto:bartosz.m.walczak@gmail.com"><bartosz.m.walczak@gmail.com></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>
      The project "Colorings, cliques, and independent sets in graph
      classes" is<br>
      offering a postdoctoral position in the Theoretical Computer
      Science<br>
      Department at the Jagiellonian University in Krakow, Poland (<br>
      <a class="moz-txt-link-freetext" href="http://www.tcs.uj.edu.pl/">http://www.tcs.uj.edu.pl/</a>><br>
      Period: 12 months<br>
      Starting date: between September 1 and October 1, 2023<br>
      Application deadline: January 18, 2023<br>
      <br>
      The project concerns chi-boundedness, polynomial chi-boundedness,<br>
      Erdos-Hajnal property, and complexity of computational problems in
      graphs<br>
      classes, with particular focus on geometric intersection graphs
      and graphs<br>
      with excluded induced subgraphs.<br>
      <br>
      The candidate is expected to hold a PhD degree awarded no earlier
      than in<br>
      2016 and to have an excellent background in graph theory.<br>
      <br>
      Detailed call and the list of required documents:<br>
      <a class="moz-txt-link-freetext" href="https://bartoszwalczak.staff.tcs.uj.edu.pl/call.pdf">https://bartoszwalczak.staff.tcs.uj.edu.pl/call.pdf</a>><br>
      Please submit the application or any further inquiries to:<br>
      Bartosz Walczak (<a class="moz-txt-link-abbreviated" href="mailto:bartosz.walczak@uj.edu.pl">bartosz.walczak@uj.edu.pl</a>)<br>
      <br>
    </div>
  </body>
</html>