|
Wednesday, May 26
|
|
8:30-8:55
|
Registration
|
|
8:55-9:00
|
Welcome
|
|
9:00-9:55
|
Invited talk. Juhani Karhumäki,
“Solution chains and independent systems of word equations” Abstract
|
|
10:00-10:20
|
Wlodzimierz Moczurad, “Directed figure codes with weak
equality” Abstract
|
|
10:25-10:45
|
Coffee break
|
|
10:45-11:05
|
R.E.L. Aldred, “Edge
proximity and matching extension in planar graphs” Abstract
|
|
11:10-11:30
|
Eva Jelínková,
“Forbidden induced subgraphs for graph
classes in Seidel's switching” Abstract
|
|
11:35-11:55
|
Harri Haanpää,
“Counting Hamiltonian Cycles in Bipartite Graphs” Abstract
|
|
12:00-12:20
|
Pradipta Mitra,
“Entrywise bounds for eigenvectors of
random graphs and applications” Abstract
|
|
12:25-13:30
|
Lunch
|
|
13:30-14:25
|
Invited talk. Nik Ruskuc,
“Substitution decompositions and pattern classes of
permutations” Abstract
|
|
14:30-14:50
|
Patric R. J. Östergård, “Switching Codes and
Designs” Abstract
|
|
14:55-15:15
|
Casper Thomsen, “On the number of zeros of
multiplicity r” Abstract
|
|
15:20-15:40
|
Vadim Lozin,
“Canonical antichains of permutations and
permutation graphs” Abstract
|
|
15:45-16:05
|
Coffee break
|
|
16:05-16:25
|
Einar Steingrímsson,
“Permutation patterns and the
Möbius function” Abstract
|
|
16:30-16:50
|
Vít Jelínek,
“Pattern avoidance in partial permutations” Abstract
|
|
16:55-17:15
|
Anders Claesson,
“Permutations in new guises” Abstract
|
|
17:20-17:40
|
Hilmar Haukur Guðmundsson, “Dyck paths,
standard Young tableaux, and pattern avoiding permutations” Abstract
|
|
17:45-18:05
|
Henning Ulfarsson, “Toric permutations and pattern avoidance” Abstract
|
|
|
|
Thursday, May 27
|
|
8:30-8:50
|
Lubomira Balkova
and Stepan Starosta,
“Generalizations of Sturmian words” Abstract
|
|
8:55-9:15
|
Arseny Shur,
“Graphs and Words: There and Back Again” Abstract
|
|
9:20-9:40
|
Steve Widmer,
“Permutation Complexity of Words” Abstract
|
|
9:45-10:05
|
Coffee break
|
|
10:05-11:00
|
Invited talk. Luca
Q. Zamboni, “A generalization of the Euclidean
algorithm generated by interval exchange transformations” Abstract
|
|
11:05-11:25
|
Niel de Beaudrap,
“On a class of restricted
unitary Cayley graphs” Abstract
|
|
11:30-11:50
|
Lars Eirik Danielsen,
“On graphs preserved by edge local complementation” Abstract
|
|
11:55-12:15
|
Oloff de Wet, “Simple
construction of nonisomorphic graphs” Abstract
|
|
12:20-13:00
|
Lunch
|
|
13:00-…
|
Excursion
followed by the conference dinner
|
|
|
|
Friday, May 28
|
|
8:30-8:50
|
Freyja Hreinsdóttir,
“Binomial Edge Ideals” Abstract
|
|
8:55-9:15
|
Martina Kubitzke, “NBC
bases for broken circuit complexes of matroids”
Abstract
|
|
9:20-9:40
|
Pekka Lampio,
“Classification of difference matrices over cyclic groups” Abstract
|
|
9:45-10:05
|
Coffee break
|
|
10:05-11:00
|
Invited talk. Christian
Krattenthaler, “Non-crossing partitions for
reflection groups” Abstract
|
|
11:05-11:25
|
Kathrin Vorwerk,
“Connectivity of chamber graphs of finite buildings” Abstract
|
|
11:30-11:50
|
Mahdad Khatirinejad,
“Vertex-colouring edge-weightings with two
edge weights” Abstract
|
|
11:55-12:15
|
Dejan Delic,
“Homomorphism Testing Strategies For Oriented Trees” Abstract
|
|
12:20-13:30
|
Lunch
|
|
13:30-14:25
|
Invited talk. Magnús M. Halldórsson,
“How well do graphs capture wireless interference?” Abstract
|
|
14:30-14:50
|
Milos Stojakovic,
“How fast can Maker win?” Abstract
|
|
14:55-15:15
|
Helge Tverberg,
“A Lovasz-type lemma, applied to Brooks'
theorem for list colouring” Abstract
|
|
15:20-15:40
|
Niklas Eriksen,
“Great expectations---gene order rearrangement made (sort of)
easy” Abstract
|
|
15:45-16:05
|
Coffee break
|
|
16:05-16:25
|
Torleiv Kløve,
“On B[λ](q) sets” Abstract
|
|
16:30-16:50
|
Jörgen Backelin, “Multinomial expressions summation
asymptotic approximations of Laplace
type” Abstract
|
|
16:55-17:15
|
Robson da Silva, “A Franklin-like proof for an
identity” Abstract
|
|
17:20-17:40
|
Jose Plinio Santos, “Combinatorial
interpretation as two-line array for the Mock Theta Functions” Abstract
|
|
17:45-18:05
|
Chiang Kao, “The quadratic assignment problem with
imprecise data: The case of job assignment requiring coordination” Abstract
|
