1: Continuous optimization methods for the graph isomorphism problem
2: Space-Efficient Data Structures for Polyominoes and Bar Graphs
3: New Approximation Bounds for Small-Set Vertex Expansion
4: Node Connectivity Augmentation of Highly Connected Graphs
5: Extension of Minimax for Algorithmic Lower Bounds
6: Lower Bounds on Adaptive Sensing for Matrix Recovery
7: Asynchronous Merkle Trees
8: Dynamic Programming Algorithms for Discovery of Antibiotic Resistance in Microbial Genomes
9: An Efficient Algorithm for Unbalanced 1D Transportation
10: The Symmetric alpha-Stable Privacy Mechanism
11: A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies
12: Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions
13: Sparsifying generalized linear models
14: Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$-$t$ Shortest Path, and Minimum-Cost Flow