1: Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
2: Shifted Composition IV: Underdamped Langevin and Numerical Discretizations with Partial Acceleration
3: Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
4: Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
5: Parameterized Critical Node Cut Revisited
6: Planar Multiway Cut with Terminals on Few Faces
7: Efficient Resource Allocation under Adversary Attacks: A Decomposition-Based Approach
8: Sampling and Identity-Testing Without Approximate Tensorization of Entropy
9: Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
10: Simple Approximations for General Spanner Problems
11: Optimized methods for composite optimization: a reduction perspective
12: A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
13: Segmented Operations using Matrix Multiplications
14: $\sigma$-Maximal Ancestral Graphs