{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:31Z","timestamp":1725541951071},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_14","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"165-175","source":"Crossref","is-referenced-by-count":0,"title":["A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks"],"prefix":"10.1007","author":[{"given":"Maxim A.","family":"Babenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignat I.","family":"Kolesnichenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya P.","family":"Razenshteyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Stein, C., Rivest, R., Leiserson, C.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)"},{"key":"14_CR2","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.dam.2003.12.003","volume":"143","author":"D. Marx","year":"2004","unstructured":"Marx, D.: Eulerian Disjoint Paths Problem in Grid Graphs is NP-Complete. Discrete Applied Mathematics\u00a0143, 336\u2013341 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors\u00a0XIII. The Disjoint Paths Problem. Journal of Combinatorial Theory (Series\u00a0B)\u00a063, 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory (Series\u00a0B)"},{"key":"14_CR5","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)"},{"issue":"3","key":"14_CR6","first-page":"445","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Shiloach, Y.: A Polynomial Solution to the Undirected Two Paths Problem. J.\u00a0ACM\u00a027(3), 445\u2013456 (1980)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y. Shiloach","year":"1978","unstructured":"Shiloach, Y., Perl, Y.: Finding Two Disjoint Paths between Two Pairs of Vertices in a Graph. J. ACM\u00a025(1), 1\u20139 (1978)","journal-title":"J. ACM"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/978-3-540-24749-4_31","volume-title":"STACS 2004","author":"T. Tholey","year":"2004","unstructured":"Tholey, T.: Solving the 2-Disjoint Paths Problem in Nearly Linear Time. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 350\u2013361. Springer, Heidelberg (2004)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-95891-8_49","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"T. Tholey","year":"2009","unstructured":"Tholey, T.: Improved Algorithms for the 2-Vertex Disjoint Paths Problem. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 546\u2013557. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T22:52:07Z","timestamp":1552258327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}