1: The List-Decoding Size of Fourier-Sparse Boolean Functions
2: New Unconditional Hardness Results for Dynamic and Online Problems
3: Solving the Closest Vector Problem in $2^n$ Time— The Discrete Gaussian Strikes Again!
4: Set Membership with a Few Bit Probes
5: An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles
6: Compressing Sparse Sequences under Local Decodability Constraints
7: Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline
8: A Linear Time Algorithm for the $3$-neighbour Traveling Salesman Problem on Halin graphs and extensions
9: Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
10: Optimal induced universal graphs and adjacency labeling for trees
11: Search algorithms for efficient logistics chains
12: Algorithms for the workflow satisfiability problem engineered for counting constraints
13: Proceedings Graphs as Models
14: Learning Arbitrary Statistical Mixtures of Discrete Distributions
15: Faster Algorithms for the Constrained k-means Problem
16: Lempel Ziv Computation In Small Space (LZ-CISS)
17: Confluence Detection for Transformations of Labelled Transition Systems
18: Aggregation by Provenance Types: A Technique for Summarising Provenance Graphs
19: OneMax in Black-Box Models with Several Restrictions
20: Longest Common Extensions in Sublinear Space
21: The inverse $p$-maxian problem on trees with variable edge lengths
22: The Hardness of Subgraph Isomorphism
23: Analysis of a Classical Matrix Preconditioning Algorithm
24: A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow
25: Testing Cluster Structure of Graphs
26: Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions
27: On the Workflow Satisfiability Problem with Class-Independent Constraints