In the context of a collaborative research project between National ICT
Australia (NICTA) and The University of New South Wales (UNSW), applications
are sought for the position of
one PhD candidate
to work on the computational complexity of resource allocation problems, with
a focus on parameterized complexity. The successful candidate will be jointly
supervised by the project leaders, Prof Toby Walsh at NICTA and Dr Serge
Gaspers at UNSW. She/he will be part of the Algorithmic Decision Theory
group,
http://www.cse.unsw.edu.au/~tw/adt/
To be eligible for this NICTA scholarship the candidate needs to be
admissible
to UNSW as a research candidate within the School of Computer Science and
Engineering (CSE). The expected start date is Semester 2 in 2013, i.e.,
around
the end of July 2013. More information on the NICTA scholarships is available
at http://www.nicta.com.au/nictascholarshipunsw
Interested applicants are invited to send an expression of interest to Prof
Toby Walsh <Toby.Walsh@nicta.com.au> and
Dr Serge Gaspers <sergeg@cse.unsw.edu.au>
including a CV, a research proposal (around 500 words), and recent
transcripts
by 15 February 2013. Please also organize for one reference letter/email
to be
sent to the same email addresses.
**********************************************************
*
* 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/
*
**********************************************************