1: On the Complexity of Multi-Parameterized Cluster Editing
2: Universality laws for randomized dimension reduction, with applications
3: Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication
4: Dynamic Parallel and Distributed Graph Cuts
5: Online Budgeted Repeated Matching
6: Proposed Approximate Dynamic Programming for Pathfinding under Visible Uncertainty
7: Fractals for Kernelization Lower Bounds
8: An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
9: Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing
10: Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test
11: Hitting Set for hypergraphs of low VC-dimension
12: CacheDiff: Fast Random Sampling
13: MMSE Estimation for Poisson Noise Removal in Images
14: Faster than Classical Quantum Algorithm for dense Formulas of Exact Satisfiability and Occupation Problems
15: Fast Average-Case Pattern Matching on Weighted Sequences
16: Reconstruction of depth-3, top fan-in two circuits over characteristic zero fields
17: Cell-probe Lower Bounds for Dynamic Problems via a New Communication Model
18: Exact Algorithms via Monotone Local Search
19: Approximate Range Counting Revisited
20: Solving the Subset Sum Problem with Heap-Ordered Subset Trees
21: Restricted Low-Rank Approximation via ADMM
22: Approximate nearest neighbor search for $\ell_p$-spaces ($2 < p < \infty$) via embeddings
23: k-Trails: Recognition, Complexity, and Approximations
24: On Routing Disjoint Paths in Bounded Treewidth Graphs
25: Designing Applications in a Hybrid Cloud
26: Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences
27: Sparsified Cholesky and Multigrid Solvers for Connection Laplacians
28: A bloated FM-index reducing the number of cache misses during the search
29: Minimum Cut of Directed Planar Graphs in O(nloglogn) Time