Recent advances in algorithms and combinatorics

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. Lovasz.- Approximability of NP-Optimization Problems: A. Steger.- Pattern Inference Under Many Guises: M.F. Sagot, Y. Wakabayashi.- Szemeredi's Regularity Lemma and Quasi-Randomness: Y. Kohayakawa, V. Rodl.

[1]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[2]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[3]  László Lovász,et al.  Brick decompositions and the matching rank of graphs , 1982, Comb..

[4]  László Lovász,et al.  Ear-decompositions of matching-covered graphs , 1983, Comb..

[5]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[6]  Claudio L. Lucchesi,et al.  On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic , 2002, J. Comb. Theory, Ser. B.