1: New approximate distance oracles and their applications
2: Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
3: Column-generation for a two-dimensional multi-criteria bin-packing problem
4: Hitting Geodesic Intervals in Structurally Restricted Graphs
5: Sorting with constraints
6: Fixed-Parameter Tractable Submodular Maximization over a Matroid
7: Statistics-Friendly Confidentiality Protection for Establishment Data, with Applications to the QCEW
8: Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
9: Fast Computation of $k$-Runs, Parameterized Squares, and Other Generalised Squares
10: Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
11: Tree algorithms for set reconciliation
12: Cache Management for Mixture-of-Experts LLMs – extended version
13: Safe Memory Reclamation Techniques
14: A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows
15: Reusing Samples in Variance Reduction
16: Lower Bounds for Linear Operators
17: Efficient Dynamic Rank Aggregation
18: Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
19: Fast approximation algorithms for the 1-median problem on real-world large graphs
20: Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
21: Compressed Dictionary Matching on Run-Length Encoded Strings
22: How fast can you find a good hypothesis?
23: Transitivity Preserving Projection in Directed Hypergraphs
24: Solving Zero-Sum Games with Fewer Matrix-Vector Products
25: Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
26: A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
27: Optimal Variance and Covariance Estimation under Differential Privacy in the Add-Remove Model and Beyond
28: Parameterized Approximability for Modular Linear Equations
29: Graph Reconstruction with a Connected Components Oracle
30: On approximating the $f$-divergence between two Ising models
31: Capturing an Invisible Robber using Separators
32: Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
33: Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
34: Testing Depth First Search Numbering
35: Efficient Contractions of Dynamic Graphs – with Applications
36: List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
37: Vertex-ordering and arc-partitioning problems
38: Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
39: Scalable Learning of One-Counter Automata via State-Merging Algorithms
40: Subsequence Covers of Words
41: A Simple and Robust Protocol for Distributed Counting
42: A General Framework for Low Soundness Homomorphism Testing
43: DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers