{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:09:47Z","timestamp":1784110187390,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819610891","type":"print"},{"value":"9789819610907","type":"electronic"}],"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-981-96-1090-7_25","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:32:55Z","timestamp":1741105975000},"page":"301-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Algorithms for\u00a0Planar 2-Layer Drawing by\u00a0Vertex Splitting on\u00a0a\u00a0Given Subset"],"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":"Guang","family":"Xiao","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1516-0480","authenticated-orcid":false,"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"25_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.) Graph Drawing and Network Visualization: 30th International Symposium, Tokyo, Japan, September 13\u201316, 2022, Revised Selected Papers, GD 2022. LNCS, vol.\u00a013764, pp. 261\u2013268. Springer International Publishing, 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":"25_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":"25_CR3","doi-asserted-by":"publisher","unstructured":"Baumann, J., Pfretzschner, M., Rutter, I.: Parameterized complexity of vertex splitting to pathwidth at most 1. In: Paulusma, D., Ries, B. (eds.) Graph-Theoretic Concepts in Computer Science: 49th International Workshop, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, WG 2023. LNCS, vol.\u00a014093, pp. 30\u201343. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43380-1_3","DOI":"10.1007\/978-3-031-43380-1_3"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00597","volume":"26","author":"S Bhore","year":"2022","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for queue layouts. J. Graph Algorithms Appl. 26(3), 335\u2013352 (2022)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhary, A., Chen, D.Z., Hu, X.S., Niemier, M.T., Ravichandran, R., Whitton, K.: Fabricatable interconnect and molecular QCA circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(11), 1978\u20131991 (2007)","DOI":"10.1109\/TCAD.2007.906467"},{"issue":"2","key":"25_CR6","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":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.7155\/jgaa.00215","volume":"15","author":"CA Duncan","year":"2011","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planar drawings of higher-genus graphs. J. Graph Algorithms Appl. 15(1), 7\u201332 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR8","unstructured":"Eades, P., McKay, B.D., Wormald, N.C.: On an edge crossing problem. In: ACSC \u201986, pp. 327\u2013334 (1986)"},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"issue":"2","key":"25_CR10","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":"3","key":"25_CR11","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"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2021.04.021","volume":"873","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Chen, J., Huang, J., Wang, J.: On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering. Theoret. Comput. Sci. 873, 16\u201324 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-021-3405-x","volume":"65","author":"Y Liu","year":"2022","unstructured":"Liu, Y., Chen, J., Huang, J.: On book thickness parameterized by the vertex cover number. SCIENCE CHINA Inf. Sci. 65(4), 1\u20132 (2022). https:\/\/doi.org\/10.1007\/s11432-021-3405-x","journal-title":"SCIENCE CHINA Inf. Sci."},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Liu, Y., Xiao, G., Liu, A., Wu, D., Huang, J.: A faster parameterized algorithm for\u00a0bipartite 1-sided vertex explosion. In: Wu, W., Guo, J. (eds.) Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15\u201317, 2023, Proceedings, Part II, pp. 253\u2013266. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-49614-1_19","DOI":"10.1007\/978-3-031-49614-1_19"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-031-22203-0_17","volume-title":"Graph Drawing and Network Visualization: 30th International Symposium, GD 2022, Tokyo, Japan, September 13\u201316, 2022, Revised Selected Papers","author":"M N\u00f6llenburg","year":"2023","unstructured":"N\u00f6llenburg, M., Sorge, M., Terziadis, S., Villedieu, A., Wu, H.-Y., Wulms, J.: Planarizing graphs and\u00a0their drawings by\u00a0vertex splitting. In: Angelini, P., von Hanxleden, R. (eds.) Graph Drawing and Network Visualization: 30th International Symposium, GD 2022, Tokyo, Japan, September 13\u201316, 2022, Revised Selected Papers, pp. 232\u2013246. Springer International Publishing, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_17"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Suderman, M.: Proper and planar drawings of graphs on three layers. In: Healy, P., Nikolov, N.S. (eds.) Graph Drawing: 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 434\u2013445. Springer Berlin Heidelberg, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_39","DOI":"10.1007\/11618058_39"}],"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-96-1090-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:04:46Z","timestamp":1757142286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","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":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}