1: Online Allocation and Pricing: Constant Regret via Bellman Inequalities
2: A Unified Framework of Constrained Robust Submodular Optimization with Applications
3: A New Family of Tractable Ising Models
4: Linear-time Hierarchical Community Detection
5: Learning Restricted Boltzmann Machines with Arbitrary External Fields
6: The SDP value for random two-eigenvalue CSPs
7: A concise guide to existing and emerging vehicle routing problem variants
8: Near Optimal Coflow Scheduling in Networks
9: Matching Patterns with Variables
10: Relaxing Concurrent Data-structure Semantics for Increasing Performance: A Multi-structure 2D Design Framework
11: Time-dependent Hamiltonian simulation with $L^1$-norm scaling
12: Orienting undirected phylogenetic networks
13: Review of a Quantum Algorithm for Betti Numbers
14: On the Constrained Least-cost Tour Problem
15: Convergence of the Non-Uniform Directed Physarum Model
16: Indexing Graph Search Trees and Applications
17: Space Efficient Algorithms for Breadth-Depth Search
18: Tutorial on algebraic deletion correction codes
19: Scalable and Differentially Private Distributed Aggregation in the Shuffled Model
20: Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
21: Extensions of Self-Improving Sorters
22: Coresets for Clustering with Fairness Constraints
23: Stochastic One-Sided Full-Information Bandit
24: Fast Public Transit Routing with Unrestricted Walking through Hub Labeling
25: Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools
26: Fairness and Utilization in Allocating Resources with Uncertain Demand