Description
Excellent authors, such as Lovasz, one of the five best combinatorialists in the world; Thematic linking that makes it a coherent collection; Will appeal to a variety of communities, such as mathematics, computer science and operations research * The Matching Lattice: M.H. de Carvalho, C.L. Lucchesi, U.S.R. Murty * Discrete Mathematics and Radio Channel Assignment: C. McDiarmid * On the Coloration of Perfect Graphs: F. Maffray * Algorithmic Aspects of Tree Width: B.A.Reed * A Survey on Clique Graphs: J.L.Szwarcfiter * Semidefinite Programs and Combinatorial Optimization: L. Lovsz * Approximability of NP-Optimization Problems: A.Steger * Pattern Inference Under Many Guises: M.F.Sagot, Y. Wakabayashi * Szemerdi’s Regularity Lemma and Quasi-Randomness: Y. Kohayakawa, V. Rdl
