1: Fully-Dynamic Coresets
2: Using Decision Diagrams to Compactly Represent the State Space for Explicit Model Checking
3: A Primer on Private Statistics
4: A Parameterized Approximation Scheme for Min $k$-Cut
5: An Efficient Noisy Binary Search in Graphs via Median Approximation
6: Cutting Bamboo Down to Size
7: Multi-dimensional Arrays with Levels
8: Improved Bound for Matching in Random-Order Streams
9: Optimal Join Algorithms Meet Top-k
10: The Hypervolume Indicator: Problems and Algorithms
11: Distributions of restricted rotation distances
12: Approximating maximum integral multiflows on bounded genus graphs
13: Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings
14: Independent Set on P$_k$-Free Graphs in Quasi-Polynomial Time
15: Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift
16: Deterministic Treasure Hunt in the Plane with Angular Hints
17: Almost Universal Anonymous Rendezvous in the Plane
18: Online Learning and Optimization for Revenue Management Problems with Add-on Discounts
19: A Dynamic Space-Efficient Filter with Constant Time Operations
20: Efficiently Testing Simon’s Congruence
21: A Study of Performance of Optimal Transport
22: Probabilistic Analysis of RRT Trees
23: The Multi-Symplectic Lanczos Algorithm and Its Applications to Color Image Processing
24: On the Parameterized Complexity of Deletion to $\mathcal{H}$-free Strong Components
25: High-Dimensional Robust Mean Estimation via Gradient Descent
26: Reducing graph transversals via edge contractions
27: What Do Our Choices Say About Our Preferences?
28: Sample Complexity of Uniform Convergence for Multicalibration
29: Determining the Multiplicative Complexity of Boolean Functions using SAT
30: Complexity of $C_k$-coloring in hereditary classes of graphs
31: Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time
32: Removable Online Knapsack and Advice
33: Helly-gap of a graph and vertex eccentricities
34: Edge-Weighted Online Bipartite Matching
35: Grid Drawings of Graphs with Constant Edge-Vertex Resolution
36: A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations
37: On Reachable Assignments in Cycles and Cliques
38: When Votes Change and Committees Should (Not)
39: Many visits TSP revisited
40: Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
41: The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
42: Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency
43: Conditional Cuckoo Filters
44: Differentiable Greedy Submodular Maximization: Guarantees, Gradient Estimators, and Applications
45: Incremental Multiple Longest Common Sub-Sequences
46: Quantum pattern matching Oracle construction
47: Sparktope: linear programs from algorithms
48: Outlier-Robust Clustering of Non-Spherical Mixtures
49: Determinantal Point Processes in Randomized Numerical Linear Algebra
50: Fast multivariate empirical cumulative distribution function with connection to kernel density estimation
51: Scheduling with a processing time oracle