1: Reconfiguration of Connected Graph Partitions via Recombination
2: Learning-Augmented Query Policies
3: Time and Space Optimal Exact Majority Population Protocols
4: Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
5: The Secretary Problem with Independent Sampling
6: Strongly Connected Components in Stream Graphs: Computation and Experimentations
7: To Close Is Easier Than To Open: Dual Parameterization To k-Median
8: Faster connectivity in low-rank hypergraphs via expander decomposition
9: The Longest Run Subsequence Problem: Further Complexity Results
10: Optimal Sub-Gaussian Mean Estimation in $\mathbb{R}$
11: Exact recovery of Planted Cliques in Semi-random graphs
12: Optimal diameter computation within bounded clique-width graphs
13: A Simple Method for Convex Optimization in the Oracle Model
14: Efficient stream-based Max-Min diversification with minimal failure rate
15: Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
16: Near-Optimal Multi-Robot Motion Planning with Finite Sampling
17: Learning-Augmented Weighted Paging
18: Engineering a Fast Probabilistic Isomorphism Test
19: Introduction to Core-sets: an Updated Survey
20: Non-Adaptive Matroid Prophet Inequalities
21: Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS
22: Online Paging with a Vanishing Regret
23: Redistricting Algorithms
24: Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees
25: Fully Dynamic Approximation of LIS in Polylogarithmic Time
26: Quantum complexity of minimum cut
27: The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
28: The VLSAT-1 Benchmark Suite
29: Clustering-based Automatic Construction of Legal Entity Knowledge Base from Contracts
30: Uniform and Monotone Line Sum Optimization
31: On the Request-Trip-Vehicle Assignment Problem
32: List-Decodable Mean Estimation in Nearly-PCA Time
33: Estimation of Shortest Path Covariance Matrices
34: Illustrating the Suitability of Greedy and Dynamic Algorithms Using The Economics Concept of “Opportunity Cost”
35: Subpath Queries on Compressed Graphs: a Survey
36: Approximate Bipartite Vertex Cover in the CONGEST Model
37: HyperLogLog (HLL) Security: Inflating Cardinality Estimates
38: Fixed-Parameter Algorithms for Graph Constraint Logic
39: Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
40: Hop-Constrained Oblivious Routing
41: Graph Tikhonov Regularization and Interpolation via Random Spanning Forests
42: Sparse sketches with small inversion bias