{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:17:16Z","timestamp":1747153036164,"version":"3.40.5"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_43","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"553-567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Algorithms for\u00a0Linear Layouts of\u00a0Graphs with\u00a0Respect to\u00a0the\u00a0Vertex Cover Number"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9363-6996","authenticated-orcid":false,"given":"Yixuan","family":"Li","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":[[2021,12,11]]},"reference":[{"issue":"1","key":"43_CR1","first-page":"23","volume":"22","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Alg. Appl. 22(1), 23\u201349 (2018)","journal-title":"J. Graph Alg. Appl."},{"issue":"1","key":"43_CR2","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00453-015-0016-8","volume":"75","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., Gronemann, M., Raftopoulou, C.N.: Two-page book embeddings of 4-planar graphs. Algorithmica 75(1), 158\u2013185 (2016)","journal-title":"Algorithmica"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1006\/jpdc.1996.0024","volume":"33","author":"SN Bhatt","year":"1996","unstructured":"Bhatt, S.N., Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Scheduling tree-dags using FIFO queues: a control-memory trade-off. J. Parallel Distrib. Comput. 33, 56\u201368 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"43_CR4","first-page":"603","volume":"24","author":"S Bhore","year":"2020","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for book embedding problems. J. Graph Alg. Appl. 24(4), 603\u2013620 (2020)","journal-title":"J. Graph Alg. Appl."},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-030-68766-3_4","volume-title":"Graph Drawing and Network Visualization","author":"S Bhore","year":"2020","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for queue layouts. In: Auber, D., Valtr, P., et al. (eds.) GD 2020. LNCS, vol. 12590, pp. 40\u201354. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_4"},{"key":"43_CR6","unstructured":"Bhore, S., Da Lozzo, G., Montecchiani, F., N\u00f6llenburg, M.: On the upward book thickness problem: combinatorial and complexity results. arXiv: 2108.12327v1 [cs.DM], 27 August 2021. GD 2021 (in press)"},{"key":"43_CR7","doi-asserted-by":"publisher","unstructured":"Binucci, C., Da Lozzo, G., Di Giacomo, E., Didimo, W., Mchedlidze, T., Patrignani, M.: Upward book embeddings of st-graphs. In: Barequet, G., Wang, Y. (eds.) SoCG 2019. LIPIcs, vol. 129, pp. 13:1\u201313:22 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.13","DOI":"10.4230\/LIPIcs.SoCG.2019.13"},{"issue":"40\u201342","key":"43_CR8","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"43_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"F Chung","year":"1987","unstructured":"Chung, F., Leighton, F., Rosenberg, A.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Alg. Discr. Meth. 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"43_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-030-35802-0_35","volume-title":"Graph Drawing and Network Visualization","author":"P de Col","year":"2019","unstructured":"de Col, P., Klute, F., N\u00f6llenburg, M.: Mixed linear layouts: complexity, heuristics, and experiments. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 460\u2013467. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_35"},{"key":"43_CR11","first-page":"339","volume":"6","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6, 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"43_CR12","first-page":"155","volume":"7","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Stacks, queues and tracks: layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci. 7(1), 155\u2013202 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"43_CR13","unstructured":"Enomoto, H., Miyauchi, M.: Stack-queue mixed layouts of graph subdivisions. In: Forum on Information Technology, pp. 47\u201356 (2014)"},{"key":"43_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294\u2013305. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_28"},{"issue":"3","key":"43_CR15","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math. 5(3), 398\u2013412 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"43_CR16","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927\u2013958 (1992)","journal-title":"SIAM J. Comput."},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-35802-0_24","volume-title":"Graph Drawing and Network Visualization","author":"P Hlin\u011bn\u00fd","year":"2019","unstructured":"Hlin\u011bn\u00fd, P., Sankaran, A.: Exact crossing number parameterized by vertex cover. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 307\u2013319. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_24"},{"key":"43_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-73915-1_19","volume-title":"Graph Drawing and Network Visualization","author":"J Klawitter","year":"2018","unstructured":"Klawitter, J., Mchedlidze, T., N\u00f6llenburg, M.: Experimental evaluation of book drawing algorithms. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 224\u2013238. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_19"},{"key":"43_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-030-59267-7_35","volume-title":"Theory and Applications of Models of Computation","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Chen, J., Huang, J.: Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis. In: Chen, J., Feng, Q., Xu, J. (eds.) TAMC 2020. LNCS, vol. 12337, pp. 414\u2013425. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59267-7_35"},{"key":"43_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-64843-5_38","volume-title":"Combinatorial Optimization and Applications","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Chen, J., Huang, J.: Parameterized algorithms for fixed-order book drawing with bounded number of crossings per edge. In: Wu, W., Zhang, Z. (eds.) COCOA 2020. LNCS, vol. 12577, pp. 562\u2013576. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64843-5_38"},{"key":"43_CR21","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. Theor. Comput. Sci. 873, 16\u201324 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR22","unstructured":"Pemmaraju, S.V.: Exploring the powers of stacks and queues via graph layouts. Ph.D. thesis, Virginia Tech (1992)"},{"key":"43_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-73915-1_17","volume-title":"Graph Drawing and Network Visualization","author":"S Pupyrev","year":"2018","unstructured":"Pupyrev, S.: Mixed linear layouts of planar graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 197\u2013209. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_17"},{"key":"43_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-16766-8_20","volume-title":"VLSI Algorithms and Architectures","author":"M Yannakakis","year":"1986","unstructured":"Yannakakis, M.: Linear and book embeddings of graphs. In: Makedon, F., Mehlhorn, K., Papatheodorou, T., Spirakis, P. (eds.) AWOC 1986. LNCS, vol. 227, pp. 226\u2013235. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16766-8_20"}],"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-030-92681-6_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:08:49Z","timestamp":1639354129000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","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":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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)"}}]}}