{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T23:03:49Z","timestamp":1784070229050,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819233083","type":"print"},{"value":"9789819233090","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-3309-0_16","type":"book-chapter","created":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:07:46Z","timestamp":1784066866000},"page":"206-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Kernelization Algorithm for\u00a0Vertex Splitting to Pathwidth-One"],"prefix":"10.1007","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":"Bingyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6965-7989","authenticated-orcid":false,"given":"Jingui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,15]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Ahmed, R., Kobourov, S., Kryven, M.: An FPT algorithm for bipartite vertex splitting. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022, LNCS 13764, pp. 261\u2013268. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_19","DOI":"10.1007\/978-3-031-22203-0_19"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MCG.2023.3264244","volume":"43","author":"R Ahmed","year":"2023","unstructured":"Ahmed, R., Angelini, P., Bekos, M.A., et al.: Splitting vertices in 2-layer graph drawings. IEEE Comput. Graph. 43(3), 24\u201335 (2023)","journal-title":"IEEE Comput. Graph."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"114928","DOI":"10.1016\/j.tcs.2024.114928","volume":"1021","author":"J Baumann","year":"2024","unstructured":"Baumann, J., Pfretzschner, M., Rutter, I.: Parameterized complexity of vertex splitting to pathwidth at most 1. Theoret. Comput. Sci. 1021, 114928 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00453-005-1181-y","volume":"45","author":"V Dujmovi\u0107","year":"2006","unstructured":"Dujmovi\u0107, V., Fellows, M., Hallett, M., et al.: A fixed-parameter approach to 2-layer planarization. Algorithmica 45, 159\u2013182 (2006)","journal-title":"Algorithmica"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jda.2006.12.008","volume":"6","author":"V Dujmovi\u0107","year":"2008","unstructured":"Dujmovi\u0107, V., Fernau, H., Kaufmann, M.: Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2), 313\u2013323 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.7155\/jgaa.00106","volume":"9","author":"H Fernau","year":"2005","unstructured":"Fernau, H.: Two-layer planarization: improving on parameterized algorithmics. J. Graph Algorithms Appl. 9(2), 205\u2013238 (2005)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TST.2014.6867519","volume":"19","author":"H Fernau","year":"2014","unstructured":"Fernau, H., Fomin, F.V., Lokshtanov, D., Mnich, M., Philip, G., Saurabh, S.: Social choice meets graph drawing: how to get subexponential time algorithms for ranking and drawing problems. Tsinghua Sci. Technol. 19(4), 374\u2013386 (2014)","journal-title":"Tsinghua Sci. Technol."},{"issue":"3","key":"16_CR8","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":"16_CR9","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."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Liu Y., Xiao G., Liu A., Wu D., Huang J.: Improved kernelization and fixed-parameter algorithm for bipartite one-sided vertex explosion. Theoret. Comput. Sci. 1082, 116149 (2026)","DOI":"10.1016\/j.tcs.2026.116149"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Liu Y., Xiao G., Huang J., Wang J.: Parameterized algorithms for planar 2- layer drawing by vertex splitting on a given subset. In: Chen, Y., Gao, X., Sun,X., Zhang, A. (eds.) COCOON 2024. LNCS, vol. 15161, pp. 301\u2013313. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-1090-7_25","DOI":"10.1007\/978-981-96-1090-7_25"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.10.011","volume":"91","author":"R Mart\u00ed","year":"2018","unstructured":"Mart\u00ed, R., Mart\u00ednez-Gavara, A., S\u00e1nchez-Oro, J., Duarte, A.: Tabu search for the dynamic bipartite drawing problem. Comput. Oper. Res. 91, 1\u201312 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"16_CR13","first-page":"333","volume":"16","author":"M N\u00f6llenburg","year":"2025","unstructured":"N\u00f6llenburg, M., Sorge, M., Terziadis, S., Villedieu, A., Wu, H.-Y., Wulms, J.: Planarizing graphs and their drawings by vertex splitting. J. Comput. Geom. 16(1), 333\u2013372 (2025)","journal-title":"J. Comput. Geom."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2022.04.001","volume":"921","author":"D Tsur","year":"2022","unstructured":"Tsur, D.: Faster algorithm for pathwidth one vertex deletion. Theoret. Comput. Sci. 921, 63\u201374 (2022)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-3309-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:07:47Z","timestamp":1784066867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3309-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,15]]},"ISBN":["9789819233083","9789819233090"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3309-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,15]]},"assertion":[{"value":"15 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.ntu.edu.sg\/cocoon2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}