Slides of the talks

• Onur Ağırseven, Grid-based graphs, linear realizations, and the Buratti-Horak-Rosa conjecture
• Robert Bailey, Distance-regular and strongly regular graphs from affine permutation groups
• Sara Ban, New extremal Type II Z₄-codes of length 64
• Anton Betten, Quartic curves with 63 Kovalevski points
• Zoltán L. Blázsik, Hypergraphs are 2-colorable if the 1-intersection graph of their hyperedges is bipartite
• Arne Botteldoorn, The minimal blocking sets of PG(2,11) with a non-trivial automorphism group
• Patrick Browne, Erdős–Ko–Rado type problems in root systems
• Marco Buratti, Heffter spaces and additive designs
• Andrea Burgess, Constructing solutions of the Hamilton-Waterloo Problem using row-sum matrices
• Carl Johan Casselgren, Brooks' theorem with forbidden colors
• Dean Crnković, Constructions of LCD subspace codes
• Peter Danziger, Colouring Kirkman triple systems
• Jan De Beule, Existence and non-existence of Cameron-Liebler k-sets in projective spaces
• Bart De Bruyn, Characterising ovoidal cones by their intersection numbers
• Doris Dumičić Danilović, On Steiner systems S(2,6,91)
• Mathieu Dutour Sikiric, High dimensional computation of fundamental domains
• Christian Elsholtz, New lower bounds on caps, and on progression-free sets in F_pⁿ and the integers
• Alena Ernst, Transitivity in finite general linear groups
• Raul Falcon, Heffter arrays over partial loops
• Giovanni Falcone, Goppa codes over hyperelliptic curves
• Mohammad Ghebleh, Reinforcement learning for graphs
• Marcus Greferath, Some thoughts on algebraic coding theory over the Boolean semifield
• Dirk Hachenberger, Ovoids and primitive normal bases for quartic extensions of Galois fields
• Daniel Hawtin, Transitive (q-1)-fold packings of PG_n(q)
• Thomas Honold, Maximum weight spectrum codes over finite fields and rings
• Daniel Horsley, Minimising the number of comparable sets
• Michael Kiermaier, The degree of functions in the Johnson and q-Johnson schemes
• Lukas Klawuhn, Designs in the generalised symmetric group
• Vedran Krčadinac, Some nice combinatorial objects
• Denis Krotov, Multispreads and the characterization of parameters of additive one-weight codes
• Ivan Landjev, Constructions of binary codes with two distances
• Stefano Lia, A note on strong blocking sets and higgledy-piggledy sets of lines
• Jonathan Mannaert, Bounds for m-ovoids using combinatorial techniques
• Giuliamaria Menara, Improving the lower bound for the order of correlation immune Boolean functions
• Giuliamaria Menara, Eulerian magnitude homology
• Francesca Merola, Banff designs: difference methods for coloring incidence graphs
• Matteo Mravić, Construction of extremal Z₄-codes using a neighborhood search algorithm
• Amela Muratović-Ribić, On properties of matrix representation of quadratic planar polynomials over finite fields and its connection with Latin squares
• Gábor Péter Nagy, Switching equivalence of strongly regular polar graphs
• Vito Napolitano, On (4,r,6)-bipartite biregular cages
• Padraig Ó Catháin, Monomial Representations and combinatorics
• Péter Pál Pach, Line-free sets
• Silvia Pagani, Ghost hunting
• Mark Pankov, Point-line geometries related to binary equidistant codes
• Kamal Lochan Patra, On vertex connectivity of zero-divisor graphs of finite commutative rings
• Marco Antonio Pellegrini, Magic partially filled arrays on abelian groups
• Safet Penjić, On (di)graphs and doubly stochastic matrices
• Valentina Pepe, On subspaces defining linear sets of maximum rank
• David Pike, 2-Block-intersection graphs of twofold triple systems
• René Rodríguez Aldama, Bending and plateauing: an approach to minimal p-ary codes
• Assia Rousseva, Constructions of affine t-fold blocking sets
• Sanja Rukavina, Self-dual (near-)extremal ternary codes and combinatorial 2-designs
• Binod Kumar Sahoo, Blocking sets of external, tangent and secant lines to an elliptic quadric in PG(3,q)
• Patrick Solé, Hadamard matrices and spherical designs
• Dragan Stevanović, Searching for regular, triangle-distinct graphs
• Leo Storme, The minimum distance of the code of intersecting lines in PG(3,q)
• Andrea Švob, On some structures related to intriguing sets of strongly regular graphs
• Tommaso Traetta, Near alternating sign matrices with an application
• Edwin van Dam, Amorphic association schemes and fusing pairs
• Draženka Višnjić, The distance function on Coxeter like graphs
• Konstantin Vorobev, Binary codes with distances d and d+2
• Alfred Wassermann, Higher incidence matrices and tactical decomposition matrices of designs
• Charlene Weiß, Existence of t-designs in polar spaces for all t
• Qing Xiang, Cameron-Liebler line classes, tight sets and strongly regular Cayley graphs
• E. Şule Yazıcı, Non-extendable partial Latin hypercubes and maximal orthogonal partial Latin squares
• Sjanne Zeijlemaker, On the existence of small strictly Neumaier graphs
• Tin Zrinski, Applications of genetic algorithms for constructions of SRGs and DSRGs