Introduction.- N. Alon: Lovбsz, Vectors, Graphs and Codes.- A. Bjцrner: Continuous matroids revisited.- C. Borgs, J. T. Chayes, H. Cohn and L. M. Lovбsz: Identifiability for Graphexes and the Weak Kernel Metric.- D. Conlon, J. Fox, A. Grinshpun and Xiaoyu He: Online Ramsey Numbers and the Subraph Query Problem.- P. Csikvбri: Statistical Matching Theory.- P. Diaconis: A conversation with Laci.- U. Feige: Tighter Bounds for Bipartite Matching.- T. Jordбn and A. Mihбlykу: Minimum Cost Globally Rigid Subgraphs.- P. Keevash: Colored and Directed Designs.- Jin Tat Lee, A. Sidford and S. S. Vempala: Efficient Convex Optimization with Oracles.- J. Nesetril and P. Osona de Mendes: Approximations of Mappings.- O. E. Raz and A. Wigderson: Derandomization Through Submodular Optimization.- A. Schrijver: Finding k Partially Disjoint Paths in a Directed Planar Graph.- M. Simonovits and E. Szemerйdi: Embedding graphs into larger graphs, results, methods and problems.
