{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:48:17Z","timestamp":1780822097566,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030868376","type":"print"},{"value":"9783030868383","type":"electronic"}],"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-86838-3_2","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"15-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/0602041","volume":"2","author":"SF Assmann","year":"1981","unstructured":"Assmann, S.F., Peck, G.W., Sys\u0142o, M.M., Zak, J.: The bandwidth of caterpillars with hairs of length 1 and 2. SIAM J. Algebraic Discrete Methods 2, 387\u2013392 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(90)90027-F","volume":"86","author":"HL Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: The complexity of finding uniform emulations on paths and ring networks. Inf. Comput. 86(1), 87\u2013106 (1990)","journal-title":"Inf. Comput."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: Parameterized complexity of bandwidth of caterpillars and weighted path emulation. arXiv:2012.01226 (2020)","DOI":"10.1007\/978-3-030-86838-3_2"},{"issue":"8","key":"2_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fellows, M.R., Hallett, M.: Beyond NP-completeness for problems of bounded width: hardness for the $$W$$ hierarchy. In: Proceedings of the 26th Annual Symposium on Theory of Computing, STOC 1994, pp. 449\u2013458, New York. ACM Press (1994)","DOI":"10.1145\/195058.195229"},{"key":"2_CR6","unstructured":"Bodlaender, H.L., Groenland, C., Nederlof, J., Swennenhuis, C.M.F.: Parameterized problems complete for nondeterministic FPT time and logarithmic space. arXiv:2105.14882 (2021)"},{"key":"2_CR7","unstructured":"Bodlaender, H.L., van der Wegen, M.: Parameterized complexity of scheduling chains of jobs with delays. In: Cao, Y., Pilipczuk, M. (eds.) 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, volume 180 of LIPIcs, pp. 4:1\u20134:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0019-9958(86)80008-0","volume":"71","author":"HL Bodlaender","year":"1986","unstructured":"Bodlaender, H.L., van Leeuwen, J.: Simulation of large networks on smaller networks. Inf. Control 71(3), 143\u2013180 (1986)","journal-title":"Inf. Control"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24, 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-662-43948-7_34","volume-title":"Automata, Languages, and Programming","author":"MS Dregi","year":"2014","unstructured":"Dregi, M.S., Lokshtanov, D.: Parameterized complexity of bandwidth on trees. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 405\u2013416. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_34"},{"issue":"5","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/130927115","volume":"44","author":"A Drucker","year":"2015","unstructured":"Drucker, A.: New limits to classical and quantum instance compression. SIAM J. Comput. 44(5), 1443\u20131479 (2015)","journal-title":"SIAM J. Comput."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-030-42071-0_2","volume-title":"Treewidth, Kernels, and Algorithms","author":"MR Fellows","year":"2020","unstructured":"Fellows, M.R., Rosamond, F.A.: Collaborating with Hans: some remaining wonderments. In: Fomin, F.V., Kratsch, S., van Leeuwen, E.J. (eds.) Treewidth, Kernels, and Algorithms. LNCS, vol. 12160, pp. 7\u201317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-42071-0_2"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Fishburn, J.P., Finkel, R.A.: Quotient networks. IEEE Trans. Comput. C-31, 288\u2013295 (1982)","DOI":"10.1109\/TC.1982.1675994"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"EM Gurari","year":"1984","unstructured":"Gurari, E.M., Sudborough, I.H.: Improved dynamic programming algorithms for bandwidth minimization and the MinCut linear arrangement problem. J. Algorithms 5, 531\u2013546 (1984)","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"2_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0012-365X(98)00009-0","volume":"189","author":"LTQ Hung","year":"1998","unstructured":"Hung, L.T.Q., Sys\u0142o, M.M., Weaver, M.L., West, D.B.: Bandwidth and density for block graphs. Discret. Math. 189(1\u20133), 163\u2013176 (1998)","journal-title":"Discret. Math."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0607057","volume":"7","author":"B Monien","year":"1986","unstructured":"Monien, B.: The bandwidth minimization problem for caterpillars with hair length $$3$$ is NP-complete. SIAM J. Algebraic Discrete Methods 7, 505\u2013512 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0304-3975(03)00238-X","volume":"307","author":"D Muradian","year":"2003","unstructured":"Muradian, D.: The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete. Theor. Comput. Sci. 307(3), 567\u2013572 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing 16, 263\u2013270 (1976)","journal-title":"Computing"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"JB Saxe","year":"1980","unstructured":"Saxe, J.B.: Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic and Discrete Methods 1, 363\u2013369 (1980)","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"2_CR23","first-page":"281","volume":"16","author":"MM Sys\u0142o","year":"1982","unstructured":"Sys\u0142o, M.M., Zak, J.: The Bandwidth problem: critical subgraphs and the solution for caterpillars. Ann. Discrete Math. 16, 281\u2013286 (1982)","journal-title":"Ann. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:01:48Z","timestamp":1702065708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","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":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"30","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":"0","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":"41% - 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":"3","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":"11","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":"The conference was held online due to the COVID-19 pandemic.","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)"}}]}}