<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] Post-Doc Position in Algorithm Engineering</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Mon, 18 Oct 2021 11:41:12 +0200</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Christian Schulz
<a class="moz-txt-link-rfc2396E" href="mailto:christian.schulz@informatik.uni-heidelberg.de"><christian.schulz@informatik.uni-heidelberg.de></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>
You love algorithms, their analysis and efficient implementation?
You are about to or know somebody who will get their PhD soon and
is looking for a Post-doc position? Then please read on:<br>
<br>
We are looking for a highly motivated and bright applicant with a
strong expertise and interest in graph and network algorithms in
particular, and in theoretical computer science in general, to
join the Algorithm Engineering Group Heidelberg at Heidelberg
University. We are inviting applications for a full-time PostDoc
position starting on January 1st, 2021 (the exact date is
negotiable). The successful candidate has completed a PhD thesis
in the scalable algorithms or a related area in computer science
or mathematics and has demonstrated independence in conducting
research and presenting scientific ideas, supported by
publications in international top-tier peer-reviewed conferences
and journals.<br>
<br>
Our group tackles a broad spectrum of scalable graph algorithms in
particular in the context of very large inputs. In general, our
research is based on five pillars: multilevel algorithms,
practical kernelization, parallelization, memetic algorithms as
well as dynamic algorithms that are highly interconnected. To this
end, our group engineers algorithms that improve known methods in
practice. Typically, we release the techniques and algorithms
developed as easy-to-use open source software. Examples include a
widely used library of algorithms for graph partitioning, graph
drawing, (weighted) independent sets, hypergraph partitioning,
graph clustering, graph generation, minimum cuts, process mapping
and many more.<br>
<br>
Working Area:<br>
A successful candidate will work under the supervision of Prof.
Dr. Christian Schulz in the broad area engineering scalable
(graph) algorithms. The position comes with a lot of flexibility
as well as teaching requirements. We expect a research and a
teaching agenda from a successful applicant. He or she is also
given the possibility to carry out a Habilitation.<br>
<br>
Requirements:<br>
- Very good university degree (PhD or equivalent) in computer
science or a related field<br>
- Solid skills in software development and in the theoretical
analysis of algorithms (evidenced by your thesis or relevant
courses); knowledge in combinatorial algorithms and linear algebra
is particularly desirable<br>
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects<br>
- Knowledge in parallel programming (in particular MPI) is a plus,
but no requirement<br>
<br>
Heidelberg University offers excellent conditions for
undergraduate, graduate, and PhD students. As part of the
university we pursue a non-discriminatory employment policy and
value equal opportunities, as well as diversity
(<a class="moz-txt-link-freetext" href="https://www.uni-heidelberg.de/diversity/">https://www.uni-heidelberg.de/diversity/</a> The university lays
special emphasis on increasing the number of women in senior and
in academic positions. Given equal qualifications, preference will
be given to female applicants.<br>
<br>
Please *forward this email to anyone who may be interested* or
send your application documents (cover letter, CV, copies of
certificates, research agenda, teaching agenda, two references
that we can contact for letter of recommendations) to the address
below. To receive full consideration, submit the documents via
*email* by November 15th, 2021 to:<br>
<br>
Univ.-Prof. PD. Dr. Christian Schulz<br>
<br>
Algorithm Engineering<br>
Heidelberg University<br>
Telephone: +49 (0) 6221 54- 14342<br>
E-Mail: <a class="moz-txt-link-abbreviated" href="mailto:christian.schulz@informatik.uni-heidelberg.de">christian.schulz@informatik.uni-heidelberg.de</a><br>
<br>
<br>
</div>
</body>
</html>