1. Adámek, J., Koubek, V.: Remarks on flows in network with short paths. Comment. Math. Univ. Carolin. 12(4), 661–667 (1971)
2. Altmanová, K.: Toky cestami omezené délky. Technical report, Bachelor’s thesis, Charles University, Faculty of Mathematics and Physics, Department of Applied Mathematics (2018). (in Czech)
3. Baier, G.: Flows with path restrictions. Ph.D. thesis, TU Berlin (2003)
4. Baier, G., et al.: Length-bounded cuts and flows. ACM Trans. Algorithms 7(1), 4:1–4:27 (2010)
5. Bazgan, C., Fluschnik, T., Nichterlein, A., Niedermeier, R., Stahlberg, M.: A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. CoRR, abs/1804.09155 (2018)