Building Bridges [electronic resource] : Between Mathematics and Computer Science / edited by Martin Grȵtschel, Gyula O. H. Katona, Gbor Sgi.

On the Power of Linear Dependencies -- Surplus of Graphs and the Lovsz Local Lemma -- Deformable Polygon Representation and Near-Mincuts -- Variations for Lovsz 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ȭnneckes 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.

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Lszl Lovsz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovszs 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.

ZDB-2-SMA