1: Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness
2: A note on the complexity of Feedback Vertex Set parameterized by mim-width
3: Improved quantum backtracking algorithms using effective resistance estimates
4: Deterministic Distributed Edge-Coloring with Fewer Colors
5: A Friendly Smoothed Analysis of the Simplex Method
6: Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models
7: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
8: Exact and heuristic algorithms for Cograph Editing
9: Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve K"orkel-Ghosh instances
10: An $O^(star)(1.84^k)$ Parameterized Algorithm for the Multiterminal Cut Problem
11: Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint
12: An almost-linear time algorithm for uniform random spanning tree generation
13: Graph Clustering using Effective Resistance
14: Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
15: Neon2: Finding Local Minima via First-Order Oracles
16: Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds
17: Superlinear Lower Bounds for Distributed Subgraph Detection
18: Deletion-Robust Submodular Maximization at Scale
19: List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians
20: Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithms
21: Linear-Complexity Relaxed Word Mover’s Distance with GPU Acceleration
22: A Separation Between Run-Length SLPs and LZ77
23: Mixture Models, Robustness, and Sum of Squares Proofs
24: On estimating the alphabet size of a discrete random source
25: Edge Estimation with Independent Set Oracles
26: Approximating Geometric Knapsack via L-packings
27: On $P_5$-free Chordal bipartite graphs
28: The Hidden Binary Search Tree:A Balanced Rotation-Free Search Tree in the AVL RAM Model