{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T23:04:19Z","timestamp":1754262259882,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779603"},{"type":"electronic","value":"9783030779610"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77961-0_45","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T19:07:58Z","timestamp":1623352078000},"page":"555-569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Lower Bounds for the Cyclic Bandwidth Problem"],"prefix":"10.1007","author":[{"given":"Hugues","family":"D\u00e9pr\u00e9s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8251-2012","authenticated-orcid":false,"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7970-1368","authenticated-orcid":false,"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"issue":"3","key":"45_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"PZ Chinn","year":"1982","unstructured":"Chinn, P.Z., Chv\u00e1talov\u00e1, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices - a survey. J. Graph Theor. 6(3), 223\u2013254 (1982)","journal-title":"J. Graph Theor."},{"key":"45_CR2","first-page":"151","volume":"3","author":"FR Chung","year":"1988","unstructured":"Chung, F.R.: Labelings of graphs. Sel. Top. Graph Theor. 3, 151\u2013168 (1988)","journal-title":"Sel. Top. Graph Theor."},{"issue":"1","key":"45_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Ind. Appl. Math. 12(1), 131\u2013135 (1964)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"45_CR4","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. 605, pp. 51\u201362. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55599-4_80"},{"issue":"1\u20133","key":"45_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0012-365X(00)00379-4","volume":"242","author":"PCB Lam","year":"2002","unstructured":"Lam, P.C.B., Shiu, W.C., Chan, W.H.: Characterization of graphs with equal bandwidth and cyclic bandwidth. Discrete Math. 242(1\u20133), 283\u2013289 (2002)","journal-title":"Discrete Math."},{"issue":"3","key":"45_CR6","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"JY Leung","year":"1984","unstructured":"Leung, J.Y., Vornberger, O., Witthoff, J.D.: On some variants of the bandwidth minimization problem. SIAM J. Comput. 13(3), 650\u2013667 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"45_CR7","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1111\/j.1749-6632.1989.tb16417.x","volume":"576","author":"Y Lin","year":"1989","unstructured":"Lin, Y.: A level structure approach on the bandwidth problem for special graphs. Ann. N. Y. Acad. Sci. 576(1), 344\u2013357 (1989)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"45_CR8","unstructured":"Lin, Y.: The cyclic bandwidth problem. Syst. Sci. Math. Sci. 7, 282\u2013288 (1994)"},{"issue":"3","key":"45_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<135::AID-NET1>3.0.CO;2-I","volume":"29","author":"Y Lin","year":"1997","unstructured":"Lin, Y.: Minimum bandwidth problem for embedding graphs in cycles. Networks 29(3), 135\u2013140 (1997)","journal-title":"Networks"},{"issue":"2","key":"45_CR10","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. Eur. J. Oper. Res. 186(2), 513\u2013528 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"45_CR11","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1080\/02331934.2013.830120","volume":"63","author":"P Pop","year":"2014","unstructured":"Pop, P., Matei, O., Comes, C.A.: Reducing the bandwidth of a sparse matrix with a genetic algorithm. Optimization 63(12), 1851\u20131876 (2014)","journal-title":"Optimization"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"98436","DOI":"10.1109\/ACCESS.2019.2929410","volume":"7","author":"J Ren","year":"2019","unstructured":"Ren, J., Hao, J., Rodriguez-Tello, E.: An iterated three-phase search approach for solving the cyclic bandwidth problem. IEEE Access 7, 98436\u201398452 (2019)","journal-title":"IEEE Access"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Ren, J., Hao, J.K., Rodriguez-Tello, E., Li, L., He, K.: A new iterated local search algorithm for the cyclic bandwidth problem. Knowl.-Based Syst. 203, 106136 (2020)","DOI":"10.1016\/j.knosys.2020.106136"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.cor.2014.11.013","volume":"57","author":"E Rodriguez-Tello","year":"2015","unstructured":"Rodriguez-Tello, E., Romero-Monsivais, H., Ram\u00edrez-Torres, G., Lardeux, F.: Tabu search for the cyclic bandwidth problem. Comput. Oper. Res. 57, 17\u201332 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"45_CR15","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0304-3975(00)00068-2","volume":"249","author":"S Zhou","year":"2000","unstructured":"Zhou, S.: Bounding the bandwidths for graphs. Theoret. Comput. Sci. 249(2), 357\u2013368 (2000)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77961-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:03:37Z","timestamp":1749506617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77961-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779603","9783030779610"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77961-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}