{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:04:39Z","timestamp":1786979079515,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642377976","type":"print"},{"value":"9783642377983","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37798-3_13","type":"book-chapter","created":{"date-parts":[[2013,3,20]],"date-time":"2013-03-20T22:35:19Z","timestamp":1363818919000},"page":"139-150","source":"Crossref","is-referenced-by-count":3,"title":["A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem"],"prefix":"10.1007","author":[{"given":"Hillel","family":"Romero-Monsivais","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eduardo","family":"Rodriguez-Tello","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriel","family":"Ram\u00edrez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"J. Leung","year":"1984","unstructured":"Leung, J., Vornberger, O., Witthoff, J.: On some variants of the bandwidth minimization problem. SIAM Journal on Computing\u00a013(3), 650\u2013667 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S.N. Bhatt","year":"1984","unstructured":"Bhatt, S.N., Thomson Leighton, F.: A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences\u00a028(2), 300\u2013343 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"13_CR3","first-page":"9","volume":"12","author":"A.L. Rosenberg","year":"1978","unstructured":"Rosenberg, A.L., Snyder, L.: Bounds on the costs of data encodings. Theory of Computing Systems\u00a012(1), 9\u201339 (1978)","journal-title":"Theory of Computing Systems"},{"key":"13_CR4","unstructured":"Chung, F.R.K.: Labelings of graphs. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, vol.\u00a03, pp. 151\u2013168. Academic Press (1988)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-55599-4_80","volume-title":"PARLE \u201992. Parallel Architectures and Languages Europe","author":"J. Hromkovi\u010d","year":"1992","unstructured":"Hromkovi\u010d, J., M\u00fcller, V., S\u00fdkora, O., Vr\u0165o, I.: On Embedding Interconnection Networks into Rings of Processors. In: Etiemble, D., Syre, J.-C. (eds.) PARLE 1992. LNCS, vol.\u00a0605, pp. 51\u201362. Springer, Heidelberg (1992)"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C.H. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing\u00a016(3), 263\u2013270 (1976)","journal-title":"Computing"},{"issue":"1","key":"13_CR7","first-page":"131","volume":"12","author":"L. Harper","year":"1964","unstructured":"Harper, L.: Optimal assignment of numbers to vertices. Journal of SIAM\u00a012(1), 131\u2013135 (1964)","journal-title":"Journal of SIAM"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly\u00a02(1), 83\u201397 (1955)","journal-title":"Naval Research Logistic Quarterly"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0304-3975(00)00068-2","volume":"249","author":"S. Zhou","year":"2002","unstructured":"Zhou, S.: Bounding the bandwidths for graphs. Theoretical Computer Science\u00a0249(2), 357\u2013368 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR10","unstructured":"de Klerk, E., Eisenberg-Nagy, M., Sotirov, R.: On semidefinite programming bounds for graph bandwidth. Technical report, Centrum Wiskunde & Informatica (2011)"},{"issue":"3","key":"13_CR11","first-page":"337","volume":"10B","author":"J. Yuan","year":"1995","unstructured":"Yuan, J., Zhou, S.: Optimal labelling of unit interval graphs. Applied Mathematics, A Journal of Chinese Universities\u00a010B(3), 337\u2013344 (1995)","journal-title":"Applied Mathematics, A Journal of Chinese Universities"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0012-365X(00)00379-4","volume":"242","author":"P.C.B. Lam","year":"2002","unstructured":"Lam, P.C.B., Shiu, W.C., Chan, W.H.: Characterization of graphs with equal bandwidth and cyclic bandwidth. Discrete Mathematics\u00a0242(3), 283\u2013289 (2002)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"13_CR13","first-page":"147","volume":"47","author":"P.C.B. Lam","year":"1997","unstructured":"Lam, P.C.B., Shiu, W.C., Chan, W.H.: On bandwidth and cyclic bandwidth of graphs. Ars Combinatoria\u00a047(3), 147\u2013152 (1997)","journal-title":"Ars Combinatoria"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2007.02.004","volume":"186","author":"R. Mart\u00ed","year":"2008","unstructured":"Mart\u00ed, R., Campos, V., Pi\u00f1ana, E.: A branch and bound algorithm for the matrix bandwidth minimization. European Journal of Operational Research\u00a0186(2), 513\u2013528 (2008)","journal-title":"European Journal of Operational Research"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Palubeckis, G., Rubliauskas, D.: A branch-and-bound algorithm for the minimum cut linear arrangement problem. Journal of Combinatorial Optimization, 1\u201324 (2011), doi:10.1007\/s10878\u2013011\u20139406\u20132","DOI":"10.1007\/s10878-011-9406-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37798-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T18:13:40Z","timestamp":1557598420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37798-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642377976","9783642377983"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37798-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}