1: Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty
2: Approximation algorithms for the vertex-weighted grade-of-service Steiner tree problem
3: Adversarial Bandits with Knapsacks
4: An Equivalence Class for Orthogonal Vectors
5: The Power of The Hybrid Model for Mean Estimation
6: An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs
7: A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System
8: Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs
9: Incremental Sparse TFIDF & Incremental Similarity with Bipartite Graphs
10: Flow-Based Local Graph Clustering with Better Seed Set Inclusion
11: Smoothed Analysis in Unsupervised Learning via Decoupling
12: Small Hazard-free Transducers
13: Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
14: Algorithms and Hardness for Diameter in Dynamic Graphs
15: The inverse Voronoi problem in graphs
16: Parallelizing greedy for submodular set function maximization in matroids and beyond
17: Optimal Algorithms for Scheduling under Time-of-Use Tariffs
18: Optimal-Time Dictionary-Compressed Indexes
19: Runtime Analysis for Self-adaptive Mutation Rates
20: Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decomposition