1. Abel U., Carstens H.G., Deuber W., Prömel H.J.: Time Dependent and Hypergraphic Networks. Technical Report, Fakultät für Mathematik, Universität Bielefeld. Part of this report appeared as: “On Hypergraphic Networks” in Operations Research Verfahren 32(1979), 1–4 (1978)
2. Baier, G.: Flows with Path Restrictions. Ph.D. thesis, TU Berlin (2003)
3. Baier, G., Erlebach, T., Hall, A., Kolman, P., Köhler, E., Pangrac, O., Schilling, H., Skutella, M.: Length-bounded cuts and flows. To appear in Transactions on Algorithms; an extended abstract appears in Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP’06), LNCS 4051, Springer, Berlin, pp. 679–690 (2006)
4. Ben-Ameur W.: Constrained length connectivity and survivable networks. Networks 36, 17–33 (2000)
5. Bley, A. (1997) Node-Disjoint Length-Restricted Paths. Master’s thesis, TU Berlin