{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:19:48Z","timestamp":1743041988421,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"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-93176-6_38","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"438-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fixed-Parameter Tractability for\u00a0Book Drawing with\u00a0Bounded Number of\u00a0Crossings per\u00a0Edge"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2686-5240","authenticated-orcid":false,"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9363-6996","authenticated-orcid":false,"given":"Yixuan","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6965-7989","authenticated-orcid":false,"given":"Jingui","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tcs.2019.03.029","volume":"784","author":"P Angelini","year":"2019","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Montecchianib, F.: On 3D visibility representations of graphs with few crossings per edge. Theor. Comput. Sci. 784, 11\u201320 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.7155\/jgaa.00457","volume":"22","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23\u201349 (2018)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"38_CR3","doi-asserted-by":"publisher","first-page":"577","DOI":"10.7155\/jgaa.00479","volume":"22","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawing of graphs with bounded treewidth. J. Graph Algorithms Appl. 22(4), 577\u2013606 (2018)","journal-title":"J. Graph Algorithms Appl."},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-319-03841-4_30","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2013","unstructured":"Bannister, M.J., Eppstein, D., Simons, J.A.: Fixed parameter tractability of crossing minimization of almost-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 340\u2013351. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_30"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 332\u2013343. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_28"},{"issue":"4","key":"38_CR6","doi-asserted-by":"publisher","first-page":"603","DOI":"10.7155\/jgaa.00526","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 Algorithms Appl. 24(4), 603\u2013620 (2020)","journal-title":"J. Graph Algorithms Appl."},{"key":"38_CR7","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: GD 2020. LNCS, vol. 12590, pp. 40\u201354. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_4"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ejc.2017.07.009","volume":"68","author":"C Binucci","year":"2018","unstructured":"Binucci, C., Giacomoa, E.D., Hossainb, M.I., Liotta, G.: 1-page and 2-page drawings with bounded number of crossings per edge. Eur. J. Comb. 68, 24\u201337 (2018)","journal-title":"Eur. J. Comb."},{"issue":"40\u201342","key":"38_CR9","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":"38_CR10","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. Algebraic Discrete Methods 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"6\u20137","key":"38_CR11","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00285-011-0493-6","volume":"65","author":"P Clote","year":"2012","unstructured":"Clote, P., Dobrev, S., Dotu, I., Kranakis, E., Krizanc, D., Urrutia, J.: On the page number of RNA secondary structures with pseudoknots. J. Math. Biol. 65(6\u20137), 1337\u20131357 (2012). https:\/\/doi.org\/10.1007\/s00285-011-0493-6","journal-title":"J. Math. Biol."},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-00256-5_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Da Lozzo","year":"2018","unstructured":"Da Lozzo, G., Eppstein, D., Goodrich, M.T., Gupta, S.: Subexponential-time and FPT algorithms for embedded flat clustered planarity. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) WG 2018. LNCS, vol. 11159, pp. 111\u2013124. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00256-5_10"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-35802-0_29","volume-title":"Graph Drawing and Network Visualization","author":"E Di Giacomo","year":"2019","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: Sketched representations and orthogonal planarity of bounded treewidth graphs. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 379\u2013392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_29"},{"issue":"8","key":"38_CR14","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1016\/j.comgeo.2013.03.001","volume":"46","author":"E Di Giacomo","year":"2013","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: Area requirement of graph drawings with few crossing per edge. Comput. Geom. 46(8), 909\u2013916 (2013)","journal-title":"Comput. Geom."},{"issue":"4","key":"38_CR15","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF02467109","volume":"33","author":"IA Dynnikov","year":"1999","unstructured":"Dynnikov, I.A.: Three-page approach to knot theory. Encoding and local moves. Funct. Anal. Appl. 33(4), 260\u2013269 (1999). https:\/\/doi.org\/10.1007\/BF02467109","journal-title":"Funct. Anal. Appl."},{"issue":"1","key":"38_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007). https:\/\/doi.org\/10.1007\/s00453-007-0010-x","journal-title":"Algorithmica"},{"key":"38_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":"38_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":"38_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":"38_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":"38_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."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93176-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:47:04Z","timestamp":1641016024000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_38","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":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 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":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","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":"38","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":"61% - 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":"3","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)"}}]}}