1: Learned Monotone Minimal Perfect Hashing
2: High-Accuracy Multicommodity Flows via Iterative Refinement
3: Euclidean Capacitated Vehicle Routing in Random Setting: A $1.55$-Approximation Algorithm
4: The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination
5: Covering multigraphs with bipartite graphs
6: Sorting wild pigs
7: Low-Memory Algorithms for Online and W-Streaming Edge Coloring
8: Median of heaps: linear-time selection by recursively constructing binary heaps
9: Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction
10: Towards Generating Hop-constrained s-t Simple Path Graphs
11: An Approximation Algorithm for Covering Vertices by 4^+-Paths
12: Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing
13: Alternating Local Enumeration (TnALE): Solving Tensor Network Structure Search with Fewer Evaluations
14: The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits
15: Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques
16: An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover
17: Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism
18: An Improved Modular Addition Checksum Algorithm
19: Efficient Approximation for Subgraph-Hitting Problems in Sparse Graphs and Geometric Intersection Graphs
20: Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
21: Improved Stabilizer Estimation via Bell Difference Sampling
22: An FPTAS for Budgeted Laminar Matroid Independent Set
23: A barrier for further approximating Sorting By Transpositions
24: Improved Online Scheduling of Moldable Task Graphs under Common Speedup Models
25: Compact Distance Oracles with Large Sensitivity and Low Stretch
26: Mean Estimation Under Heterogeneous Privacy: Some Privacy Can Be Free
27: Fast Sampling of $b$-Matchings and $b$-Edge Covers
28: On Solution Discovery via Reconfiguration
29: The Covering Canadian Traveller Problem Revisited
30: A Simple and Efficient Parallel Laplacian Solver
31: Approximate Nearest Neighbor for Polygonal Curves under Fr'echet Distance
32: Structural Parameterizations for Two Bounded Degree Problems Revisited
33: Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra