{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:09:50Z","timestamp":1784110190431,"version":"3.55.0"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100009377","name":"Education Department of Hunan Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009377","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2025JJ50346"],"award-info":[{"award-number":["2025JJ50346"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["24A0093"],"award-info":[{"award-number":["24A0093"]}],"id":[{"id":"10.13039\/501100004735","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,9]]},"DOI":"10.1016\/j.tcs.2026.116149","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T23:28:17Z","timestamp":1782862097000},"page":"116149","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Improved kernelization and fixed-parameter algorithm for bipartite one-sided vertex explosion"],"prefix":"10.1016","volume":"1082","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2686-5240","authenticated-orcid":false,"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Di","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.tcs.2026.116149_bib0001","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1111\/cgf.13441","article-title":"Multiscale visualization and exploration of large bipartite graphs","volume":"37","author":"Pezzotti","year":"2018","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"10.1016\/j.tcs.2026.116149_bib0002","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TCBB.2006.26","article-title":"Minimum-flip supertrees: complexity and algorithms","volume":"3","author":"Chen","year":"2006","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"10.1016\/j.tcs.2026.116149_bib0003","unstructured":"H. Paul, K. B\u00f6rner, B.W. Herr II, E.M. Quardokus, ASCT+B REPORTER, Accessed: 06 June 2022, https:\/\/hubmapconsortium.github.io\/ccf-asct-reporter\/."},{"issue":"4","key":"10.1016\/j.tcs.2026.116149_bib0004","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01187020","article-title":"Edge crossings in drawings of bipartite graphs","volume":"11","author":"Eades","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116149_bib0005","series-title":"Proc. 4th CSL","first-page":"1","article-title":"Monadic second order logic, tree automata and forbidden minors","volume":"533","author":"Arnborg","year":"1990"},{"key":"10.1016\/j.tcs.2026.116149_bib0006","series-title":"Proc. 9th ACSC","first-page":"327","article-title":"On an edge crossing problem","author":"Eades","year":"1986"},{"key":"10.1016\/j.tcs.2026.116149_bib0007","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114928","article-title":"Parameterized complexity of vertex splitting to pathwidth at most 1","volume":"1021","author":"Baumann","year":"2024","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116149_bib0008","series-title":"Proc. 30th GD","first-page":"261","article-title":"An FPT algorithm for bipartite vertex splitting","volume":"13764","author":"Ahmed","year":"2023"},{"issue":"3","key":"10.1016\/j.tcs.2026.116149_bib0009","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MCG.2023.3264244","article-title":"Splitting vertices in 2-layer graph drawings","volume":"43","author":"Ahmed","year":"2023","journal-title":"IEEE Comput. Graph."},{"issue":"1","key":"10.1016\/j.tcs.2026.116149_bib0010","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/s00453-011-9578-2","article-title":"An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion","volume":"64","author":"Cygan","year":"2012","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.tcs.2026.116149_bib0011","doi-asserted-by":"crossref","first-page":"205","DOI":"10.7155\/jgaa.00106","article-title":"Two-layer planarization: improving on parameterized algorithmics","volume":"9","author":"Fernau","year":"2005","journal-title":"J. Graph Algorith. Appl."},{"key":"10.1016\/j.tcs.2026.116149_bib0012","series-title":"Proc. 30th COCOON","first-page":"301","article-title":"Parameterized algorithms for planar 2-layer drawing by vertex splitting on a given subset","volume":"15161","author":"Liu","year":"2024"},{"issue":"1","key":"10.1016\/j.tcs.2026.116149_bib0013","first-page":"333","article-title":"Planarizing graphs and their drawings by vertex splitting","volume":"16","author":"N\u00f6llenburg","year":"2025","journal-title":"J. Comput. Geom."},{"key":"10.1016\/j.tcs.2026.116149_bib0014","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.tcs.2022.04.001","article-title":"Faster algorithm for pathwidth one vertex deletion","volume":"921","author":"Tsur","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116149_bib0015","series-title":"Proc. 33rd WG","first-page":"292","article-title":"Obtaining a planar graph by vertex deletion","volume":"4769","author":"Marx","year":"2007"},{"key":"10.1016\/j.tcs.2026.116149_bib0016","doi-asserted-by":"crossref","first-page":"2503","DOI":"10.1007\/s00453-021-00815-w","article-title":"Improved analysis of highest-degree branching for feedback vertex set","volume":"83","author":"Iwata","year":"2021","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116149_bib0017","series-title":"Parameterized Algorithms","author":"Cygan","year":"2016"},{"issue":"4","key":"10.1016\/j.tcs.2026.116149_bib0018","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","article-title":"Automated generation of search tree algorithms for hard graph modification problems","volume":"39","author":"Gramm","year":"2004","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116149_bib0019","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10878-014-9733-1","article-title":"An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs","volume":"29","author":"Liu","year":"2015","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2026.116149_bib0020","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.tcs.2015.01.049","article-title":"Edge deletion problems: branching facilitated by modular decomposition","volume":"573","author":"Liu","year":"2015","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.116149_bib0021","doi-asserted-by":"crossref","DOI":"10.1142\/S1793830912500085","article-title":"Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes","volume":"4","author":"Nastos","year":"2012","journal-title":"Discrete Math. Algorith. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003786?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003786?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T19:27:19Z","timestamp":1783711639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":21,"alternative-id":["S0304397526003786"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116149","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improved kernelization and fixed-parameter algorithm for bipartite one-sided vertex explosion","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116149","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":"116149"}}