National University in Canberra, to work on a government funded
project in combinatorial mathematics.
The suitable candidate will have a PhD and proven expertise in an
area of mathematics suitable for the intended project. Topics in
order of preference are:
1. Asymptotic enumeration of graphs or other combinatorial objects
2. Random graphs or similar
3. Graph isomorphism, graph generation, and related problems
Research will be supervised by Professor Brendan McKay.
The salary will be approximately $80,000 Australian (USD 81,000)
per annum before tax. More details on request.
The position is available immediately but could be held for a few
months if necessary. Continuation beyond 6 months depends on funding
and cannot be guaranteed at this time.
Since this is not an official advertisement there is no closing
date. However, for administrative reasons, an agreement needs to be
signed within a few weeks or the money might vanish.
Please send expressions of interest to:
Prof Brendan McKay
Research School of Computer Science
Australian National University
bdm@cs.anu.edu.au
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
