1: Online Resource Allocation under Partially Predictable Demand
2: Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics
3: Polyline Simplification has Cubic Complexity
4: Fusion Hashing: A General Framework for Self-improvement of Hashing
5: Enumerating minimal dominating sets in $K_t$-free graphs and variants
6: A sampling framework for counting temporal motifs
7: Fully dynamic $3/2$ approximate maximum cardinality matching in $O(\sqrt{n})$ update time
8: A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs
9: Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times
10: Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS
11: Efficient Fastest-Path Computations in Road Maps
12: Contracting to a Longest Path in H-Free Graphs
13: Approximating Approximate Pattern Matching
14: Location of zeros for the partition function of the Ising model on bounded degree graphs
15: Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
16: Submodular Stochastic Probing with Prices
17: Graph Compression Using The Regularity Method
18: Weighted dynamic finger in binary search trees
19: Reverse Greedy is Bad for k-Center
20: A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains
21: Longest Property-Preserved Common Factor
22: Monte Carlo Dependency Estimation
23: Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation
24: Randen - fast backtracking-resistant random generator with AES+Feistel+Reverie
25: Compound Binary Search Tree and Algorithms
26: Polynomial-time Recognition of 4-Steiner Powers
27: Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications
28: Parameterized Leaf Power Recognition via Embedding into Graph Products
29: Mathematical models for stable matching problems with ties and incomplete lists
30: Balanced Allocation with Random Walk Based Sampling
31: Memento: Making Sliding Windows Efficient for Heavy Hitters
32: A Survey of Neighbourhood Construction Models for Categorizing Data Points
33: Counting homomorphisms in plain exponential time