{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:42:31Z","timestamp":1781552551179,"version":"3.54.5"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319946665","type":"print"},{"value":"9783319946672","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94667-2_20","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T07:56:24Z","timestamp":1530604584000},"page":"237-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Parameterized Complexity of Colorful Components and Related Problems"],"prefix":"10.1007","author":[{"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-19315-1_2","volume-title":"Combinatorial Algorithms","author":"A Adamaszek","year":"2015","unstructured":"Adamaszek, A., Blin, G., Popa, A.: Approximation and hardness results for the maximum edges in transitive closure problem. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 13\u201323. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19315-1_2"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00453-014-9926-0","volume":"73","author":"A Adamaszek","year":"2015","unstructured":"Adamaszek, A., Popa, A.: Algorithmic and hardness results for the colorful components problems. Algorithmica 73(2), 371\u2013388 (2015)","journal-title":"Algorithmica"},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42(4), 844\u2013856 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1\u20133","key":"20_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2007.02.026","volume":"377","author":"A Avidor","year":"2007","unstructured":"Avidor, A., Langberg, M.: The multi-multiway cut problem. Theor. Comput. Sci 377(1\u20133), 35\u201342 (2007)","journal-title":"Theor. Comput. Sci"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Daligault, J., Thomass\u00e9, S.: Multicut is FPT. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, pp. 459\u2013468. ACM (2011)","DOI":"10.1145\/1993636.1993698"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1089\/cmb.2009.0170","volume":"17","author":"S Bruckner","year":"2010","unstructured":"Bruckner, S., H\u00fcffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-free querying of protein interaction networks. J. Comput. Biol. 17(3), 237\u2013252 (2010)","journal-title":"J. Comput. Biol."},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-38527-8_17","volume-title":"Experimental Algorithms","author":"S Bruckner","year":"2013","unstructured":"Bruckner, S., H\u00fcffner, F., Komusiewicz, C., Niedermeier, R.: Evaluation of ILP-based approaches for partitioning into colorful components. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 176\u2013187. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_17"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-31265-6_5","volume-title":"Combinatorial Pattern Matching","author":"S Bruckner","year":"2012","unstructured":"Bruckner, S., H\u00fcffner, F., Komusiewicz, C., Niedermeier, R., Thiel, S., Uhlmann, J.: Partitioning into colorful components by minimum edge deletions. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 56\u201369. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31265-6_5"},{"issue":"8","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1093\/bioinformatics\/btq082","volume":"26","author":"E Corel","year":"2010","unstructured":"Corel, E., Pitschi, F., Morgenstern, B.: A min-cut algorithm for the consistency problem in multiple sequence alignment. Bioinformatics 26(8), 1015\u20131021 (2010)","journal-title":"Bioinformatics"},{"key":"20_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Springer Graduate Text GTM 173. Reinhard Diestel, July 2012","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-40189-8_27","volume-title":"Pursuit of the Universal","author":"R Dondi","year":"2016","unstructured":"Dondi, R., Sikora, F.: Parameterized complexity and approximation issues for the colorful components problems. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 261\u2013270. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40189-8_27"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","volume":"77","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4), 799\u2013811 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/s00453-011-9600-8","volume":"65","author":"S Guillemot","year":"2013","unstructured":"Guillemot, S., Sikora, F.: Finding and counting vertex-colored subtrees. Algorithmica 65(4), 828\u2013844 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/110855247","volume":"43","author":"D Marx","year":"2014","unstructured":"Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. SIAM J. Comput. 43(2), 355\u2013388 (2014)","journal-title":"SIAM J. Comput."},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-23038-7_30","volume-title":"Algorithms in Bioinformatics","author":"C Zheng","year":"2011","unstructured":"Zheng, C., Swenson, K., Lyons, E., Sankoff, D.: OMG! Orthologs in multiple genomes \u2013 competing graph-theoretical formulations. In: Przytycka, T.M., Sagot, M.-F. (eds.) WABI 2011. LNCS, vol. 6833, pp. 364\u2013375. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23038-7_30"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T08:08:57Z","timestamp":1571558937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}