{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:08:26Z","timestamp":1742951306952,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_11","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T08:25:56Z","timestamp":1335601556000},"page":"117-128","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for Bandwidth Consecutive Multicolorings of Graphs"],"prefix":"10.1007","author":[{"given":"Kazuhide","family":"Nishikawa","sequence":"first","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Disc. Appl. Math.\u00a023, 11\u201324 (1989)","journal-title":"Disc. Appl. Math."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic Techniques and Results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1006\/jagm.2001.1210","volume":"42","author":"M.M. Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. J. of Algorithms\u00a042(2), 334\u2013366 (2002)","journal-title":"J. of Algorithms"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0890-5401(02)00032-9","volume":"180","author":"M.M. Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Proskurowski, A.: Multicoloring trees. Information and Computation\u00a0180(2), 113\u2013129 (2003)","journal-title":"Information and Computation"},{"issue":"2","key":"11_CR5","first-page":"191","volume":"E86-D","author":"T. Ito","year":"2003","unstructured":"Ito, T., Nishizeki, T., Zhou, X.: Algorithms for multicolorings of partial k-trees. IEICE Trans. Inf. & Syst.\u00a0E86-D(2), 191\u2013200 (2003)","journal-title":"IEICE Trans. Inf. & Syst."},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Disc. Appl. Math.\u00a075(2), 135\u2013155 (1997)","journal-title":"Disc. Appl. Math."},{"key":"11_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032497","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1994","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1994)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/j.ejor.2006.09.095","volume":"189","author":"E. Malaguti","year":"2008","unstructured":"Malaguti, E., Toth, P.: An evolutionary approach for bandwidth multicoloring problems. Europian Journal of Operation Reseach\u00a0189, 638\u2013651 (2008)","journal-title":"Europian Journal of Operation Reseach"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0012-365X(03)00236-X","volume":"273","author":"C. McDiamid","year":"2003","unstructured":"McDiamid, C., Reed, B.: Channel assignment on graphs of bounded treewidth. Discrete Mathematics\u00a0273, 183\u2013192 (2003)","journal-title":"Discrete Mathematics"},{"key":"11_CR10","volume-title":"Scheduling: Theory, Algorithms and Systems","author":"M.L. Pinedo","year":"2008","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms and Systems. Springer Science, New York (2008)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach.\u00a029, 623\u2013641 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"key":"11_CR12","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1996)"},{"issue":"4","key":"11_CR13","first-page":"671","volume":"E83-A","author":"X. Zhou","year":"2000","unstructured":"Zhou, X., Kanari, Y., Nishizeki, T.: Generalized vertex-colorings of partial k-trees. IEICE Trans. Fundamentals\u00a0E83-A(4), 671\u2013678 (2000)","journal-title":"IEICE Trans. Fundamentals"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00453-003-1060-3","volume":"38","author":"X. Zhou","year":"2004","unstructured":"Zhou, X., Nishizeki, T.: Multicolorings of series-parallel graphs. Algorithmica\u00a038, 271\u2013297 (2004)","journal-title":"Algorithmica"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing\u00a03, 103\u2013128 (2007)","journal-title":"Theory of Computing"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T03:41:37Z","timestamp":1578541297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_11"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}