1: Optimizing Periodic Operations for Efficient Inland Waterway Lock Management
2: Semirandom Planted Clique via 1-norm Isometry Property
3: Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
4: Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
5: Continuous Map Matching to Paths under Travel Time Constraints
6: Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
7: Tight simulation of a distribution using conditional samples
8: Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
9: Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
10: Semidefinite Programming for the Asymmetric Stochastic Block Model
11: Universal Solvability for Robot Motion Planning on Graphs
12: Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors
13: Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method
14: Subcoloring of (Unit) Disk Graphs
15: phylo2vec: a library for vector-based phylogenetic tree manipulation
16: Approximating Submodular Matroid-Constrained Partitioning
17: All-Pairs Shortest Paths with Few Weights per Node
18: Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
19: LZSE: an LZ-style compressor supporting $O(\log n)$-time random access
20: Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data
21: Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
22: Cut-Query Algorithms with Few Rounds
23: Review of Three Algorithms That Build k-d Trees
24: A Framework for Building Data Structures from Communication Protocols
25: Practical and Accurate Local Edge Differentially Private Graph Algorithms
26: Almost Tight Additive Guarantees for \boldmath $k$-Edge-Connectivity
27: Thinning to improve two-sample discrepancy
28: Courcelle’s Theorem for Lipschitz Continuity
29: On Minimizing Wiggle in Stacked Area Charts
30: Edge Clique Partition and Cover Beyond Independence
31: Guarding Offices with Maximum Dispersion
32: Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
33: Succinct Preferential Attachment Graphs
34: Computing Maximum Cliques in Unit Disk Graphs
35: INTACT: Compact Storage of Data Streams in Mobile Devices to Unlock User Privacy at the Edge
36: Fault-Tolerant Matroid Bases
37: Parameterized Complexity of Directed Traveling Salesman Problem
38: Shortest Paths in Multimode Graphs
39: Faster exponential algorithms for cut problems via geometric data structures
40: Inventory Control Using a L'evy Process for Evaluating Total Costs under Intermittent Demand
41: Computational Verification of the Buratti–Horak–Rosa Conjecture for Small Integers and Inductive Approaches
42: On Fine-Grained Distinct Element Estimation
43: On Finding $\ell$-th Smallest Perfect Matchings
44: A Rigorous Error Bound for the TG Kernel in Prime Counting
45: Lower bounds for trace estimation via Block Krylov and other methods
46: Counting distinct (non-)crossing substrings
47: Tight Additive Sensitivity on LZ-style Compressors and String Attractors