1: Separating MAX 2-AND, MAX DI-CUT and MAX CUT
2: A Nearly Tight Bound for Fitting an Ellipsoid to Gaussian Random Points
3: Count-Free Weisfeiler–Leman and Group Isomorphism
4: Adaptive and Dynamic Multi-Resolution Hashing for Pairwise Summations
5: Parameterizing Path Partitions
6: Some Results on Approximability of Minimum Sum Vertex Cover
7: GraphTango: A Hybrid Representation Format for Efficient Streaming Graph Updates and Analysis
8: Bridge Girth: A Unifying Notion in Network Design
9: On Differentially Private Counting on Trees
10: Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two
11: Matching Cuts in Graphs of High Girth and H-Free Graphs
12: A Cut-and-solve Algorithm for Virtual Machine Consolidation Problem
13: Tight Bounds for Connectivity Problems Parameterized by Cutwidth
14: Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant
15: Testing Distributions of Huge Objects
16: A Note on Improved Results for One Round Distributed Clique Listing
17: Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
18: Constant ratio FPT approximation of hypertree width parameters for hypergraphs of bounded rank
19: A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
20: Invertible Bloom Lookup Tables with Listing Guarantees