1: Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem
2: Metrics and Ambits and Sprawls, Oh My
3: Deletion to Induced Matching
4: Structural Parameterizations of Tracking Paths Problem
5: On the Size of Minimal Separators for Treedepth Decomposition
6: Improved Weighted Additive Spanners
7: Digraphs Homomorphism Problems with Maltsev Condition
8: Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity
9: Streaming Submodular Matching Meets the Primal-Dual Method
10: A Strategic Routing Framework and Algorithms for Computing Alternative Paths
11: Lazy Queue Layouts of Posets
12: An Efficient Algorithm for Finding Sets of Optimal Routes
13: Stochastic Multi-level Composition Optimization Algorithms with Level-Independent Convergence Rates
14: Fast and Simple Modular Subset Sum
15: A Unified Framework for Light Spanners
16: Layered Drawing of Undirected Graphs with Generalized Port Constraints
17: Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost
18: Efficient Hierarchical Clustering for Classification and Anomaly Detection
19: Decentralized Asset Custody Scheme with Security against Rational Adversary
20: PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization
21: O’Reach: Even Faster Reachability in Large Graphs
22: Accelerating Force-Directed Graph Drawing with RT Cores
23: Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio
24: High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
25: A cost-scaling algorithm for computing the degree of determinants
26: Haystack Hunting Hints and Locker Room Communication
27: Vertex Ordering Algorithms for Graph Coloring Problem
28: Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
29: On the High Accuracy Limitation of Adaptive Property Estimation
30: Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
31: On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
32: Interior-point methods for unconstrained geometric programming and scaling problems
33: Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs
34: The k-interchange-constrained diameter of a transit network: A connectedness indicator that accounts for travel convenience
35: Polynomial-time trace reconstruction in the smoothed complexity model
36: Differentially Private Clustering via Maximum Coverage
37: Fast and Work-Optimal Parallel Algorithms for Predicate Detection
38: Algorithmic Persuasion with Evidence