1: Online Job Assignment
2: Delegation with Costly Inspection
3: CNFs and DNFs with Exactly $k$ Solutions
4: On Sketching Trimmed Statistics
5: On Deterministically Finding an Element of High Order Modulo a Composite
6: Discrete and Continuous Difference of Submodular Minimization
7: Fair Diversity Maximization with Few Representatives
8: Testing Suffixient Sets
9: Towards universally optimal sorting algorithms
10: Private Evolution Converges
11: Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
12: Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
13: Towards Fair Representation: Clustering and Consensus
14: Excluding an induced wheel minor in graphs without large induced stars
15: Improving Online Bin Covering with Little Advice
16: Optimizing Sparse SYK
17: Almost-Optimal Local-Search Methods for Sparse Tensor PCA
18: Tight Paths and Tight Pairs in Weighted Directed Graphs
19: New Approximation Guarantees for The Inventory Staggering Problem
20: Structural Parameterizations of $k$-Planarity
21: Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
22: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
23: String Matching with a Dynamic Pattern
24: Few Single-Qubit Measurements Suffice to Certify Any Quantum State
25: Bounded Memory in Distributed Networks
26: Isometric-Universal Graphs for Trees
27: Adaptive determinantal scheduling with fairness in wireless networks
28: Practical colinear chaining on sequences revisited
29: Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut
30: Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text
31: Towards Energy-Efficient Distributed Agreement
32: Relative Error Fair Clustering in the Weak-Strong Oracle Model