| PROBLEM SESSION 1 | | | |

| PROBLEM SESSION 2 | | | |

Bailey | Levi graphs and concurrence graphs as tools to evaluate block designs | | | |

Buser | Jacobians of degenerate Riemann surfaces and graphs | | | |

Chepoi | A topological characterization of basis graphs of matroids | | | |

Cioaba | Eigenvalues and Structure of Graphs | | | |

Courcelle | Automata based graph algorithms for logically defined problems 1 | | | |

Courcelle | Automata based graph algorithms for logically defined problems 2 | | | |

Courcelle | Automata based graph algorithms for logically defined problems 3 | | | |

Dodziuk | Difference equations on graphs | | | |

Gadouleau | Entropy and closure of directed graphs | | | |

Grabowski | Combinatorics related to spectral theory of random walks on lamplighter groups | | | |

Haemers | Spectra of Graphs 1: Spectral characterizations | | | |

Haemers | Spectra of Graphs 2: Maximal energy | | | |

Helfgott | Growth in groups: ideas and perspectives | | | |

Hoffman | Expander graphs from groups of Kac-Moody type and generalizations | | | |

Huber | Randomized Rumour Spreading | | | |

Ivrissimtzis | Spectral properties of Platonic graphs and a new family of trivalent expanders | | | |

Jackson | Rigidity of graphs and frameworks | | | |

Jerrum | The Tutte polynomial: sign and approximability | | | |

Kang | Arrangements of pseudocircles and circles | | | |

Kawarabayashi | Property testing for sparse graphs - Structural graph theory meets property testing | | | |

Keller | On negative curvature and spectrum of graph Laplacians | | | |

Kral | Limits of graphs and permutations 1 | | | |

Kral | Limits of graphs and permutations 2 | | | |

Kral | Limits of graphs and permutations 3 | | | |

Lenz | Spectral theory of graphs and Dirichlet forms via intrinsic metrics 1 | | | |

Lenz | Spectral theory of graphs and Dirichlet forms via intrinsic metrics 2 | | | |

Liu | Ricci curvature and spectra estimates on graphs | | | |

Lledo | Spectral gaps for periodic discrete and metric graphs | | | |

Lo | Proof of the 1-factorization and Hamilton decomposition conjectures | | | |

Mohar | On median eigenvalues of graphs | | | |

Niedermeier | Exploiting Graph Structure in Multivariate Algorithmics | | | |

Nixon | Symmetric frameworks on cylinders and cones | | | |

Patel | A conjecture of Thomassen on Hamiltonian cycles in highly connected tournaments | | | |

Pollicott | Nonlinear Perron-Frobenius-Ruelle Theorems | | | |

Pyatkin | Incidentor coloring: Methods and results | | | |

Sharp | A Weil-Petersson metric for graphs | | | |

Stark | Poisson approximation of counts of subgraphs in random intersection graphs | | | |

Stark | Multivariable Zeta Functions of Graphs | | | |

Terras | Finite upper half plane graphs and their connections with modular forms | | | |

Trotignon | Truemper configurations | | | |

Valette | Euclidean distortion and spectral gap for finite graphs | | | |

van Dam | Eigenvalues and distance-regularity of graphs | | | |

Vuskovic | Local structural properties and decomposition | | | |

Wojciechowski | Intrinsic metrics on infinite graphs | | | |