| Sunday |
| 18:00–21:00 |
Registration |
| Monday |
|
| 08:00–08:45 |
Registration |
| 08:45–09:00 |
Opening remarks |
|
| | Chair: Östergård |
| 09:00–10:00 |
Colbourn
Covering arrays: asymptotics and construction algorithms |
| 10:00–10:25 |
Crnković
Regular Hadamard Matrices |
|
| 10:25–11:00 |
Coffee break |
|
| | Chair: Crnković |
| 11:00–11:25 |
Ó Catháin
Uncertainty principles and trades in Hadamard matrices |
| 11:25–11:50 |
Gnilke
Mosaics of combinatorial designs |
| 11:50–12:15 |
Lampio
On the classiffication of Butson-type Hadamard matrices |
|
| 12:15–13:30 |
Lunch break |
|
| | Chair: Colbourn |
| 13:30–14:30 |
Kotsireas
Periodic autocorrelation and compression |
| 14:30–14:55 |
Tabak
Normalized difference sets tiling in Zp |
| 14:55–15:20 |
Rukavina
Self-dual codes from quotient matrices of symmetric divisible designs with the dual property |
|
| 15:20–15:45 |
Coffee break |
|
| | Chair: Kaski |
| 15:45–16:10 |
Hoyte
Cycle decompositions of the complete graph with a hole |
| 16:10–16:35 |
González
Computing shortcut sets for plane Euclidean networks |
| 16:35–17:00 |
Martinsson
Most edge-orderings of Kn contain monotone Hamiltonian paths |
| 17:00–17:25 |
Kotlar
Rainbow matchings for sets of large matchings in bipartite graphs |
| Tuesday |
|
| | Chair: Aldred |
| 09:00–10:00 |
Brinkmann
Hamiltonian cycles in polyhedra |
| 10:00–10:25 |
Mazzuoccolo
Flows and bisections in cubic graphs |
|
| 10:25–11:00 |
Coffee break |
|
| | Chair: Andersen |
| 11:00–11:25 |
Toft
2-factors in graphs — history, solution, problems |
| 11:25–11:50 |
Burgess
Decompositions of complete graphs into bipartite 2-regular subgraphs |
| 11:50–12:15 |
Wedin
The freezing time of the Hegselmann–Krause model |
|
| 12:15–12:25 |
Group photo |
| 12:25–13:30 |
Lunch break |
| 14:00–18:00 |
Excursion |
| 19:00–22:00 |
Banquet |
|
| Wednesday |
|
| | Chair: Brinkmann |
| 09:00–10:00 |
Markström
Turán densities for graphs and 3-graphs |
| 10:00–10:25 |
Simanjuntak
Strong oriented graphs with largest directed metric dimension |
|
| 10:25–11:00 |
Coffee break |
|
| | Chair: Hollanti |
| 11:00–11:25 |
Johnsen
Hamming weights of almost affine codes and matroids |
| 11:25–11:50 |
Westerbäck
Combinatorial coding theory |
| 11:50–12:15 |
Freij-Hollanti
Hierarchical repairability and their weight enumerators |
|
| 12:15–13:30 |
Lunch break |
|
| | Chair: Johnsen |
| 13:30–13:55 |
Kaski
How proofs are prepared at Camelot |
| 13:55–14:20 |
Tamm
Information complexity and communication complexity |
| 14:20–14:45 |
Laaksonen
Constructing error-correcting binary codes using transitive permutation groups |
| 14:45–15:10 |
El Rouayheb
Private information retrieval from coded data |
|
| 15:10–15:35 |
Coffee break |
|
| | Chair: Toft |
| 15:35–16:00 |
Kokkala
The chromatic number of the square of the 8-cube |
| 16:00–16:25 |
Larsson
Speed and concentration of the covering time for structured coupon collectors |
| 16:25–16:50 |
Szöllősi
Enumeration of cospectral Seidel matrices |