[Job-offers-cs] Postdoc and PhD positions in graph algorithms and complexity at KTH, Sweden

[Pekka Orponen]

-------- Forwarded Message --------
Subject: [DMANET] Postdoc and PhD positions in graph algorithms and 
complexity at KTH, Sweden
Date: Sun, 1 Dec 2019 17:22:46 +0100
From: Danupon Nanongkai <danupon at gmail.com>
To: dmanet at zpr.uni-koeln.de

Applications are invited for Postdoc and PhD positions in the group of 
Danupon Nanongkai at the Theoretical Computer Science department,  KTH 
Royal Institute of Technology, Stockholm, Sweden.


We are looking for people who want to work on one or more aspects of 
graph algorithms and complexity. Candidates who have strong interests in 
exploring the impact of the following techniques in the fields of graph 
algorithms are especially desired:

* optimization (e.g. submodular minimization, matroid theory, LP solvers),
* spectral algorithms (e.g. fast algorithms for computing maximum flow, 
sparsest cut, and tree embedding)
* traditional and fine-grained complexity,
* dynamic data structures,
* parallel and distributed algorithms, and
* communication complexity.

For more information and how to apply, please visit 
https://sites.google.com/site/dannanongkai/vacancies.