1: Twenty-Two New Approximate Proof Labeling Schemes (Full Version)
2: The Satisfactory Partition Problem
3: A Simple Sublinear Algorithm for Gap Edit Distance
4: A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
5: Computing Weighted Subset Transversals in $H$-Free Graphs
6: Truncated Linear Regression in High Dimensions
7: Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)
8: Intersectional Affirmative Action Policies for Top-k Candidates Selection
9: Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization
10: Book Embeddings of Graph Products
11: Two’s Company, Three’s a Crowd: Consensus-Halving for a Constant Number of Agents
12: Approximate Ridesharing of Personal Vehicles Problem
13: Branch-and-Bound Solves Random Binary IPs in Polytime
14: Algorithmic Stability in Fair Allocation of Indivisible Goods Among Two Agents
15: AMM: Adaptive Multilinear Meshes
16: The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise
17: Local Conflict Coloring Revisited: Linial for Lists
18: Phase Transition of the k-Majority Dynamics in Biased Communication Models
19: Synchronized Planarity with Applications to Constrained Planarity Problems
20: Efficient Tensor Decomposition
21: Outlier Robust Mean Estimation with Subgaussian Rates via Stability
22: An Asymptotic Lower Bound for Online Vector Bin Packing
23: Distribution-Free Models of Social Networks
24: Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization
25: MSPP: A Highly Efficient and Scalable Algorithm for Mining Similar Pairs of Points