1: Exact Algorithms for Clustered Planarity with Linear Saturators
2: Strongly-polynomial time and validation analysis of policy gradient methods
3: Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
4: The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
5: Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
6: Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
7: Simple Realizability of Abstract Topological Graphs
8: Sliding Block (Slick) Hashing: An Implementation & Benchmarks
9: RSVP: Beyond Weisfeiler Lehman Graph Isomorphism Test
10: Efficient Approximation of Fractional Hypertree Width
11: Graph matching based on similarities in structure and attributes
12: Parameterised Approximation and Complexity of Minimum Flow Decompositions
13: A faster algorithm for the $k$-forest problem: breaking the $O_k(n^{3/2})$ complexity barrier