{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:33:15Z","timestamp":1743118395618,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_37","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"441-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parametrized Complexity of Length-Bounded Cuts and Multi-cuts"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"37_CR1","first-page":"661","volume":"12","author":"J Ad\u00e1mek","year":"1971","unstructured":"Ad\u00e1mek, J., Koubek, V.: Remarks on flows in network with short paths. Commentationes Mathematicae Universitatis Carolinae 12, 661\u2013667 (1971)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1868237.1868241","volume":"7","author":"G Baier","year":"2010","unstructured":"Baier, G., Erlebach, T., Hall, A., K\u00f6hler, E., Kolman, P., Pangr\u00e1c, O., Schilling, H., Skutella, M.: Length-bounded cuts and flows. ACM Trans. Algorithms 7, 4:1\u20134:27 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"37_CR3","first-page":"194","volume-title":"Handbook of Theoretical Computer Science","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 194\u2013242. Elsevier, Amsterdam (1990)"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0167-6377(03)00026-9","volume":"32","author":"G Dahl","year":"2004","unstructured":"Dahl, G., Gouveia, L.: On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32, 15\u201322 (2004)","journal-title":"Oper. Res. Lett."},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-79723-4_9","volume-title":"Parameterized and Exact Computation","author":"M Dom","year":"2008","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated domination and covering: a parameterized perspective. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 78\u201390. Springer, Heidelberg (2008)"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5, 345 (1962)","journal-title":"Commun. ACM"},{"key":"37_CR7","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag New York Inc., Secaucus (2006)"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.disopt.2010.09.009","volume":"8","author":"PA Golovach","year":"2011","unstructured":"Golovach, P.A., Thilikos, D.M.: Paths of bounded length and their cuts: parameterized complexity and algorithms. Discrete Optim. 8, 72\u201386 (2011)","journal-title":"Discrete Optim."},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1002\/net.20146","volume":"49","author":"D Huygens","year":"2007","unstructured":"Huygens, D., Labb\u00e9, M., Mahjoub, A.R., Pesneau, P.: The two-edge connected hop-constrained network design problem: valid inequalities and branch-and-cut. Networks 49, 116\u2013133 (2007)","journal-title":"Networks"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"A Itai","year":"1982","unstructured":"Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277\u2013286 (1982)","journal-title":"Networks"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Treewidth, Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on boolean matrices. J. ACM 9, 11\u201312 (1962)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:37:51Z","timestamp":1676939871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}