{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:22Z","timestamp":1740122422071,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T00:00:00Z","timestamp":1513209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-017-0238-6","type":"journal-article","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T16:48:01Z","timestamp":1513270081000},"page":"1315-1332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding disjoint paths on edge-colored graphs: more tractability results"],"prefix":"10.1007","volume":"36","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2670-6258","authenticated-orcid":false,"given":"Florian","family":"Sikora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,14]]},"reference":[{"issue":"1\u20132","key":"238_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237(1\u20132):123\u2013134","journal-title":"Theor Comput Sci"},{"issue":"4","key":"238_CR2","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon N, Yuster R, Zwick U (1995) Color-coding. J ACM 42(4):844\u2013856","journal-title":"J ACM"},{"issue":"1","key":"238_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/a6010001","volume":"6","author":"P Bonizzoni","year":"2013","unstructured":"Bonizzoni P, Dondi R, Pirola Y (2013) Maximum disjoint paths on edge-colored graphs: approximability and tractability. Algorithms 6(1):1\u201311","journal-title":"Algorithms"},{"key":"238_CR4","doi-asserted-by":"crossref","unstructured":"Chen Y, Grohe M, Gr\u00fcber M (2006) On parameterized approximability. In Bodlaender HL, Langston, MA (eds) Proceedings of parameterized and exact computation (IWPEC 2006), vol 4169 of LNCS. Springer, pp 109\u2013120","DOI":"10.1007\/11847250_10"},{"key":"238_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan M, Fomin FV, Kowalik L, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, Berlin"},{"key":"238_CR6","doi-asserted-by":"crossref","unstructured":"Dondi R, Sikora F ( 2016) Finding disjoint paths on edge-colored graphs: a multivariate complexity analysis. In: Chan, TH, Li, M, Wang, L (eds) Proceedings of the 10th international conference combinatorial optimization and applications COCOA, vol 10043 of LNCS. Springer, pp 113\u2013127","DOI":"10.1007\/978-3-319-48749-6_9"},{"key":"238_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey RG, Fellows MR (2013) Fundamentals of parameterized complexity. Springer, Berlin"},{"issue":"3","key":"238_CR8","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"MR Fellows","year":"2013","unstructured":"Fellows MR, Jansen BMP, Rosamond FA (2013) Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur J Comb 34(3):541\u2013566","journal-title":"Eur J Comb"},{"issue":"1","key":"238_CR9","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.disopt.2010.09.009","volume":"8","author":"PA Golovach","year":"2011","unstructured":"Golovach PA, Thilikos DM (2011) Paths of bounded length and their cuts: parameterized complexity and algorithms. Discret Optim 8(1):72\u201386","journal-title":"Discret Optim"},{"issue":"2","key":"238_CR10","first-page":"57","volume":"14","author":"L Gourv\u00e8s","year":"2012","unstructured":"Gourv\u00e8s L, de Lyra AR, Martinhon CAJ, Monnot J (2012) On paths, trails and closed trails in edge-colored graphs. Discret Math Theor Comput Sci 14(2):57\u201374","journal-title":"Discret Math Theor Comput Sci"},{"key":"238_CR11","first-page":"340","volume-title":"The SAGE handbook of social network analysis","author":"R Hanneman","year":"2011","unstructured":"Hanneman R, Riddle M (2011) Introduction to social network methods. In: Scott J, Carrington PJ (eds) The SAGE handbook of social network analysis. SAGE Publications Ltd, Thousand Oaks, pp 340\u2013369"},{"key":"238_CR12","doi-asserted-by":"crossref","unstructured":"Komusiewicz C, Niedermeier R (2012) New races in parameterized algorithmics. In: Rovan, B, Sassone, V, Widmayer, P (eds) Proceedings of mathematical foundations of computer science (MFCS 2012), vol 7464 of LNCS, Springer, pp 19\u201330","DOI":"10.1007\/978-3-642-32589-2_2"},{"issue":"1","key":"238_CR13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx D (2008) Parameterized complexity and approximation algorithms. Comput J 51(1):60\u201378","journal-title":"Comput J"},{"issue":"1","key":"238_CR14","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.jcss.2012.09.001","volume":"79","author":"D Marx","year":"2013","unstructured":"Marx D (2013) Completely inapproximable monotone and antimonotone parameterized problems. J Comput Syst Sci 79(1):144\u2013151","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"238_CR15","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1007\/s10878-016-0003-2","volume":"33","author":"RF Santos","year":"2017","unstructured":"Santos RF, Andrioni A, Drummond AC, Xavier EC (2017) Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks. J Comb Optim 33(2):742\u2013778","journal-title":"J Comb Optim"},{"key":"238_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications (structural analysis in the social sciences)","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications (structural analysis in the social sciences). Cambridge University Press, Cambridge"},{"issue":"1","key":"238_CR17","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.disopt.2012.01.002","volume":"9","author":"BY Wu","year":"2012","unstructured":"Wu BY (2012) On the maximum disjoint paths problem on edge-colored graphs. Discret Optim 9(1):50\u201357","journal-title":"Discret Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0238-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0238-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0238-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T21:35:02Z","timestamp":1570484102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0238-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,14]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["238"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0238-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,12,14]]}}}