Brendan McKay received his PhD from Melbourne University in 1980. After three years at Vanderbilt University, USA, he came to ANU in 1983. He has been Professor of Computer Science since 1998. He is a Fellow of the Australian Academy of Science and of the Australian Mathematical Society. He is author of about 155 articles in journals and conference proceedings.
Graph theory, algorithms for discrete structures, graph isomorphism problem, probabilistic combinatorics, asymptotic enumeration