1: Vizing’s Theorem in Deterministic Almost-Linear Time
2: Single-Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
3: Structure-Aware Spectral Sparsification via Uniform Edge Sampling
4: Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection
5: Distributed Reductions for the Maximum Weight Independent Set Problem
6: A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data
7: Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
8: Chromatic correlation clustering via cluster LP
9: Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
10: An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
11: Online Proportional Apportionment
12: Revoke vs. Restart in Unweighted Throughput Scheduling
13: A Levelset Algorithm for 3D-Tarski
14: Balls and Bins and the Infinite Process with Random Deletions
15: Prediction-Specific Design of Learning-Augmented Algorithms
16: Tree-Like Shortcuttings of Trees
17: Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
18: Temporal Graph Reconfiguration for Always-Connected Graphs
19: PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
20: Is Zadeh’s Least-Entered Pivot Rule Exponential?
21: Quantum Worst-Case to Average-Case Reduction for Matrix-Vector Multiplication
22: A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses
23: A Note on Algorithms for Computing $p_n$
24: Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
25: A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates
26: Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
27: Tight Pair Query Lower Bounds for Matching and Earth Mover’s Distance
28: Online computation of normalized substring complexity
29: Trading Prophets with Initial Capital
30: Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
31: Prior Makes It Possible: From Sublinear Graph Algorithms to LLM Test-Time Methods
32: Robust Dynamic Staffing with Predictions
33: An Exact Algorithm for the Unanimous Vote Problem
34: All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
35: Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
36: Opinion Maximization in Social Networks by Modifying Internal Opinions
37: Finding 4-Additive Spanners: Faster, Stronger, and Simpler
38: On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers
39: Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap
40: Near-Optimal Property Testers for Pattern Matching
41: The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
42: Unifying the Landscape of Super-Logarithmic Dynamic Cell-Probe Lower Bounds
43: Generalized Flow in Nearly-linear Time on Moderately Dense Graphs
44: Pattern Matching under Weighted Edit Distance
45: Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
46: Online Randomness Extraction: Simulating Barely Random Algorithms in the Random Order Arrival Model
47: Fast Agnostic Learners in the Plane
48: A Generalization of Distance Domination
49: Fingerprint Filters Are Optimal
50: A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
51: Coloring Graphs with Few Colors in the Streaming Model
52: Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
53: Static Retrieval Revisited: To Optimality and Beyond
54: Minimum $s$–$t$ Cuts with Fewer Cut Queries
55: Revisiting RFID Missing Tag Identification
56: Uniformity Testing under User-Level Local Privacy
57: Odd and Even Harder Problems on Cycle-Factors
58: LatticeHashForest: An Efficient Data Structure for Repetitive Data and Operations
59: Distributed Interactive Proofs for Planarity with Log-Star Communication
60: Sorting by Strip Swaps is NP-Hard