[DMANET] Post-Doc Position in Algorithm Engineering

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:

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.

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.

Working Area:
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.

Requirements:
- Very good university degree (PhD or equivalent) in computer science or
a related field
- 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
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
- Knowledge in parallel programming (in particular MPI) is a plus, but
no requirement

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 (https://www.uni-heidelberg.de/diversity/). 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.

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:

Univ.-Prof. PD. Dr. Christian Schulz

Algorithm Engineering
Heidelberg University
Telephone: +49 (0) 6221 54- 14342
E-Mail: christian.schulz@informatik.uni-heidelberg.de

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************