1: Reconstructing Riemannian Metrics From Random Geometric Graphs
2: Efficient Dynamic MaxFlow Computation on GPUs
3: A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
4: No Price Tags? No Problem: Query Strategies for Unpriced Information
5: Halfspaces are hard to test with relative error
6: Sparse Linear Regression is Easy on Random Supports
7: Spanning and Metric Tree Covers Parameterized by Treewidth
8: Coloring Reconfiguration under Color Swapping
9: UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
10: Improved Approximation for Ranking on General Graphs
11: The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof
12: Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
13: Improved Tree Sparsifiers in Near-Linear Time
14: Acceleration for Distributed Transshipment and Parallel Maximum Flow
15: Nearly-Optimal Private Selection via Gaussian Mechanism
16: Revisiting Chazelle’s Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
17: Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
18: A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
19: A Learning Perspective on Random-Order Covering Problems
20: On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
21: Dynamic Set Cover with Worst-Case Recourse
22: The Landscape of Almost Equitable Allocations
23: Language Generation with Infinite Contamination
24: A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros
25: Testing noisy low-degree polynomials for sparsity
26: Model-agnostic super-resolution in high dimensions
27: Deterministic Padded Decompositions and Negative-Weight Shortest Paths
28: Parallel Sampling via Autospeculation
29: Graph Classes Closed under Self-intersection
30: Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
31: Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
32: Fair Multi-agent Persuasion with Submodular Constraints
33: Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
34: Universal Connection Schedules for Reconfigurable Networking
35: A Simple Analysis of Ranking in General Graphs
36: Space-Efficient and Output-Sensitive Algorithms for the Longest Common Bitonic Subsequence
37: A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
38: No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
39: Prophet and Secretary at the Same Time
40: Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
41: A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
42: Is nasty noise actually harder than malicious noise?
43: Learning Intersections of Two Margin Halfspaces under Factorizable Distributions
44: Hardness of Dynamic Tree Edit Distance and Friends
45: Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
46: Algorithms and Complexity of Hedge Cluster Deletion Problems
47: Testing H-freeness on sparse graphs, the case of bounded expansion
48: Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
49: Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
50: Discounted Cuts: A Stackelberg Approach to Network Disruption
51: Beating Meet-in-the-Middle for Subset Balancing Problems
52: A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
53: Cycle Basis Algorithms for Reducing Maximum Edge Participation
54: R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies
55: TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
56: An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
57: Improved Differentially Private Algorithms for Rank Aggregation
58: Linear-Space Extragradient Methods for Fast, Large-Scale Optimal Transport