Logic List Mailing Archive
Postdoctoral position in graph theory and applications of graph theory, University of Southern Denmark
POSTDOC AT THE UNIVERSITY OF SOUTHERN DENMARK
Expressions of interest are being sought for a post-doctoral fellowship in
graph theory and or applications of graph theory. The period will be one
year with a possibility to extend this by one more year. Candidates are
expected to have (or be about to complete) a Ph.D. degree and a well
documented record of research in graph theory or related areas of
operations research as e.g. integer programming.
We are seeking a candidate with excellent research potential and
preferably also an interest in working with problems that are related to
practical applications. In particular candidates with a strong background
in graph theory and interest in practical aspects of one or more of the
following areas of graph theory are sought:
Connectivity problems for graphs
Graph colourings and relations to scheduling
Routing problems on graphs with practical applications such as railway
planning and vehicle routing.
Efficient implementations of algorithms for connectivity and essential
problems such as shortest paths.
Approximation algorithms, exact algorithms and heuristics for graph
problems
Outstanding candidates in pure graph theory are also encouraged to apply.
The same goes for outstanding candidates from operations research with a
strong interest in working on problems from the areas above.
It is an essential requirement that the candidate must be fluent in both
written and spoken English.
The Danish research group on graph theory is well recognized all over the
world for its work on a wide variety of problems within graph theory.
Recently, headed by J. Bang-Jensen and J. Clausen, the group has also
started to work on problems of an applied character such as applied
aspects of connectivity, routing and scheduling problems. This includes
problems coming from the rail industry, scheduling production facilities
and manpower planning.
The post doc will be working at the Department of Mathematics and Computer
Science at University of Southern Denmark in Odense within the group of
professors J. Bang-Jensen and B. Toft. Depending on research interest it
is also expected that the post doc will collaborate with other members of
the Danish research group on graph theory at Aalborg University (L.D.
Andersen, L.K.J?rgensen and P. Vestergaard) and the Techincal University
of Denmark (J. Clausen, I.L. G?rtz and C. Thomassen)
Denmark offers very good working conditions and attractive salary and
taxation conditions for foreign researchers.
Further information about the departments involved in our research group
can be found at
http://www.imada.sdu.dk/
http://www.imm.dtu.dk/English.aspx
http://www.mat.dtu.sk/English.aspx
http://www.math.aau.dk/index_en.html
Further information about the position can be obtained from Professor J.
Bang-Jensen jbj@imada.sdu.dk or Professor J. Clausen jc@imm.dtu.dk
Expressions of interest should be addressed to Professor J. Bang-Jensen,
jbj@imada.sdu.dk.
Please send the following attachments:
1) CV including the date of obtaining the Ph.D. degree
2) list of publications with a summary of main results
3) describtion of research interests
4) email addresses of people who are willing to act as references. Letters
of reference may also be included in your mail
5) In case you have relevant experience, please add a short describtion of
practical skills such as ability to implement algorithms and knowledge
of software for Integer programming and (meta)-heuristics.
There is no official deadline, but we wish to fill the position as early
as possible after January 1st 2007 so immediate expressions of interest
are encouraged.
J?rgen Bang-Jensen, Professor, Dr. Scient, Ph.D.
Head of section for Industrial Applications of Computer Science
Department of Mathematics and Computer Science University of Southern
Denmark, Odense Campusvej 55, DK-5230 Odense M, Denmark
Email: jbj@imada.sdu.dk, URL: http://www.imada.sdu.dk/~jbj/
phone: +45 6550 2335, cellphone +45 6011 2335, fax: +45 6593 2691