For which values of $k$ is minimum length undirected $k$-disjoint-paths in $\mathcal{P}$?
We just answered this for $k=2$: 

Andreas Björklund and Thore Husfeldt, Shortest two disjoint paths in polynomial time, ICALP 2014, to appear.
PDF of proceedings version, rev. e5d5661