{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:30:29Z","timestamp":1757313029237},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11432-021-3405-x","type":"journal-article","created":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T05:02:57Z","timestamp":1647666177000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On book thickness parameterized by the vertex cover number"],"prefix":"10.1007","volume":"65","author":[{"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"3405_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"F R K Chung","year":"1987","unstructured":"Chung F R K, Leighton F T, Rosenberg A L. Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J Algebr Discrete Methods, 1987, 8: 33\u201358","journal-title":"SIAM J Algebr Discrete Methods"},{"key":"3405_CR2","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M R Garey","year":"1980","unstructured":"Garey M R, Johnson D S, Miller G L, et al. The complexity of coloring circular arcs and chords. SIAM J Algebr Discrete Methods, 1980, 1: 216\u2013227","journal-title":"SIAM J Algebr Discrete Methods"},{"key":"3405_CR3","first-page":"603","volume":"24","author":"S Bhore","year":"2020","unstructured":"Bhore S, Ganian R, Montecchiani F, et al. Parameterized algorithms for book embedding problems. J Graph Alg Appl, 2020, 24: 603\u2013620","journal-title":"J Graph Alg Appl"},{"key":"3405_CR4","doi-asserted-by":"crossref","unstructured":"Liu Y, Li Y, Huang J. Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number. In: Proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications, Tianjin, 2021. 553\u2013567","DOI":"10.1007\/978-3-030-92681-6_43"},{"key":"3405_CR5","doi-asserted-by":"crossref","unstructured":"Bhore S, Ganian R, Montecchiani F, et al. Parameterized algorithms for queue layouts. In: Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, Vancouver, 2020. 40\u201354","DOI":"10.1007\/978-3-030-68766-3_4"},{"key":"3405_CR6","doi-asserted-by":"crossref","unstructured":"Liu Y, Li Y, Huang J. Fixed-parameter tractability for book drawing with bounded number of crossings per edge. In: Proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, Dallas, 2021. 438\u2013449","DOI":"10.1007\/978-3-030-93176-6_38"},{"key":"3405_CR7","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, et al. On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering. Theor Comput Sci, 2021, 873: 16\u201324","journal-title":"Theor Comput Sci"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3405-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-021-3405-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3405-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T21:03:22Z","timestamp":1683234202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-021-3405-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["3405"],"URL":"https:\/\/doi.org\/10.1007\/s11432-021-3405-x","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"11 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"140603"}}