1: Single and multiple consecutive permutation motif search
2: Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
3: Approximately counting semismooth integers
4: Broadword Implementation of Parenthesis Queries
5: Improved Cheeger’s Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap
6: Approximation of grammar-based compression via recompression
7: Ranking Games that have Competitiveness-based Strategies
8: Computing bounded-width tree and branch decompositions of k-outerplanar graphs
9: Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
10: Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
11: Singular values of Gaussian matrices and permanent estimators
12: Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model
13: Engineering Small Space Dictionary Matching
14: Nearly Optimal Private Convolution