1: Sample-Optimal Private Regression in Polynomial Time
2: On Speedups for Convex Optimization via Quantum Dynamics
3: Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
4: How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
5: Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time
6: Linked Array Tree: A Constant-Time Search Structure for Big Data
7: LimTDD: A Compact Decision Diagram Integrating Tensor and Local Invertible Map Representations
8: SplineSketch: Even More Accurate Quantiles with Error Guarantees
9: Computing Time-varying Network Reliability using Binary Decision Diagrams
10: Diameter Shortcut Sets on Temporal Graphs
11: Generalized Assignment and Knapsack Problems in the Random-Order Model
12: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
13: Cutwidth Bounds via Vertex Partitions
14: Shared-Memory Hierarchical Process Mapping
15: Distributed Triangle Detection is Hard in Few Rounds
16: A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
17: Quantum Gibbs states are locally Markovian
18: Efficient Computation of Hyper-triangles on Hypergraphs
19: Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing
20: On the twin-width of near-regular graphs
21: Interval Graphs are Reconstructible
22: Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
23: Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
24: Edge-weighted balanced connected partitions: Hardness and formulations
25: Mind the Gap? Not for SVP Hardness under ETH!
26: Computing High-dimensional Confidence Sets for Arbitrary Distributions
27: Faster Mixing of the Jerrum-Sinclair Chain
28: Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
29: Beating full state tomography for unentangled spectrum estimation
30: Dynamic Treewidth in Logarithmic Time
31: Towards Optimal Distributed Delta Coloring
32: An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
33: A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances
34: Improved Circular Dictionary Matching
35: Rapid Mixing on Random Regular Graphs beyond Uniqueness
36: Local Search for Clustering in Almost-linear Time
37: Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
38: Quantum Search with In-Place Queries
39: Tight analysis of the primal-dual method for edge-covering pliable set families
40: Operational research approaches and mathematical models for kidney exchange: A literature survey and empirical evaluation
41: Optimal Smoothed Analysis of the Simplex Method
42: Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
43: Efficient Rejection Sampling in the Entropy-Optimal Range
44: AbsInf: A Lightweight Object to Represent float(‘inf’) in Dijkstra’s Algorithm
45: Binned Group Algebra Factorization for Differentially Private Continual Counting
46: Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
47: Online Facility Assignments on Polygons
48: New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
49: Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses
50: Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
51: Automating the Search for Small Hard Examples to Approximation Algorithms
52: The Complexity of Maximal Common Subsequence Enumeration
53: A Customized SAT-based Solver for Graph Coloring
54: The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
55: Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases and Beyond