1: Shortest Reconfiguration of Sliding Tokens on a Caterpillar
2: Parameterized Integer Quadratic Programming: Variables and Coefficients
3: Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
4: Ball(star)-tree: Efficient spatial indexing for constrained nearest-neighbor search in metric spaces
5: Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints
6: Beating CountSketch for Heavy Hitters in Insertion Streams
7: The 4/3 Additive Spanner Exponent is Tight
8: Distributed Selection in $O ( \log n )$ Time with $O ( n \log \log n )$ Messages
9: Approximating Subadditive Hadamard Functions on Implicit Matrices
10: The (3,1)-ordering for 4-connected planar triangulations
11: Beating the Harmonic lower bound for online bin packing
12: Burrows-Wheeler transform for terabases
13: A correction on Shiloach’s algorithm for minimum linear arrangement of trees
14: Efficient Algorithms with Asymmetric Read and Write Costs
15: Searching input values hitting suspicious Intervals in programs with floating-point operations
16: Streaming Symmetric Norms via Measure Concentration
17: A 7/3-Approximation for Feedback Vertex Sets in Tournaments
18: Why Is Dual-Pivot Quicksort Fast?
19: Uniform generation of random regular graphs
20: Local Conflict Coloring
21: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
22: How Robust are Reconstruction Thresholds for Community Detection?
23: Note on Perfect Forests in Digraphs
24: Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations
25: Pattern matching in $(213,231)$-avoiding permutations
26: An Abstract Model for Branching and its Application to Mixed Integer Programming
27: Next Generation Multicuts for Semi-Planar Graphs
28: Dynamic Balanced Graph Partitioning
29: Traversing Grammar-Compressed Trees with Constant Delay
30: Submodular Hamming Metrics
31: NAND-Trees, Average Choice Complexity, and Effective Resistance
32: The Sample Complexity of Auctions with Side Information