1: A Bijective String Sorting Transform
2: Using Neighborhood Diversity to Solve Hard Problems
3: Partial Degree Bounded Edge Packing Problem
4: An Entertaining Example for the Usage of Bitwise Operations in Programming
5: Multi-scale Community Detection using Stability Optimisation within Greedy Algorithms
6: Notes on Bit-reversal Broadcast Scheduling
7: Compact Binary Relation Representations with Rich Functionality
8: TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets
9: Processor Allocation for Optimistic Parallelization of Irregular Programs
10: The min mean-weight cycle in a random network
11: Sensor Networks: from Dependence Analysis Via Matroid Bases to Online Synthesis
12: A simple D^2-sampling based PTAS for k-means and other Clustering Problems
13: An efficient parallel algorithm for the longest path problem in meshes