"Directed" problems that are easier than their "undirected" variant.
Counting Eulerian circuits for directed graphs is doable in polynomial time using the BEST theorem, while apparently, the same problem for undirected graphs is #P-complete.