1: Distance Measures for Sequences
2: Choose Outsiders First: a mean 2-approximation random algorithm for covering problems
3: A combinatorial analysis of the average time for open-address hash coding insertion
4: Lower Bounds on Information Dissemination in Dynamic Networks
5: Bounded-Contention Coding for Wireless Networks in the High SNR Regime
6: Conflict Anticipation in the Search for Graph Automorphisms
7: Graph Symmetry Detection and Canonical Labeling: Differences and Synergies
8: New results about multi-band uncertainty in Robust Optimization