1: A variant of the multi-agent rendezvous problem
2: Boundary-to-boundary flows in planar graphs
3: Expanders with respect to Hadamard spaces and random graphs
4: Expanding the expressive power of Monadic Second-Order logic on restricted graph classes
5: On the Resilience of Bipartite Networks
6: Some Extensions of the All Pairs Bottleneck Paths Problem
7: Fourier PCA and Robust Tensor Decomposition
8: A Cubic Algorithm for Computing Gaussian Volume
9: An Optimal Heuristic for Sum of All Prime Numbers Logic for Large Inputs using RAPTOR
10: Tight Lower Bound for Linear Sketches of Moments
11: Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
12: The two-handed tile assembly model is not intrinsically universal
13: Min-Cost Flow Duality in Planar Networks