1: Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search
2: The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing
3: Streaming $k$-edit approximate pattern matching via string decomposition
4: Robustified Learning for Online Optimization with Memory Costs
5: Efficient dynamic model based testing using greedy test case selection
6: A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm
7: Collision Detection for Modular Robots – it is easy to cause collisions and hard to avoid them
8: Approximating submodular $k$-partition via principal partition sequence
9: Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation
10: Temporal Betweenness Centrality on Shortest Walks Variants
11: An Update-intensive LSM-based R-tree Index
12: Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs
13: Unbounded Differentially Private Quantile and Maximum Estimation
14: Incremental Maximization via Continuization
15: Two-sets cut-uncut on planar graphs
16: The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
17: Sample-based distance-approximation for subsequence-freeness
18: Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering
19: A Subquadratic Bound for Online Bisection
20: FPT Approximations for Capacitated/Fair Clustering with Outliers
21: Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution
22: Randomized algorithms for fully online multiprocessor scheduling with testing
23: Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
24: Streaming Edge Coloring with Asymptotically Optimal Colors
25: Connectivity Queries under Vertex Failures: Not Optimal, but Practical
26: On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete $k$-Center for Small $k$
27: Experimental Design for Any $p$-Norm
28: Computing paths of large rank in planar frameworks deterministically
29: Approximating Long Cycle Above Dirac’s Guarantee
30: Approximate Evaluation of Quantitative Second Order Queries
31: Algorithmic Theory of Qubit Routing
32: An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
33: Random Schreier graphs as expanders
34: Minimum Chain Cover in Almost Linear Time
35: Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else
36: A $4/3$ Approximation for $2$-Vertex-Connectivity
37: Triangle Counting with Local Edge Differential Privacy
38: Perfect Sampling for Hard Spheres from Strong Spatial Mixing
39: Efficient Caching with Reserves via Marking
40: Prefix Sorting DFAs: a Recursive Algorithm
41: On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation
42: Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA
43: $\alpha_i$-Metric Graphs: Radius, Diameter and all Eccentricities
44: A Hyperbolic Extension of Kadison-Singer Type Results
45: Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential Privacy
46: Local Computation Algorithms for Hypergraph Coloring – following Beck’s approach (full version)
47: Impossibility of Depth Reduction in Explainable Clustering
48: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
49: Coloring tournaments with few colors: Algorithms and complexity
50: What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs?
51: Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing
52: Ranking and unranking bordered and unbordered words
53: A Sparse Johnson-Lindenstrauss Transform using Fast Hashing
54: Testing Convex Truncation
55: Testing and Learning Convex Sets in the Ternary Hypercube
56: Sum-of-Local-Effects Data Structures for Separable Graphs
57: On Optimization and Counting of Non-Broken Bases of Matroids
58: Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
59: Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
60: Fast Dynamic Programming in Trees in the MPC Model
61: Fault-Tolerant ST-Diameter Oracles
62: Minimum-Membership Geometric Set Cover, Revisited