27ACCMCC

Detailed Program

Monday, Tuesday, Wednesday, Thursday, Friday

Sunday, 8th December

6:00pmRegistration
7:00pmWelcoming Reception

Monday, 9th December
8:00amRegistration
9:00amLecture Room 1
Welcome: Prof. Neil Page, Deputy Executive Dean, Faculty of Engineering, University of Newcastle
Invited Talk: Peter Eades: Relational visualisation
10:00amMorning Tea
 Lecture Room 1: Codes and Hadamard MatricesLecture Room 2: Graph Labelings I
10:30amAsha Baliga: Effect of shift-equivalence on self-dual codesRohan Cattel: Vertex magic total labelings of complete tripartite graphs
11:00amKen Finlayson: Hadamard matrices constructed via negacyclic matricesDiana Combe: Edge-magic total labellings of graphs over abelian groups
11:30amMasakazu Jimbo: Erasure-resilient codes from affine spaces 
12:00noonLunch Break
Lecture Room 3: Council Meeting of CMSA
1:00pmLecture Room 1
Invited Talk: Jerrold R. Griggs: Data security and concentrating sums of vectors
 Lecture Room 1: CryptographyLecture Room 2: Graph Diameters
2:00pmYing Miao: Combinatorial structures in threshold schemesRinovia Simanjuntak: On the structure of graphs of degree 4 and order close to the Moore bound
2:30pmRyoh Fuji-Hara: Secret sharing schemes with certain access structuresYuqing Lin: Optimization problems with respect to order, degree, and diameter for digraphs
3:00pmAndrew Clark: Simpler methods for generating better Boolean functions with good cryptographic propertiesMinh Hoang Nguyen: On mixed Moore graphs
3:30pmAfternoon Tea
 Lecture Room 1: Combinatorics ILecture Room 2: Graph Coloring
4:00pmIan Roberts: Some new problems on Sperner familiesJ. W. Moon: Bicoloured recursive trees and Eulerian numbers
4:30pmLynn M. Batten: Determining setsChristian Sloper: Broadcast-coloring of trees

Tuesday, 10th December
8:30amRegistration
9:00amLecture Room 1
Invited Talk: Dragos Cvetkovic: Graphs with least eigenvalue greater than -2
10:00amMorning Tea
 Lecture Room 1: Latin SquaresLecture Room 2: Random Graphs
10:30amFrank E. Bennett: Existence of HSOLSSOMs of type 2nu1Billy Duckworth: Large k-independent sets of regular graphs
11:00amChengxin Qu: Relations between homogeneous Boolean function and BIBD/PBIBDCatherine Greenhill: Generalised acyclic edge colourings of random regular graphs
11:30amMartin Grüttmüller: Completing partial latin squares with two prescribed diagonalsJulie Cain: Load balancing as a random graph process
12:00noonLunch Break
1:00pmLecture Room 1
Invited Talk: Ron Mullin: Natural involutions on F2[x] with connections to factorization and enumeration
 Lecture Room 1: Topological Graph TheoryLecture Room 2: Graph Covering
2:00pmAtsuhiro Nakamoto: 4-Regular graphs which quadrangulate both the torus and the Klein bottleKatsuhiro Ota: Path triple covers of graphs
2:30pmSang-Eon Han: Graph continuity and its applicationsKevin McAvaney: Tree coverings of graphs
3:00pmLecture Room 3: AGM of ICA
3:30pmAfternoon Tea
4:00pmLecture Room 3: AGM of CMSA

Wednesday, 11th December
8:30amRegistration
9:00amLecture Room 1
Invited Talk: Alex Rosa: k-factorisation of complete graphs
10:00amMorning Tea
 Lecture Room 1: Designs ILecture Room 2: Graph Decomposition
10:30amElizabeth J. Billington: Metamorphosis of a complete bipartite design into a cycle systemDarryn Bryant: A family of perfect 1-factorisations of complete bipartite graphs
11:00amPeter Jenkins: Embedding partial Dk(m)-designsHideaki Fujimoto: Balanced {C4,C6}-trefoil systems
11:30amSanpei Kageyama: Some series of block designs with nested rows and columnsKazuhiko Ushio: Balanced {C4,C5}-trefoil systems
12:00noonLunch Break
1:00pmExcursion to Nelson Bay

Thursday, 12th December
8:30amRegistration
9:00amLecture Room 1
Invited Talk: Ralph Stanton: Perfect bicoverings with maximal block length four
10:00amMorning Tea
 Lecture Room 1: Designs IILecture Room 2: Graph Labelings II
10:30amWilliam Palmer: Bhaskar Rao designs and dihedral groupsAndrew Blinco: On the cyclic decomposition of complete graphs into almost-bipartite graphs
11:00amAnne Street: Proportionally balanced designs: an updateKiki A. Sugeng: Sum graphs and k-optimum summable graphs
11:30amSven Hartmann: On self-intersecting resolvable twofold triple systemsLjiljana Brankovic: On the graceful tree conjecture
12:00noonLunch Break
1:00pmLecture Room 1
Invited Talk: Nick Wormald: Counting connected graphs inside-out
 Lecture Room 1: Latin Squares IILecture Room 2: Graph Theory I
2:00pmDiane Donovan: Constructing and deconstructing latin tradesTiang Poomsa-ard: The maximum number of edges of the diameter 3-critical graph in certain case
2:30pmIan D. Gray: From cycles and paths to kites and stars: generating new vertex-magic total labelings by mutationCharles Little: Even circuits of prescribed clockwise parity
3:00pmIan M. Wanless: Cycle switches in latin squaresJoe Ryan: Eccentric network iterations
3:30pmAfternoon Tea
 Lecture Room 1: Graph Theory II
4:00pmAndrei Kelarev: Labelled Cayley graphs and minimal automata
4:30pmSanming Zhou: Finite symmetric graphs with two-arc transitive quotients
7:00pmConference Dinner

Friday, 13th December
8:30amRegistration
9:00amLecture Room 1
Invited Talk: Mirka Miller: Moore graphs and beyond
10:00amMorning Tea
 Lecture Room 1: Combinatorics IILecture Room 2: Algorithms
10:30amIan Roberts: Extremal problems on finite setsYoshiaki Oda: Extended pyramidal tours of the traveling salesman problem
11:00amUwe Leck: On families of sets represented by subsetsHenning Fernau: Complexity of a matrix problem motivated by database theory
11:30amBrendan McKay: The asymptotic number of 0-1 matrices with given row and column sumsAndrew Solomon: Approximating reversal distance between unsigned circular permutations
6:00pmBBQs near Stockton Bowling Club
Survivors Party
© Copyright 2002
Site maintained by Richard Webber
Last Updated: 13 Dec 2002
Comments