1: Parallel PLL on DAGs
2: Structural Parameters for Steiner Orientation
3: Online Edge Coloring: Sharp Thresholds
4: Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
5: Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
6: Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
7: Settling Weighted Token Swapping up to Algorithmic Barriers
8: Deterministic Longest Common Subsequence Approximation in Near-Linear Time
9: BlockFIFO & MultiFIFO: Scalable Relaxed Queues
10: Competitive Bundle Trading
11: The Squishy Grid Problem
12: Efficient algorithm for linear diophantine equations in two variables
13: Scalable contribution bounding to achieve privacy
14: Online Combinatorial Allocation with Interdependent Values
15: Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions