1: Distance Approximating Minors for Planar and Minor-Free Graphs
2: Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries
3: Hyperbolic Sets in Incomplete Tables
4: Theory Meets Practice for Bit Vectors Supporting Rank and Select
5: Sketching approximations and LP approximations for finite CSPs are related
6: Supersimulators
7: Precoloring extension with demands on paths
8: GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices
9: Optimization of Base-n Radix Sort for Skewed Datasets
10: Linear Regression under Missing or Corrupted Coordinates
11: A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
12: Efficient $\varepsilon$-approximate minimum-entropy couplings
13: A Better-Than-$5/4$-Approximation for Two-Edge Connectivity
14: Non-Clairvoyant Scheduling with Progress Bars
15: SS-GUMAP, SL-GUMAP, SSSL-GUMAP: Fast UMAP Algorithms for Large Graph Drawing
16: ALNS for Tugboat Scheduling in Inland Waterway
17: Geometric Interpretation of 3-SAT and Phase Transition
18: BH-tsNET, FIt-tsNET, L-tsNET: Fast tsNET Algorithms for Large Graph Drawing
19: Stealing From the Dragon’s Hoard: Online Unbounded Knapsack With Removal
20: No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
21: Dequantization and Hardness of Spectral Sum Estimation
22: Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models
23: Testable algorithms for approximately counting edges and triangles in sublinear time and space
24: Average-Case Complexity of Quantum Stabilizer Decoding
25: Actively Learning Halfspaces without Synthetic Data
26: Learning Ising Models under Hard Constraints using One Sample
27: New Algorithmic Directions in Optimal Transport and Applications for Product Spaces
28: New Parallel and Streaming Algorithms for Directed Densest Subgraph
29: Stable coresets: Unleashing the power of uniform sampling
30: Orientation does not help with 3-coloring a grid in online-LOCAL
31: Less is More: Faster Maximum Clique Search by Work-Avoidance
32: Online Firefighting on Cactus Graphs
33: Fine-Grained Classification Of Detecting Dominating Patterns
34: High-dimensional quantum Schur transforms
35: Computing k-mers in Graphs
36: Sample-efficient Multiclass Calibration under $\ell_{p}$ Error
37: Sparse Graph Reconstruction and Seriation for Large-Scale Image Stacks
38: Finding the diameter of a tree with distance queries
39: Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming
40: Stochastic Embedding of Digraphs into DAGs
41: Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
42: A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs
43: Hardness and Algorithmic Results for Roman {3}-Domination
44: Parallel Algorithms for the One Sided Crossing Minimization Problem