1: Folding a Paper Strip to Minimize Thickness
2: Sorting Networks: the End Game
3: Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
4: Efficient storage of Pareto points in biobjective mixed integer programming
5: Optimal Encodings for Range Top-k, Selection, and Min-Max
6: Deletion codes in the high-noise and high-rate regimes
7: Counting cliques and clique covers in random graphs
8: Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints
9: Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
10: Improved Algorithmic Results for Unsplittable Stable Allocation Problems
11: Efficiently listing bounded length st-paths
12: Simple strategies versus optimal schedules in multi-agent patrolling
13: Kernelization Algorithms for Packing Problems Allowing Overlaps (Extended Version)
14: All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
15: The robust single machine scheduling problem with uncertain release and processing times
16: Hashing for statistics over k-partitions
17: Efficient SimRank Computation via Linearization
18: $1$-String $B_2$-VPG Representation of Planar Graphs
19: Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
20: Bounds on the Expected Size of the Maximum Agreement Subtree
21: A Chasm Between Identity and Equivalence Testing with Conditional Queries
22: Algorithms in the Ultra-Wide Word Model
23: Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
24: Computational issues in time-inconsistent planning
25: Derandomizing Isolation Lemma for $K_{3,3}$-free and $K_5$-free Bipartite Graphs
26: Approximate Undirected Maximum Flows in O(m polylog(n)) Time
27: The Complexity of Finding Effectors