Logic List Mailing Archive

Postdoc in Algorithms and Complexity (Bergen, Norway)

POST DOC POSITION IN ALGORITHMS AT THE UNIVERSITY OF BERGEN, NORWAY

We are looking for an excellent post doc with a background in Algorithms 
and Complexity.

The position is available at the Department of Informatics at the 
University of Bergen and is financed by the Research Council of Norway 
through the project "Minimal Separators and Triangulations in Graphs - 
Algorithms and Applications". The project conducts basic research in graph 
algorithms, with an emphasis on topics including but not restricted to 
minimal separators of graphs, chordal graphs and related graph classes, 
tree decompositions and treewidth, minimal triangulations of arbitrary 
graphs and restricted graph classes, ordering strategies for reducing 
fill, bandwidth, and other related parameters.

The working environment will be the Algorithms Research Group at the 
Department of Informatics, University of Bergen. See the home page of the 
group at http://www.ii.uib.no/forskningsgrupper/algo/ . The preferred time 
of start is August-September 2005. Salary is roughly 372,000 NOK 
(approximately 45,000 EUR) per year before tax. There are no teaching 
duties, knowledge of Norwegian is not necessary.

Applications should contain the following: a cover letter including a 
summary of training and experience, CV, list of publications, and names 
and contact details of 3 referees.

APPLICATION DEADLINE IS MAY 07, 2005.

Please mark your application with reference 05/2834, and send it to

Institutt for Informatikk
Universitetet i Bergen
Postboks 7800
N-5020 Bergen, Norway

Please do not hesitate to contact Pinar Heggernes if you are interested
in this position or if you have any questions. Contact information can
be found at http://www.ii.uib.no/~pinar/