1: Multivariate Analysis of Scheduling Fair Competitions
2: Efficient construction of the extended BWT from grammar-compressed DNA sequencing reads
3: Learning to Generate Fair Clusters from Demonstrations
4: A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions
5: Prophet Matching Meets Probing with Commitment
6: Semi-Streaming Algorithms for Submodular Matroid Intersection
7: The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals
8: Placing Green Bridges Optimally, with a Multivariate Analysis
9: Superfast Coloring in CONGEST via Efficient Color Sampling
10: $k$-Equivalence Relations and Associated Algorithms
11: Recursive Backdoors for SAT
12: Lower Bounds on the Integraliy Ratio of the Subtour LP for the Traveling Salesman Problem
13: COLOGNE: Coordinated Local Graph Neighborhood Sampling
14: Max-Cut via Kuramoto-type Oscillators
15: Approximately counting independent sets of a given size in bounded-degree graphs
16: Balanced Districting on Grid Graphs with Provable Compactness and Contiguity
17: The Multiplicative Version of Azuma’s Inequality, with an Application to Contention Analysis
18: Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries
19: On the Hardness of PAC-learning Stabilizer States with Noise
20: Learning k-qubit Quantum Operators via Pauli Decomposition
21: Parallel Minimum Cuts in $O(m \log^2(n))$ Work and Low Depth
22: From Sampling to Optimization on Discrete Domains with Applications to Determinant Maximization
23: Exact Algorithms for Scheduling Problems on Parallel Identical Machines with Conflict Jobs
24: Breaking the Quadratic Barrier for Matroid Intersection
25: Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
26: All instantiations of the greedy algorithm for the shortest superstring problem are equivalent
27: Agnostic Proper Learning of Halfspaces under Gaussian Marginals
28: Speeding up Routing Schedules on Aisle-Graphs with Single Access
29: A better lower bound for Lower-Left Anchored Rectangle Packing
30: Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights
31: Budget-Smoothed Analysis for Submodular Maximization
32: Approximation Algorithms for Generalized Multidimensional Knapsack
33: Deep Learning with Label Differential Privacy
34: Edge Deletion to Restrict the Size of an Epidemic
35: District-Fair Participatory Budgeting
36: A Compositional Atlas of Tractable Circuit Operations: From Simple Transformations to Complex Information-Theoretic Queries
37: Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths
38: Sample-Optimal PAC Learning of Halfspaces with Malicious Noise
39: On Agnostic PAC Learning using $\mathcal{L}_2$-polynomial Regression and Fourier-based Algorithms
40: The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks
41: The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregation
42: A Subexponential Algorithm for ARRIVAL
43: A more accurate view of the Flat Wall Theorem
44: Optimizing Safe Flow Decompositions in DAGs
45: Adaptive Sampling for Fast Constrained Maximization of Submodular Function
46: Computing Betweenness Centrality in Link Streams
47: Updatable Materialization of Approximate Constraints
48: Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs
49: Improved LP-based Approximation Algorithms for Facility Location with Hard Capacities
50: ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
51: The Complexity of Transitively Orienting Temporal Graphs
52: Co-lexicographically Ordering Automata and Regular Languages – Part II
53: The Structure of Minimum Vertex Cuts
54: On Robust Optimal Transport: Computational Complexity and Barycenter Computation
55: Lower Bounds on Dynamic Programming for Maximum Weight Independent Set
56: Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times
57: Optimal Streaming Algorithms for Graph Matching
58: Euclidean Affine Functions and Applications to Calendar Algorithms
59: Almost-linear-time Weighted $\ell_p$-norm Solvers in Slightly Dense Graphs via Sparsification
60: Beating Two-Thirds For Random-Order Streaming Matching
61: Simple vertex coloring algorithms
62: Fault-Tolerant Distance Labeling for Planar Graphs