1: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
2: Constraint satisfaction problems with isolated solutions are hard
3: Identifying almost sorted permutations from TCP buffer dynamics
4: Near-Optimal Radio Use For Wireless Network Synchronization
5: Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
6: 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
7: A Model for Communication in Clusters of Multi-core Machines
8: Efficient Pattern Matching on Binary Strings