1: An optimal algorithm for average distance in typical regular graphs
2: Undirected Multicast Network Coding Gaps via Locally Decodable Codes
3: From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
4: On the Randomized Locality of Matching Problems in Regular Graphs
5: Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
6: Supermodular Maximization with Cardinality Constraints
7: Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
8: Online Two-Stage Submodular Maximization
9: Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings
10: Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP
11: A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
12: Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
13: Tight Lower Bounds for Central String Queries in Compressed Space
14: On Hardness and Approximation of Broadcasting in Sparse Graphs
15: Parallel Joinable B-Trees in the Fork-Join I/O Model
16: Optimal Rounding for Two-Stage Bipartite Matching
17: Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion
18: Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
19: $\ell_2/\ell_2$ Sparse Recovery via Weighted Hypergraph Peeling
20: From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
21: Compact representations of pattern-avoiding permutations
22: Parallel $(1+\epsilon)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
23: Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
24: A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
25: On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
26: Optimizing Feature Ordering in Radar Charts for Multi-Profile Comparison
27: A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
28: Isotropic Noise in Stochastic and Quantum Convex Optimization
29: Balancing Gradient and Hessian Queries in Non-Convex Optimization
30: Online Multi-Class Selection with Group Fairness Guarantee
31: Hardness of Approximation for Shortest Path with Vector Costs
32: A Unified Approach to Submodular Maximization Under Noise
33: Unsplittable Cost Flows from Unweighted Error-Bounded Variants
34: On the Complexity of Distributed Edge Coloring and Orientation Problems
35: Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
36: Approximate minimization of interpretations in fuzzy description logics under the G"odel semantics
37: Matchings Under Biased and Correlated Evaluations
38: Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs
39: Relative-error unateness testing
40: Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
41: O(1)-Distortion Planar Emulators for String Graphs
42: Generalized Top-k Mallows Model for Ranked Choices
43: An Optimal Density Bound for Discretized Point Patrolling
44: Quasi-Self-Concordant Optimization with Lewis Weights
45: (Approximate) Matrix Multiplication via Convolutions
46: Johnson-Lindenstrauss Lemma Beyond Euclidean Geometry
47: On Integer Programs That Look Like Paths
48: Tree Embedding in High Dimensions: Dynamic and Massively Parallel
49: Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
50: Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
51: $L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
52: Hierarchical Exponential Search Via K-Spines
53: Testing forbidden order-pattern properties on hypergrids
54: Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
55: Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
56: Coresets for Clustering Under Stochastic Noise
57: Expander Decomposition for Non-Uniform Vertex Measures
58: Pinwheel Scheduling with Real Periods
59: On Competitiveness of Dynamic Replication for Distributed Data Access