This symposium concerned research on the use, design, and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms. The papers are based on the extent to which the results yield new insights for the design, use, or analysis of efficient algorithms. Performance analysis cover analytical and experimental, worst-case and average-case performance. The studies are both theoretical or based on real data sets, and address methodological issues involved in performance analysis. They cover the discrete mathematics and experimental and applied algorithms communities.