{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T11:20:55Z","timestamp":1780399255540,"version":"3.54.1"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","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,8]]},"DOI":"10.1016\/j.tcs.2026.116071","type":"journal-article","created":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T06:29:37Z","timestamp":1780122577000},"page":"116071","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Biclique reconfiguration in bipartite graphs"],"prefix":"10.1016","volume":"1081","author":[{"given":"Yota","family":"Otachi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emi","family":"Toyoda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116071_bib0001","series-title":"Surveys in Combinatorics 2013","first-page":"127","article-title":"The complexity of change","volume":"vol. 409","author":"van den Heuvel","year":"2013"},{"issue":"4","key":"10.1016\/j.tcs.2026.116071_bib0002","doi-asserted-by":"crossref","first-page":"52","DOI":"10.3390\/a11040052","article-title":"Introduction to reconfiguration","volume":"11","author":"Nishimura","year":"2018","journal-title":"Algorithms"},{"issue":"5","key":"10.1016\/j.tcs.2026.116071_bib0003","doi-asserted-by":"crossref","first-page":"34:1","DOI":"10.1145\/3212622","article-title":"The parameterized complexity of the k-biclique problem","volume":"65","author":"Lin","year":"2018","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.116071_bib0004","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/j.tcs.2019.09.018","article-title":"Reconfiguring spanning and induced subgraphs","volume":"806","author":"Hanaka","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116071_bib0005","series-title":"COCOON 2025","first-page":"68","article-title":"Reconfiguring multiple connected components with size multiset constraints","volume":"vol. 15984","author":"Nakahata","year":"2025"},{"key":"10.1016\/j.tcs.2026.116071_bib0006","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/j.tcs.2026.116071_bib0007","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","article-title":"The NP-completeness column: an ongoing guide","volume":"8","author":"Johnson","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2026.116071_bib0008","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","article-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"key":"10.1016\/j.tcs.2026.116071_bib0009","series-title":"SODA 2015","first-page":"605","article-title":"The parameterized complexity of k-biclique","author":"Lin","year":"2015"},{"issue":"12\u201314","key":"10.1016\/j.tcs.2026.116071_bib0010","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","article-title":"On the complexity of reconfiguration problems","volume":"412","author":"Ito","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116071_bib0011","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","article-title":"Complexity of independent set reconfigurability problems","volume":"439","author":"Kami\u0144ski","year":"2012","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.116071_bib0012","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","article-title":"PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation","volume":"343","author":"Hearn","year":"2005","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.116071_bib0013","doi-asserted-by":"crossref","first-page":"7:1","DOI":"10.1145\/3280825","article-title":"The complexity of independent set reconfiguration on bipartite graphs","volume":"15","author":"Lokshtanov","year":"2019","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2026.116071_bib0014","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.dam.2023.01.026","article-title":"Reconfiguration of cliques in a graph","volume":"333","author":"Ito","year":"2023","journal-title":"Discret. Appl. Math."},{"issue":"50","key":"10.1016\/j.tcs.2026.116071_bib0015","doi-asserted-by":"crossref","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","article-title":"Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances","volume":"410","author":"Bonsma","year":"2009","journal-title":"Theor. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600321X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600321X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T10:53:56Z","timestamp":1780397636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600321X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":15,"alternative-id":["S030439752600321X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116071","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Biclique reconfiguration in bipartite graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116071","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":"116071"}}