09:00 - 09:40 Akihiro Munemasa: A family of antipodal distance-regular cover of complete graphs arising from skew generalized Hadamard matrices

10:05 - 10:45 Jack Koolen: The regular two-graph on 276 vertices, revisited

10:50 - 11:30 Tao Feng: The asymptotic existence of designs having a nesting: an application of a hypergraph matching theorem

13:30 - 14:10 Ziqing Xiang: Three recent results

14:15 - 14:55 Yan Zhu: Graphical designs from independent sets and equitable partitions

15:00 - 15:40 Ferdinand Ihringer: The Structure of Boolean Degree d Functions on the Grassmann Graph

16:20 - 17:00 Da Zhao: Random graphs determined by spectrum with various edge density

17:05 - 17:45 Qianqian Yang: Recent results on sesqui-regular graphs with smallest eigenvalue at least −3

17:50 - 18:30 Tianxiao Zhao: On the existence problems of strongly regular graphs