35ACCMCCThe 35th Australasian Conference on Combinatorial Mathematics & Combinatorial Computing5-9 December 2011
|
ACCMCC, the Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, is the annual conference of the Combinatorial Mathematics Society of Australasia. In 2011 it was held at Monash University in Melbourne, Australia. There were 117 registrants from 17 different countries around the world. The conference covered all areas of combinatorics in mathematics and computer science.
The invited speakers were:
-
Peter Cameron, Queen Mary University of London, UK, who talked on Combinatorial properties of transformation monoids.
-
Nick Cavenagh, University of Waikato, New Zealand, who talked on A comparative study of defining sets in designs and famous people from Hamilton!
-
Patric Östergård, Aalto University, Finland, who talked on A dynamic programming approach to counting Hamiltonian cycles in bipartite graphs.
-
Bridget Webb, Open University, UK, who talked on Infinite designs: the interplay between results in the finite and infinite case.
During the week there was a full social programme, as detailed here.
Related conference nearby: The International Workshop on Hadamard Matrices and their Applications was held at the Royal Melbourne Institute of Technology (RMIT University), November 28-30, 2011.