1: Smoothness of Schatten Norms and Sliding-Window Matrix Streams
2: Efficient Construction of Functional Representations for Quantum Algorithms
3: Local Problems on Grids from the Perspective of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
4: A Polynomial-Time Algorithm for Special Cases of the Unbounded Subset-Sum Problem
5: Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs
6: Byzantine-tolerant Distributed Grow-only Sets: Specification and Applications
7: HighDist Framework: Algorithms and Applications
8: On Linear Solution of “Cherry Pickup II”. Max Weight of Two Disjoint Paths in Node-Weighted Gridlike DAG
9: Vertex Deletion Parameterized by Elimination Distance and Even Less
10: On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem
11: Lower Bounds on the Size of General Branch-and-Bound Trees
12: Compact enumeration for scheduling one machine
13: Locality of Random Digraphs on Expanders
14: Regularized Non-monotone Submodular Maximization
15: A graph theoretical approach to the firebreak locating problem
16: Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case
17: Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications
18: Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More
19: A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations
20: Local Computation Algorithms for Coloring of Uniform Hypergraphs
21: Preprocessing power weighted shortest path data using a s-Well Separated Pair Decomposition
22: ANITA: An Optimal Loopless Accelerated Variance-Reduced Gradient Method