Our paper on lower bounds for cut sparsifiers has been accepted to IPEC 2017.
Steiner tree does not admit a subexponential algorithm in planar graphs, when parameterized by the number of terminals, but Directed Subset TSP does. Details in our new preprint.