1: Public Goods Games in Directed Networks with Constraints on Sharing
2: Learning and Testing Convex Functions
3: Faster MAX-CUT on Bounded Threshold Rank Graphs
4: Deviation Dynamics in Cardinal Hedonic Games
5: Optimal and Efficient Partite Decompositions of Hypergraphs
6: Graded Projection Recursion (GPR): A Framework for Controlling Bit-Complexity of Algebraic Packing
7: An improved approximation algorithm for k-Median
8: Shortcutting for Negative-Weight Shortest Path
9: Preserving Extreme Singular Values with One Oblivious Sketch
10: Indirect Coflow Scheduling
11: Approximate Message Passing for Quantum State Tomography
12: Maximal Palindromes in MPC: Simple and Optimal
13: An FPTAS for 7/9-Approximation to Maximin Share Allocations
14: MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity
15: Greedy matroid base packings with applications to dynamic graph density and orientations
16: A Complexity Analysis of the c-Closed Vertex Deletion Problem
17: Dimension-Free Correlated Sampling for the Hypersimplex
18: The Merkle Mountain Belt
19: Subgraph Isomorphism: Prolog vs. Conventional
20: Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
21: Efficient Calibration for Decision Making
22: Optimal Sequential Flows
23: CORGI: Efficient Pattern Matching With Quadratic Guarantees
24: Compression with Privacy-Preserving Random Access
25: Exact Learning of Weighted Graphs Using Composite Queries
26: Intermediate N-Gramming: Deterministic and Fast N-Grams For Large N and Large Datasets
27: A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
28: Computing Power Indices in Weighted Majority Games with Formal Power Series
29: Combinatorial Optimization using Comparison Oracles
30: Dynamic Matroids: Base Packing and Covering
31: Sample-Adaptivity Tradeoff in On-Demand Sampling
32: Sequential testing problem: A follow-up review
33: B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index
34: Tokenisation over Bounded Alphabets is Hard
35: Connectivity-Preserving Important Separators: Enumeration and an Improved FPT Algorithm for Node Multiway Cut-Uncut
36: Real Time Proportional Throughput Maximization: How much advance notice should you give your scheduler?
37: Optimal Online Bipartite Matching in Degree-2 Graphs
38: Robustness of Online Inventory Balancing to Inventory Shocks
39: Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
40: Online Graph Coloring for $k$-Colorable Graphs
41: Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
42: A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
43: Simulating Gaussian boson sampling on graphs in polynomial time
44: Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
45: Rate-optimal community detection near the KS threshold via node-robust algorithms
46: Fixed-magnetization Ising on random graphs up to reconstruction