{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:41:51Z","timestamp":1743043311923,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"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-90530-3_10","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"106-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximum Colorful Cycles in Vertex-Colored Graphs"],"prefix":"10.1007","author":[{"given":"Giuseppe F.","family":"Italiano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manoussakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen","family":"Kim Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong Phong","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"crossref","first-page":"P17","DOI":"10.37236\/504","volume":"18","author":"S Akbari","year":"2011","unstructured":"Akbari, S., Liaghat, V., Nikzad, A.: Colorful paths in vertex coloring of graphs. Electron. J. Comb. 18(1), P17 (2011)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"10_CR2","first-page":"73","volume":"3","author":"T Akiyama","year":"1979","unstructured":"Akiyama, T., Nishizeki, T., Saito, N.: Np-completeness of the hamiltonian cycle problem for bipartite graphs. J. Inf. Proc. 3(2), 73\u201376 (1979)","journal-title":"J. Inf. Proc."},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0020-0190(83)90078-9","volume":"17","author":"AA Bertossi","year":"1983","unstructured":"Bertossi, A.A.: Finding Hamiltonian circuits in proper interval graphs. Inf. Proc. Lett. 17(2), 97\u2013101 (1983)","journal-title":"Inf. Proc. Lett."},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.endm.2017.10.038","volume":"62","author":"J. Cohen","year":"2017","unstructured":"Cohen, J., Manoussakis, Y., Pham, H., Tuza, Z.: Tropical matchings in vertex-colored graphs. In: Latin and American Algorithms, Graphs and Optimization Symposium (2017)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-71147-8_20","volume-title":"Combinatorial Optimization and Applications","author":"J Cohen","year":"2017","unstructured":"Cohen, J., Italiano, G.F., Manoussakis, Y., Nguyen, K.T., Pham, H.P.: Tropical paths in vertex-colored graphs. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 291\u2013305. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_20"},{"issue":"8","key":"10_CR7","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"},{"issue":"4","key":"10_CR8","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."},{"key":"10_CR9","unstructured":"Foucaud, F., Harutyunyan, A., Hell, P., Legay, S., Manoussakis, Y., Naserasr, R.: Tropical homomorphisms in vertex-coloured graphs. Discrete App. Math. (to appear)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings 6th Symposium on Theory of Computing, pp. 47\u201363 (1974)","DOI":"10.1145\/800119.803884"},{"issue":"18","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/j.ipl.2009.07.010","volume":"109","author":"L Ibarra","year":"2009","unstructured":"Ibarra, L.: A simple algorithm to find Hamiltonian cycles in proper interval graphs. Inf. Proc. Lett. 109(18), 1105\u20131108 (2009b)","journal-title":"Inf. Proc. Lett."},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/PL00007256","volume":"17","author":"H Li","year":"2001","unstructured":"Li, H.: A generalization of the Gallai-Roy theorem. Graphs Comb. 17(4), 681\u2013685 (2001)","journal-title":"Graphs Comb."},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00373-007-0694-3","volume":"23","author":"C Lin","year":"2007","unstructured":"Lin, C.: Simple proofs of results on paths representing all colors in proper vertex-colorings. Graphs Comb. 23(2), 201\u2013203 (2007)","journal-title":"Graphs Comb."},{"issue":"1\u20133","key":"10_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0012-365X(93)E0077-H","volume":"135","author":"NVR Mahadev","year":"1994","unstructured":"Mahadev, N.V.R., Peled, U.N.: Longest cycles in threshold graphs. Discrete Math. 135(1\u20133), 169\u2013176 (1994)","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"10_CR15","first-page":"11","volume":"48","author":"D Marx","year":"2004","unstructured":"Marx, D.: Graph colouring problems and their applications in scheduling. Periodica Polytech. Electr. Eng. 48(1\u20132), 11\u201316 (2004)","journal-title":"Periodica Polytech. Electr. Eng."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $${O}(\\sqrt{|V|} |{E}|)$$ algorithm for finding maximum matching in general graphs. In: Proceedings 21st Symposium on Foundations of Computer Science, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2007.02.010","volume":"103","author":"R Uehara","year":"2007","unstructured":"Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Proc. Lett. 103(2), 71\u201377 (2007)","journal-title":"Inf. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:29:57Z","timestamp":1710242997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}