1: Tight Bounds for Monotone Minimal Perfect Hashing
2: Optimal Algorithms for Free Order Multiple-Choice Secretary
3: Quantum search in sets with prior knowledge
4: A simple and sharper proof of the hypergraph Moore bound
5: Correlation Clustering with Sherali-Adams
6: Preparing Many Copies of a Quantum State in the Black-Box Model
7: PPSZ is better than you think
8: Fair Range k-center
9: Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem
10: Contention Resolution for Coded Radio Networks
11: New Additive Spanner Lower Bounds by an Unlayered Obstacle Product
12: Improved Bounds for Sampling Solutions of Random CNF Formulas
13: Minimax Rates for Robust Community Detection
14: Simpler O(1) Query Algorithm for Level Ancestors
15: A Survey on Graph Problems Parameterized Above and Below Guaranteed Values
16: Nested Active-Time Scheduling
17: Testing of Index-Invariant Properties in the Huge Object Model
18: Implementing the Comparison-Based External Sort
19: Partial-Monotone Adaptive Submodular Maximization
20: Learning-Augmented Maximum Flow
21: Revisited Containment for Graph Patterns
22: Scheduling under Non-Uniform Job and Machine Delays
23: Cubic Goldreich-Levin
24: Modular Multiplication without Carry Propagation (Algorithm Description)
25: A Simple and Elegant Mathematical Formulation for the Acyclic DAG Partitioning Problem
26: Engineering faster double-array Aho-Corasick automata
27: ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems