Analysis and Design of Algorithms for Combinatorial Problems

Strongly Equivalent Directed Hypergraphs (G. Ausiello, A. D'Atri and D. Sacca). A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem (R. Bar-Yehuda and S. Even). Dynamic Programming Parallel Procedures for SIMD Architectures (P. Bertolazzi). Simulations Among Classes of Random Access Machines and Equivalence Among Numbers Succinctly Represented (A. Bertoni, G. Mauri and N. Sabadini). A Realistic Approach to VLSI Relational Data-Base Processing (M.A. Bonucelli et al.). On Counting BECS (R. Casas, J. Diaz and M. Verges). Rigid Extensions of Graph Maps (I.S. Filotti). Algebraic Methods for Trie Statistics (Ph. Flajolet, M. Regnier and D. Sotteau). Easy Solutions for the K-Center Problem or the Dominating Set Problem on Random Graphs (D.S. Hochbaum). Network Design with Multiple Demand: A New Approach (M. Lucertini and G. Paletta). How to Find Long Paths Efficiently (B. Monien). Compact Channel Routing of Multiterminal Nets (M. Sarrafzadeh and F.P. Preparata). Consistency of Quadratic Boolean Equations and the Konig-Egervary Property for Graphs (B. Simeone). On Some Relationships Between Combinatorics and Probabilistic Analysis (M. Talamo, A. Marchetti-Spaccamela and M. Protasi). A Threshold for Multiple Edge Coverings in Random Hypergraphs (C. Vercellis).