1: Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
2: TRAPP: An Efficient Point-to-Point Path Planning Algorithm for Road Networks with Restrictions
3: Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
4: A Dynamic Tree Structure for Hierarchical On-Chain Asset Management
5: On Socially Fair Low-Rank Approximation and Column Subset Selection
6: Verifying Shortest Paths in Linear Time
7: weberknecht – a One-Sided Crossing Minimization solver
8: On the Bidirected Cut Relaxation for Steiner Forest
9: A subgradient splitting algorithm for optimization on nonpositively curved metric spaces
10: Massively Parallel Algorithms for Approximate Shortest Paths
11: NP-hardness and a PTAS for the Euclidean Steiner Line Problem
12: Streaming Private Continual Counting via Binning
13: Covered Forest: Fine-grained generalization analysis of graph neural networks
14: Parallel simulation for sampling under isoperimetry and score-based diffusion models
15: Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
16: Geometry helps in routing scalability
17: Minimum Weighted Feedback Arc Sets for Ranking from Pairwise Comparisons
18: Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach
19: A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem
20: Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
21: On the Parameterized Complexity of Diverse SAT
22: Private Synthetic Data Generation in Small Memory
23: Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
24: Fast FPT Algorithms for Grundy Number on Dense Graphs
25: Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
26: Fast and Lightweight Distributed Suffix Array Construction – First Results
27: HashEvict: A Pre-Attention KV Cache Eviction Strategy using Locality-Sensitive Hashing
28: Single-Source Regular Path Querying in Terms of Linear Algebra
29: The Correlated Gaussian Sparse Histogram Mechanism
30: Computational Explorations of Total Variation Distance
31: Differentially Private Multi-Sampling from Distributions
32: Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach
33: Optimal Static Dictionary with Worst-Case Constant Query Time
34: Bi-Criteria Metric Distortion
35: Stochastic $k$-Submodular Bandits with Full Bandit Feedback
36: Breaking the Barrier: A Polynomial-Time Polylogarithmic Approximation for Directed Steiner Tree
37: Fixed Order Scheduling with Deadlines
38: Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach