On the Power of Linear Dependencies -- Surplus of Graphs and the Lovász Local Lemma -- Deformable Polygon Representation and Near-Mincuts -- Variations for Lovász’ Submodular Ideas -- Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries -- The Finite Field Kakeya Problem -- An Abstract Szemerédi Regularity Lemma -- Isotropic PCA and Affine-Invariant Clustering -- Small Linear Dependencies for Binary Vectors of Low Weight -- Plünnecke’s Inequality for Different Summands -- Decoupling and Partial Independence -- Combinatorial Problems in Chip Design -- Structural Properties of Sparse Graphs -- Recent Progress in Matching Extension -- The Structure of the Complex of Maximal Lattice Free Bodies for a Matrix of Size (n + 1) × n -- Graph Invariants in the Edge Model -- Incidences and the Spectra of Graphs -- The Maturation of the Probabilistic Method -- A Structural Approach to Subset-Sum Problems.