{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:45:35Z","timestamp":1773243935054,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00224-007-9068-8","type":"journal-article","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T16:49:02Z","timestamp":1196441342000},"page":"56-66","source":"Crossref","is-referenced-by-count":10,"title":["Maximum k-Splittable s,t-Flows"],"prefix":"10.1007","volume":"43","author":[{"given":"Ronald","family":"Koch","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]},{"given":"Ines","family":"Spenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,1]]},"reference":[{"key":"9068_CR1","volume-title":"Network Flows. Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"9068_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discrete Methods 8, 277\u2013284 (1987)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"9068_CR3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"9068_CR4","first-page":"246","volume-title":"Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA03)","author":"A. Bagchi","year":"2003","unstructured":"Bagchi, A., Chaudhary, A., Kolman, P.: Short length Menger\u2019s theorem and reliable optical routing. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA03), pp. 246\u2013247. ACM, New York (2003)"},{"key":"9068_CR5","first-page":"265","volume-title":"Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures","author":"A. Bagchi","year":"2002","unstructured":"Bagchi, A., Chaudhary, A., Kolman, P., Scheideler, C.: Algorithms for fault-tolerant routing in circuit-switched networks. In: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 265\u2013274. ACM, New York (2002)"},{"key":"9068_CR6","unstructured":"Baier, G.: Flows with path restrictions. Ph.D. thesis, TU Berlin (2003)"},{"key":"9068_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00453-005-1167-9","volume":"42","author":"G. Baier","year":"2005","unstructured":"Baier, G., K\u00f6hler, E., Skutella, M.: On the k-splittable flow problem. Algorithmica 42, 231\u2013248 (2005)","journal-title":"Algorithmica"},{"issue":"3\u20134","key":"9068_CR8","first-page":"131","volume":"12","author":"A. Bley","year":"2004","unstructured":"Bley, A.: On the complexity of vertex-disjoint length-restricted path problems. Comput. Complex. 12(3\u20134), 131\u2013149 (2004)","journal-title":"Comput. Complex."},{"key":"9068_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Proceedings of the 15th International Colloquium on Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs of bounded treewidth. In: Proceedings of the 15th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 317, pp. 105\u2013118. Springer, Berlin (1988)"},{"key":"9068_CR10","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"9068_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ruzicka, P. (eds.) Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 1295, pp. 19\u201336. Springer, Berlin (1997)"},{"key":"9068_CR12","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"9068_CR13","unstructured":"Hagerup, T., Katajainen, J., Nishimura, N., Ragde, P.: Characterizations of k-terminal flow networks and computing network flows in partial k-trees. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 641\u2013649 (1995)"},{"key":"9068_CR14","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, MIT (1996)"},{"key":"9068_CR15","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.tcs.2006.09.015","volume":"369","author":"R. Koch","year":"2006","unstructured":"Koch, R., Spenke, I.: Complexity and approximability of k-splittable flows. Theor. Comput. Sci. 369, 338\u2013347 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9068_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1007\/978-3-540-45138-9_44","volume-title":"Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science","author":"P. Krysta","year":"2003","unstructured":"Krysta, P., Sanders, P., V\u00f6cking, B.: Scheduling and traffic allocation for tasks with bounded splittability. In: Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 2747, pp. 500\u2013510. Springer, Berlin (2003)"},{"key":"9068_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/978-3-540-30140-0_47","volume-title":"Algorithms\u2014ESA \u201904","author":"M. Martens","year":"2004","unstructured":"Martens, M., Skutella, M.: Flows on few paths: Algorithms and lower bounds. In: Albers, S., Radzik, T. (eds.) Algorithms\u2014ESA \u201904. Lecture Notes in Computer Science, vol. 3221, pp. 520\u2013531. Springer, Berlin (2004)"},{"key":"9068_CR18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-32539-5_47","volume-title":"Proceedings of the International Scientific Annual Conference on Operations Research 2005","author":"M. Martens","year":"2006","unstructured":"Martens, M., Skutella, M.: Length-bounded and dynamic k-splittable flows. In: Proceedings of the International Scientific Annual Conference on Operations Research 2005, pp. 297\u2013302. Springer, Berlin (2006)"},{"key":"9068_CR19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of treewidth. J. Algorithms 7, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"9068_CR20","unstructured":"Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical report 396, TU Berlin, Fachbereich 3 Mathematik (1994)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9068-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9068-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9068-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:35Z","timestamp":1558698695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9068-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9068"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9068-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,1]]}}}