1: Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
2: Computing the Tutte polynomial in vertex-exponential time
3: Finding a Feasible Flow in a Strongly Connected Network
4: Improved Fully Dynamic Reachability Algorithm for Directed Graph