1: Deterministic Fully Dynamic SSSP and More
2: A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
3: Sparse Submodular Function Minimization
4: Constant Approximation for Individual Preference Stable Clustering
5: Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs
6: Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold
7: Dynamic Batching of Online Arrivals to Leverage Economies of Scale
8: Max Weight Independent Set in sparse graphs with no long claws
9: Enumeration Complexity: Incremental Time, Delay and Space
10: FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
11: GateSeeder: Near-memory CPU-FPGA Acceleration of Short and Long Read Mapping
12: Bandwidth Parameterized by Cluster Vertex Deletion Number
13: Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering
14: Optimal Bounds on Private Graph Approximation
15: Enumerating minimal solution sets for metric graph problems
16: Degree Distribution Identifiability of Stochastic Kronecker Graphs
17: Tight Bounds for Volumetric Spanners and Applications
18: The Complexity of Distance-$r$ Dominating Set Reconfiguration
19: The Lov'asz Theta Function for Recovering Planted Clique Covers and Graph Colorings
20: New SDP Roundings and Certifiable Approximation for Cubic Optimization