{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:35:13Z","timestamp":1757309713932,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496134"},{"type":"electronic","value":"9783031496141"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49614-1_19","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"253-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Faster Parameterized Algorithm for\u00a0Bipartite 1-Sided Vertex Explosion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2686-5240","authenticated-orcid":false,"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Di","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6965-7989","authenticated-orcid":false,"given":"Jingui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Ahmed, R., Kobourov, S., Kryven, M.: An FPT algorithm for bipartite vertex splitting. In: Angelini P., Hanxleden R. von (eds.) Graph Drawing and Network Visualization. GD 2022. LNCS, vol. 13764. 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":"19_CR2","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MCG.2023.3264244","volume":"43","author":"R Ahmed","year":"2023","unstructured":"Ahmed, R., et al.: Splitting vertices in 2-layer graph drawings. IEEE Comput. Graph. 43(3), 24\u201335 (2023)","journal-title":"IEEE Comput. Graph."},{"key":"19_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. WG 2023. LNCS, vol. 14093. 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":"19_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":"19_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"},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2016","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"19_CR7","unstructured":"Eades, P., McKay, B.D., Wormald, N.C.: On an edge crossing problem. In: ACSC 1986, pp. 327\u2013334 (1986)"},{"issue":"4","key":"19_CR8","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":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wang, J., Guo, J., Chen, J.: Complexity and parameterized algorithms for cograph editing. Theoret. Comput. Sci. 461, 45\u201354 (2012)","DOI":"10.1016\/j.tcs.2011.11.040"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2015.01.049","volume":"573","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Wang, J., You, J., Chen, J., Cao, Y.: Edge deletion problems: branching facilitated by modular decomposition. Theoret. Comput. Sci. 573, 63\u201370 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"19_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":"19_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. Sci. Chin. Inf. Sci. 65(4), 1\u20132 (2022). https:\/\/doi.org\/10.1007\/s11432-021-3405-x","journal-title":"Sci. Chin. Inf. Sci."},{"key":"19_CR14","unstructured":"Paul, H., B\u00f6rner, K., Herr II, B.W., Quardokus, E.M.: ASCT+B REPORTER. https:\/\/hubmapconsortium.github.io\/ccf-asct-reporter\/. Accessed 06 June 2022"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1111\/cgf.13441","volume":"37","author":"N Pezzotti","year":"2018","unstructured":"Pezzotti, N., Fekete, J.D., H\u00f6llt, T., Lelieveldt, B.P.F., Eisemann, E., Vilanova, A.: Multiscale visualization and exploration of large bipartite graphs. Comput. Graph. Forum 37(3), 549\u2013560 (2018)","journal-title":"Comput. Graph. Forum"},{"issue":"13","key":"19_CR16","doi-asserted-by":"publisher","first-page":"i248","DOI":"10.1093\/bioinformatics\/btr210","volume":"27","author":"C Scornavacca","year":"2011","unstructured":"Scornavacca, C., Zickmann, F., Huson, D.H.: Tanglegrams for rooted phylogenetic trees and networks. Bioinformatics 27(13), i248\u2013i256 (2011)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49614-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:04:08Z","timestamp":1707555848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}