Tenure-track assistant Professor in Algorithms and Optimisation Department of Computer Science Faculty of Science
University of Copenhagen
Application deadline: 30 May 2017
Employment start: 1 November 2017

Webpage: http:////employment.ku.dk/all-vacancies/?show=896124

Email: mads@diku.dk

One year research position at a postdoctoral level (with a possible one year extension) is available at Algorithms research group (http://www.uib.no/rg/algo/), University of Bergen, Norway.

The successful candidate will work on “Multivariate Algorithms: New domains and paradigms” project funded by the Norwegian Research Council and led by Fedor Fomin. The objective of the project is t

Webpage: http://dmatheorynet.blogspot.no/2017/04/dmanet-postdoc-in-algorithms-bergen.html

Email: fomin@ii.uib.no

A one year postdoc position is available starting Summer/Fall 2017, with starting date negotiable and a possible extension to a second year. Applicants should be recent Ph.D.’s with interest in theoretical computer science. Research areas include but are not limited to pseudorandomness, complexity theory, and cryptogrpahy. The postdoc will also be able to take advantage of possible collaboration

Webpage: http://www.cs.jhu.edu/~lixints/postdoc.html

Email: lixints@cs.jhu.edu

Multiple positions as Assistant Professor or Full Professor; the call is open to candidates working in all areas of Computer Science including those working in Theory.

Webpage: http://http://www2.warwick.ac.uk/fac/cross_fac/dimap/

Email: G.Cormode@warwick.ac.uk

Associate Professor (or Professor) of Algorithms and Complexity Theory, to be held in the Department of Computer Science with effect from 1 Oct 2017. The successful candidate will also be appointed as Fellow and Tutor in Computer Science at Hertford College.

Webpage: http://www.cs.ox.ac.uk/news/1283-full.html

Email: rahul.santhanam@cs.ox.ac.uk

A 3-year Post-Doctoral Researcher is sought with expertise in graph algorithms and complexity, preferably also in parameterized algorithms and/or approximation algorithms. The research in this grant “Algorithmic Aspects of Temporal Graphs” will investigate various optimization problems on temporal (i.e. dynamically changing) graphs and explore the computational complexity of these new problems

Webpage: http://www.jobs.ac.uk/job/AXW261/post-doctoral-research-associate/

Email: george.mertzios@durham.ac.uk

A 3-year Post-Doctoral Research Associate is sought, with expertise in graph algorithms and complexity, preferably also in parameterized algorithms and/or approximation algorithms. The successful candidate will work at Durham University under the guidance of Dr. George Mertzios on the EPSRC-funded grant “Algorithmic Aspects of Temporal Graphs”. The research in this grant will investigate vario

Webpage: http://www.jobs.ac.uk/job/AXW261/post-doctoral-research-associate/

Email: george.mertzios@durham.ac.uk