1: Aggregation and Ordering in Factorised Databases
2: An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints
3: Efficient Sequential and Parallel Algorithms for Planted Motif Search
4: A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem
5: Domain Specific Hierarchical Huffman Encoding
6: Clustering of Complex Networks and Community Detection Using Group Search Optimization
7: On string matching with k mismatches
8: An Elegant Algorithm for the Construction of Suffix Arrays
9: A branch and cut algorithm for minimum spanning trees under conflict constraints
10: Lempel-Ziv Parsing in External Memory
11: Linear Time Computation of the Maximal Linear and Circular Sums of Multiple Independent Insertions into a Sequence
12: Dynamic Decremental Approximate Distance Oracles with $(1+\epsilon, 2)$ stretch
13: Compressed Pattern-Matching with Ranked Variables in Zimin Words
14: An efficient reconciliation algorithm for social networks
15: Linear-time generation of specifiable combinatorial structures: general theory and first examples
16: Simpler Sequential and Parallel Biconnectivity Augmentation
17: Approximation Schemes for Maximum Weight Independent Set of Rectangles
18: Communication Lower Bounds for Distributed-Memory Computations