{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T12:05:30Z","timestamp":1779451530065,"version":"3.53.1"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100011581","name":"IIT Indore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011581","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001409","name":"Department of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001409","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019497","name":"IIT Jodhpur","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100019497","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116012","type":"journal-article","created":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T22:53:53Z","timestamp":1777762433000},"page":"116012","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Exact and parameterized algorithms for window width minimization in bipartite arrangement"],"prefix":"10.1016","volume":"1078","author":[{"given":"Shashank","family":"Chauhan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tanmay","family":"Inamdar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9274-4119","authenticated-orcid":false,"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjukta","family":"Roy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116012_bib0001","series-title":"SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nov\u00fd Smokovec, Slovakia, January 15\u201318, 2023, Proceedings","first-page":"209","article-title":"On the 2-layer window width minimization problem","volume":"13878","author":"Bekos","year":"2023"},{"key":"10.1016\/j.tcs.2026.116012_bib0002","series-title":"SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19\u201323, 2024, Proceedings","first-page":"198","article-title":"Visualization of bipartite graphs in limited window size","volume":"14519","author":"Evans","year":"2024"},{"key":"10.1016\/j.tcs.2026.116012_bib0003","series-title":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada","first-page":"449","article-title":"Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy","author":"Bodlaender","year":"1994"},{"key":"10.1016\/j.tcs.2026.116012_bib0004","series-title":"Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5\u20137, 2000, Proceedings","first-page":"10","article-title":"Coping with the NP-hardness of the graph bandwidth problem","volume":"1851","author":"Feige","year":"2000"},{"key":"10.1016\/j.tcs.2026.116012_bib0005","series-title":"Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30, - July 2, 2008. Revised Papers","first-page":"101","article-title":"Faster exact bandwidth","volume":"5344","author":"Cygan","year":"2008"},{"issue":"40\u201342","key":"10.1016\/j.tcs.2026.116012_bib0006","doi-asserted-by":"crossref","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","article-title":"Exact and approximate bandwidth","volume":"411","author":"Cygan","year":"2010","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.116012_bib0007","doi-asserted-by":"crossref","first-page":"8:1","DOI":"10.1145\/2071379.2071387","article-title":"Even faster exact bandwidth","volume":"8","author":"Cygan","year":"2012","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.tcs.2026.116012_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jalgor.2004.12.001","article-title":"Cutwidth I: a linear time fixed parameter algorithm","volume":"56","author":"Thilikos","year":"2005","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.116012_bib0009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded treewidth","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116012_bib0010","series-title":"Technical Report; Department of computer Science","article-title":"NP-completeness of several arrangement problems","volume":"43","author":"Even","year":"1975"},{"key":"10.1016\/j.tcs.2026.116012_bib0011","series-title":"Proceedings of the 16th ACM National Meeting","first-page":"71","article-title":"A dynamic programming approach to sequencing problems","author":"Held","year":"1961"},{"issue":"3","key":"10.1016\/j.tcs.2026.116012_bib0012","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/s00224-011-9312-0","article-title":"A note on exact algorithms for vertex ordering problems on graphs","volume":"50","author":"Bodlaender","year":"2012","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"10.1016\/j.tcs.2026.116012_bib0013","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1007\/s00453-014-9872-x","article-title":"A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization","volume":"72","author":"Kobayashi","year":"2015","journal-title":"Algorithmica"},{"issue":"9","key":"10.1016\/j.tcs.2026.116012_bib0014","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.ipl.2016.04.012","article-title":"A faster fixed parameter algorithm for two-layer crossing minimization","volume":"116","author":"Kobayashi","year":"2016","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.tcs.2026.116012_bib0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2071379.2071387","article-title":"Even faster exact bandwidth","volume":"8","author":"Cygan","year":"2012","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2026.116012_bib0016","series-title":"Kernelization: Theory of Parameterized Preprocessing","author":"Fomin","year":"2019"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002628?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002628?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:13:42Z","timestamp":1779448422000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":16,"alternative-id":["S0304397526002628"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116012","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exact and parameterized algorithms for window width minimization in bipartite arrangement","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116012"}}