Combinatorics, Computation, and Logic

From the contents: Invited papers: Parametric complexity after (almost) ten years: review and open questions (R.G. Downey & M.R. Fellows). Hidden algebra for software engineering (J.A. Goguen). Crossroads in flatland (J. Pach). On negative informations in language theory (F. Mignosi & A. Restivo). Efficiency vs. security in the implementation of public-key cryptography (P.G. Walsh).- Some archetypal contributed papers: Permuting mechanisms and closed classes of permutations (M.D. Atkinson & R. Beals). A stability theorem for recursive analysis (V. Brattka). Towards automatic bisimilarity checking in the spi calculus (A.S. Alkjaer et al.). The pagenumber of de Bruijn and Kautz digraphs (T. Hasunuma). Formal synthesis for pipeline design (H. Hinrichsen et al.). On the approximability of physical map problems using single molecule methods (L. Parida). Lower bounds on negation-limited inverters (S.C. Sung & K. Tanaka), and other papers.