On the difficulty of some shortest path problems | ACM Transactions on Algorithms (TALG) | DeepDyve