Building Bridges

1. On the Power of Linear Dependencies
Imre Bárány

2. Surplus of Graphs and the Lovász Local Lemma
József Beck

3. Deformable Polygon Representation and Near-Mincuts
András A. Benczúr, Michel X. Goemans

4. Variations for Lovász’ Submodular Ideas
Kristóf Bérczi, András Frank

5. Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries
Anders Björner

6. The Finite Field Kakeya Problem
Aart Blokhuis, Francesco Mazzocca

7. An Abstract Szemerédi Regularity Lemma
Béla Bollobás, Vladimir Nikiforov

8. Isotropic PCA and Affine-Invariant Clustering
S.Charles Brubaker, Santosh S. Vempala

9. Small Linear Dependencies for Binary Vectors of Low Weight
Uriel Feige

10. Plünnecke’s Inequality for Different Summands
Katalin Gyarmati, Máté Matolcsi, Imre Z. Ruzsa

11. Decoupling and Partial Independence
Ravi Kannan

12. Combinatorial Problems in Chip Design
Bernhard Korte, Jens Vygen

13. Structural Properties of Sparse Graphs
Jaroslav NeŠetřil, Patrice Ossona Mendez

14. Recent Progress in Matching Extension
Michael D. Plummer

15. The Structure of the Complex of Maximal Lattice Free Bodies for a Matrix of Size (n + 1) × n

Herbert E. Scarf

16. Graph Invariants in the Edge Model
Alexander Schrijver

17. Incidences and the Spectra of Graphs
József Solymos

18. The Maturation of the Probabilistic Method
Joel Spencer

19. A Structural Approach to Subset-Sum Problems
Van Vu

Keywords: Mathematics, Combinatorics, Number Theory, Numeric Computing, Discrete Mathematics in Computer Science