Practical Variable Length Gap Pattern Matching using Wavelet Trees -- Fast Exact Computation of Isochrones in Road Networks -- Dynamic Time-Dependent Route Planning in Road Networks with User Preferences -- UKP5: a New Algorithm for the Unbounded Knapsack Problem -- Lempel-Ziv Decoding in External Memory -- A Practical Method for the Minimum Genus of a Graph: Models and Experiments -- Compact Flow Diagrams for State Sequences -- Practical Dynamic Entropy-Compressed Bitvectors with Applications -- Accelerating Local Search for the Maximum Independent Set Problem -- Computing Nonsimple Polygons of Minimum Perimeter -- Sparse Subgraphs for 2-Connectivity in Directed Graphs -- Worst-Case-Efficient Dynamic Arrays in Practice -- On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors -- Engineering Hybrid DenseZDDs -- Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances -- Tractable Pathfinding for the Stochastic On-Time Arrival Problem -- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem -- Experimental Analysis of Algorithms for Coflow Scheduling -- An Empirical Study of Online Packet Scheduling Algorithms -- Advanced Multilevel Node Separator Algorithms -- A merging heuristic for the rectangle decomposition of binary matrice -- CHICO: A Compressed Hybrid Index for Repetitive Collections -- Fast Scalable Construction of (Minimal Perfect Hash) Functions -- Better partitions of protein graphs for subsystem quantum chemistry -- Online Algorithm for Approximate Quantile Queries on Sliding Windows.