{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:40:51Z","timestamp":1762908051504,"version":"3.45.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031929342"},{"type":"electronic","value":"9783031929359"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92935-9_22","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:07:24Z","timestamp":1747454844000},"page":"345-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact and\u00a0Parameterized Algorithms for\u00a0Window Width Minimization in\u00a0Bipartite Arrangement"],"prefix":"10.1007","author":[{"given":"Shashank","family":"Chauhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanmay","family":"Inamdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3633-542X","authenticated-orcid":false,"given":"Sanjukta","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., et al.: On the 2-layer window width minimization problem. In: Gasieniec, L. (ed.) SOFSEM 2023. LNCS, vol. 13878, pp. 209\u2013221. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-23101-8_14","DOI":"10.1007\/978-3-031-23101-8_14"},{"issue":"1\u20132","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Fellows, M.R., Hallett, M.T.: Beyond np-completeness for problems of bounded width: hardness for the W hierarchy. In: Leighton, F.T., Goodrich, M.T. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 449\u2013458. ACM (1994). https:\/\/doi.org\/10.1145\/195058.195229","DOI":"10.1145\/195058.195229"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/s00224-011-9312-0","volume":"50","author":"HL Bodlaender","year":"2012","unstructured":"Bodlaender, H.L., Fomin, F.V., Koster, A., Kratsch, D., Thilikos, D.M.: A note on exact algorithms for vertex ordering problems on graphs. Theory Comput. Syst. 50(3), 420\u2013432 (2012)","journal-title":"Theory Comput. Syst."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-92248-3_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Cygan","year":"2008","unstructured":"Cygan, M., Pilipczuk, M.: Faster exact bandwidth. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 101\u2013109. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92248-3_10"},{"issue":"40\u201342","key":"22_CR6","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","volume":"411","author":"M Cygan","year":"2010","unstructured":"Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. Theor. Comput. Sci. 411(40\u201342), 3701\u20133713 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.06.018","journal-title":"Theor. Comput. Sci."},{"key":"22_CR7","doi-asserted-by":"publisher","unstructured":"Cygan, M., Pilipczuk, M.: Even faster exact bandwidth. ACM Trans. Algorithms 8(1), 8:1\u20138:14 (2012). https:\/\/doi.org\/10.1145\/2071379.2071387","DOI":"10.1145\/2071379.2071387"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2071379.2071387","volume":"8","author":"M Cygan","year":"2012","unstructured":"Cygan, M., Pilipczuk, M.: Even faster exact bandwidth. ACM Trans. Algorithms (TALG) 8(1), 1\u201314 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Evans, W.S., K\u00f6ck, K., Kobourov, S.G.: Visualization of bipartite graphs in limited window size. In: Fernau, H., Gaspers, S., Klasing, R. (eds.) SOFSEM 2024. LNCS, vol. 14519, pp. 198\u2013210. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-52113-3_14","DOI":"10.1007\/978-3-031-52113-3_14"},{"key":"22_CR10","unstructured":"Even, S.: Np-completeness of several arrangement problems. Technical report; Department of computer Science, p. 43 (1975)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-44985-X_2","volume-title":"Algorithm Theory - SWAT 2000","author":"U Feige","year":"2000","unstructured":"Feige, U.: Coping with the NP-hardness of the graph bandwidth problem. In: SWAT 2000. LNCS, vol. 1851, pp. 10\u201319. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44985-X_2"},{"key":"22_CR12","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. In: Proceedings of the 16th ACM National Meeting, p.\u00a071. ACM (1961)","DOI":"10.1145\/800029.808532"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/s00453-014-9872-x","volume":"72","author":"Y Kobayashi","year":"2015","unstructured":"Kobayashi, Y., Tamaki, H.: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization. Algorithmica 72(3), 778\u2013790 (2015)","journal-title":"Algorithmica"},{"issue":"9","key":"22_CR15","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ipl.2016.04.012","volume":"116","author":"Y Kobayashi","year":"2016","unstructured":"Kobayashi, Y., Tamaki, H.: A faster fixed parameter algorithm for two-layer crossing minimization. Inf. Process. Lett. 116(9), 547\u2013549 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.12.001","volume":"56","author":"DM Thilikos","year":"2005","unstructured":"Thilikos, D.M., Serna, M., Bodlaender, H.L.: Cutwidth I: a linear time fixed parameter algorithm. J. Algorithms 56(1), 1\u201324 (2005)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92935-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:37:21Z","timestamp":1762907841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92935-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929342","9783031929359"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92935-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}