This book consists of nine survey articles written by outstanding researchers on various recent advances in algorithmic combinatorics. The articles cover both recent areas of application and exciting new theoretical developments. The book is accessible to Ph.D. students in discrete mathematics or theoretical computer science and is intended for researchers in the field of combinatorics.

From the reviews:

"Combinatorics is one of the fastest growing fields of mathematics. From the table of contents one can see the wide range of topics covered. The authors are acknowledged researchers of the presented fields and guarantee the high quality of the volume. If you want to be up-to-date in combinatorics you should have this volume close to your hands." (Péter Hajnal, Acta Scientarium Mathematicarum, Vol. 69, 2003)

"This edited volume contains nine carefully written chapters in the area of combinatorics. The book is very well written and can be read individually by research students. The volume is of definite interest for researchers in combinatorics, graph theory and theoretical computer science. This book is certainly value for money and I would highly recommend it as an essential purchase for a university library." (G. Gutin, Journal of the Operational Research Society, Vol. 55 (5), 2004)

Inhalt
The Matching Lattice.- Discrete Mathematics and Radio Channel Assignment.- On the coloration of perfect graphs.- Algorithmic Aspects of Tree Width.- A Survey on Clique Graphs.- Semidefinite Programs and Combinatorial Optimization.- Approximability of NP-Optimization Problems.- Pattern Inference under many Guises.- Szemerédi's Regularity Lemma and Quasi-randomness.