1: Emit As You Go: Enumerating Edges of a Spanning Tree
2: Interval Selection with Binary Predictions
3: On Incremental Approximate Shortest Paths in Directed Graphs
4: Customizable Contraction Hierarchies – A Survey
5: Algorithms and Hardness for Estimating Statistical Similarity
6: Local Gibbs sampling beyond local uniformity
7: Light Edge Fault Tolerant Graph Spanners
8: Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
9: Probabilistic analysis of arithmetic coding showing its robustness
10: The Bathroom Model: A Realistic Approach to Hash Table Algorithm Optimization
11: New Rates in Stochastic Decision-Theoretic Online Learning under Differential Privacy
12: Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
13: A linear-time algorithm computing the resident fitness in interacting trajectories
14: Cheesemap: A High-Performance Point-Indexing Data Structure for Neighbor Search in LiDAR Data
15: On a tree-based variant of bandwidth and forbidding simple topological minors
16: On the Locality of the Lov'asz Local Lemma
17: Private Synthetic Graph Generation and Fused Gromov-Wasserstein Distance
18: Parameterised algorithms for temporal reconfiguration problems
19: Logarithmic Approximation for Road Pricing on Grids
20: Algorithm Engineering of SSSP With Negative Edge Weights
21: ~Optimal Algorithm for Fully Dynamic LZ77
22: Computational-Statistical Tradeoffs at the Next-Token Prediction Barrier: Autoregressive and Imitation Learning under Misspecification
23: GPU Memory Usage Optimization for Backward Propagation in Deep Network Training
24: Min-Max Correlation Clustering via Neighborhood Similarity
25: Maximizing Value in Challenge the Champ Tournaments
26: Revisiting Token Sliding on Chordal Graphs
27: Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
28: Finding Maximum Weight 2-Packing Sets on Arbitrary Graphs
29: On the Complexity of Minimising the Moving Distance for Dispersing Objects
30: Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
31: Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
32: Smoothed Analysis of Dynamic Graph Algorithms
33: Improving Algorithmic Efficiency using Cryptography
34: Sum-Of-Squares To Approximate Knapsack
35: Graph-Based Algorithms for Diverse Similarity Search
36: Slant/Gokigen Naname is NP-complete, and Some Variations are in P
37: Faster Minimization of Total Weighted Completion Time on Parallel Machines
38: Semi-Streaming Algorithms for Hypergraph Matching
39: A Query-Driven Approach to Space-Efficient Range Searching
40: FPT algorithms over linear delta-matroids with applications
41: Learning from End User Data with Shuffled Differential Privacy over Kernel Densities
42: Structural Parameterizations for Induced and Acyclic Matching
43: Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leiblier Maillard Sampling
44: Sharp Phase Transitions in Estimation with Low-Degree Polynomials
45: LEIT-motifs: Scalable Motif Mining in Multidimensional Time Series
46: U-index: A Universal Indexing Framework for Matching Long Patterns
47: OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
48: Enumerating minimal dominating sets and variants in chordal bipartite graphs
49: Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
50: Condorcet Winners and Anscombes Paradox Under Weighted Binary Voting
51: Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination
52: Byzantine Game Theory: Sun Tzus Boxes
53: Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations
54: Streaming Maximal Matching with Bounded Deletions
55: Improved Sublinear-time Moment Estimation using Weighted Sampling
56: Efficient and Provable Algorithms for Covariate Shift
57: Optimal Distributed Replacement Paths
58: Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries