ARC fellowship success
November 8th, 2013 by iwanlessCongratulations to Heiko Dietrich and David Wood for receiving DECRA and Future Fellowships respectively.
Monash Home | Blog Home | Discrete Mathematics Home
Congratulations to Heiko Dietrich and David Wood for receiving DECRA and Future Fellowships respectively.
Members of the group visited the exhibition Illuminations by Andrew Baird at the Australian Synchrotron. These portraits include one of a combinatorialist and member of our group, Arun Mani. In the portrait Arun is holding a matroid. Two members of the group, Arun’s PhD supervisior, Graham Farr and PhD student Rosalind Hoyte, can be seen viewing the portrait in this photo.
Recently, Graham Farr spoke about William Tutte and Norman Do spoke about Évariste Galois at the laborastory.
During July – August 2013, PhD student Adeline Langlois will be visiting from the LIP laboratory at ENS de Lyon, France. She is working with Ron Seinfeld on lattice-based cryptography and will give a seminar on “Classical hardness of learning with errors” to the group.
Congratulations to Michael Brand on the submission of his Ph.D. thesis. In what has become a tradition for the group, everyone accompanied Michael as he submitted.
Congratulations to David Wood whose paper “Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring” with Vida Dujmović and Pat Morin has been accepted to the 54th Annual Symposium on Foundations of Computer Science (FOCS 2013).
Ian Wanless is the organiser of the Design Theory Minisymposia at the 4th biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), to be held from June 10-13 at the St. John’s campus of the Memorial University of Newfoundland. Speakers include our very own Daniel Horsley and Doug Stones.
Welcome to Emily Marshall who is a Ph.D. student supervised by Mark Ellingham at Vanderbilt University in Nashville, Tennessee. Emily will be visiting us for two months, working on problems in graph minors and hamiltonicity.
Update: Emily’s visit produced the paper, “Circumference and pathwidth of highly connected graphs” with David Wood.
Congratulations to A/Prof Ian Wanless, who was recently appointed as an editor-in-chief of The Electronic Journal of Combinatorics.