This page is for local information; the main conference webpage is here.
All talks in room A0150, SITE building, uOttawa campus.
The nearest parking is the Mann garage, at the bottom-right of
this map. Pay-and-display
costs $12 for Friday and $6 for Saturday. For more details, see
Note that this is not lot "M", it is across the street from lot "M".
The nearest bus stop is Campus, marked "OC Transpo" towards the middle-left of the same map.
List of abstracts.
(Schedule current as of 14 May)
Problems and results in asymptotic combinatorics
Asymptotic results for the number of unsuccessful parkers in a one-way street
TP2 = Bruhat
The bichromatic number of a graph
Russian doll search for clique-type problems
Combinatorics and the hiring problem
Edge weightings that induce proper vertex colourings
Constructing regular self-complementary uniform hypergraphs
Skolem-type difference sets for cycle systems
|reception to follow|
|9:30–10:30||Peter J. Cameron
Bases for automorphism groups of graphs
Distinguishing infinite graphs
Some infinite families of non-Trojan SOMA(k,n)
The combinatorics of walking around: Strategies for exact lattice path enumeration
Periodic complementary binary sequences and combinatorial optimization algorithms
On a problem from Crux Mathematicorum
Sum-product problem: new generalisations and applications
New directions in multivariate public key cryptography
|after-conference gathering to follow|