1: Yet Another Graph Partitioning Problem is NP-Hard
2: Optimum matchings in weighted bipartite graphs
3: A Polynomial-time Algorithm for Outerplanar Diameter Improvement
4: Sample-Optimal Fourier Sampling in Any Constant Dimension – Part I
5: Probabilistic Analysis of Power Assignments
6: Revisiting Size-Based Scheduling with Estimated Job Sizes
7: Differentially Private Convex Optimization with Piecewise Affine Objectives
8: Brief Announcement: Almost-Tight Approximation Distributed Algorithm for Minimum Cut
9: Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
10: On the Computational Complexity of Vertex Integrity and Component Order Connectivity
11: Finding Shortest Paths between Graph Colourings
12: How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms
13: Pivot Sampling in Dual-Pivot Quicksort
14: Facility Location in Evolving Metrics
15: The Sketching Complexity of Graph Cuts
16: O(log log rank) Competitive-Ratio for the Matroid Secretary Problem