1: On Euclidean $k$-Means Clustering with $\alpha$-Center Proximity
2: Restricted Max-Min Fair Allocation
3: A QPTAS for Gapless MEC
4: A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
5: How good are Popular Matchings?
6: On the Enumeration of Maximal $(\Delta, \gamma)$-Cliques of a Temporal Network
7: A Subquadratic Algorithm for 3XOR
8: Colouring $(P_r+P_s)$-Free Graphs
9: A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter
10: The clustered Sparrow algorithm