[Opt-Net] PhD Position(s) in Algorithm Engineering in Heidelberg

[Christian Schulz]

You  love  algorithms, their analysis and efficient implementation? You 
are about to or know somebody who graduates with an excellent Master’s 
degree and is looking for a PhD position? Then please read on:

The newly established research group with focus on algorithm engineering 
led by Christian Schulz at the University of Heidelberg, Germany, is 
inviting applications for two fully funded full-time positions of a

     PhD Student / University Assistant (m/f)

starting on October 1st, 2020 (the exact date is negotiable).
The initial contract length is two years, but an extension is highly 
expected.

Working Area:

A successful candidate will work under the supervision of Christian 
Schulz on the topics of algorithm engineering, parallel and distributed 
algorithms in particular for practical data reduction and graph 
partitioning problems. Further responsibilities as part of the position 
include the supervision of bachelor and master students and TA duties.

Requirements:

- Very good university degree (Master 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

Please forward this email to anyone who may be interested or send your 
application documents (cover letter,
CV, copies of certificates, a skype address for a possible interview and 
the contact information of
two references if available) to the address below. To receive full 
consideration, submit the documents via email
by July 15, 2020 to:

For further information please contact Christian Schulz:
email: christian.schulz at univie.ac.at

-- 
Priv.-Doz. Dr. rer. nat. Christian Schulz
Research Associate

Theory and Applications of Algorithms
Faculty of Computer Science
University of Vienna

Telephone: +43 1 4277 783 24
E-Mail: christian.schulz at univie.ac.at

Curriculum Vitae:
https://bit.ly/2Sf2fAK

Website:
https://schulzchristian.github.io/

Open Source:
# Compute High Quality Graph Partitions (Vertex-, Edge-based, Separators, Sequential, Parallel)
http://algo2.iti.kit.edu/kahip/

# High Quality Hypergraph Partitioning
https://github.com/kahypar/kahypar

# Generate Massive Graphs on Parallel Machines (such has BA, RHG, RGG, GNP, ...)
https://github.com/sebalamm/KaGen

# Fastest Minimum Cut Algorithm Out There
http://viecut.taa.univie.ac.at/

# Solve Huge Independent Set Problems
http://algo2.iti.kit.edu/kamis/

# Draw Large Graphs Exploiting Shared Memory Parallelism
http://algo2.iti.kit.edu/kadraw/

# Compute High Quality Modularity Graph Clusterings
http://vieclus.taa.univie.ac.at/

# Scalable Shared Memory Parallel Solver for the LP problem
http://algo2.iti.kit.edu/kalp/

# Compute High Quality Process Mappings
http://viem.taa.univie.ac.at/

# DMAX -- Data Reduction for Maximum Cut
http://algo2.iti.kit.edu/schulz/maxcut/

# Dynamic Reachability in Graphs
https://dyreach.taa.univie.ac.at/