{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:47:21Z","timestamp":1767340041500,"version":"3.48.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_18","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"242-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Upward Book Thickness Problem: Combinatorial and\u00a0Complexity Results"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0104-1659","authenticated-orcid":false,"given":"Sujoy","family":"Bhore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-5174","authenticated-orcid":false,"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-62495-3_34","volume-title":"Graph Drawing","author":"M Alzohairi","year":"1997","unstructured":"Alzohairi, M., Rival, I.: Series-parallel planar ordered sets have pagenumber two. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 11\u201324. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_34"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: 2-level quasi-planarity or how caterpillars climb (SPQR-)trees. In: Marx, D. (ed.) ACM-SIAM Symposium on Discrete Algorithms, (SODA 2021), pp. 2779\u20132798. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.165","DOI":"10.1137\/1.9781611976465.165"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.11.016","volume":"575","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Neuwirth, D.: Advancements on SEFE and partitioned book embedding problems. Theor. Comput. Sci. 575, 71\u201389 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.11.016","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00453-016-0203-2","volume":"79","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, C.N.: The book thickness of 1-planar graphs is constant. Algorithmica 79(2), 444\u2013465 (2017)","journal-title":"Algorithmica"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Da Lozzo, G., Griesbach, S., Gronemann, M., Montecchiani, F., Raftopoulou, C.N.: Book embeddings of nonplanar graphs with small faces in few pages. In: Cabello, S., Chen, D.Z. (eds.) Symposium on Computational Geometry (SoCG 2020). LIPIcs, vol. 164, pp. 16:1\u201316:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2020.16","DOI":"10.4230\/LIPIcs.SoCG.2020.16"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Klute, F., Pupyrev, S., Raftopoulou, C.N., Ueckerdt, T.: Four pages are indeed necessary for planar graphs. J. Comput. Geom. 11(1), 332\u2013353 (2020). https:\/\/doi.org\/10.20382\/jocg.v11i1a12","DOI":"10.20382\/jocg.v11i1a12"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory, Ser. B 27(3), 320\u2013331 (1979). https:\/\/doi.org\/10.1016\/0095-8956(79)90021-2","DOI":"10.1016\/0095-8956(79)90021-2"},{"key":"18_CR8","unstructured":"Bhore, S., Da Lozzo, G., Montecchiani, F., N\u00f6llenburg, M.: On the upward book thickness problem: Combinatorial and complexity results. CoRR abs\/2108.12327 (2021). https:\/\/arxiv.org\/abs\/2108.12327"},{"issue":"4","key":"18_CR9","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). https:\/\/doi.org\/10.7155\/jgaa.00526","journal-title":"J. Graph Algorithms Appl."},{"key":"18_CR10","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. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.13","DOI":"10.4230\/LIPIcs.SoCG.2019.13"},{"issue":"40\u201342","key":"18_CR11","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). https:\/\/doi.org\/10.1016\/j.tcs.2010.06.026","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR12","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). https:\/\/doi.org\/10.1137\/0608002","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"18_CR13","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988). https:\/\/doi.org\/10.1016\/0304-3975(88)90123-5","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-005-1185-7","volume":"45","author":"E Di Giacomo","year":"2006","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica 45(4), 531\u2013547 (2006)","journal-title":"Algorithmica"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Didimo, W.: Upward graph drawing. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 1\u20135. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-642-27848-8_653-1","DOI":"10.1007\/978-3-642-27848-8_653-1"},{"issue":"2","key":"18_CR17","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(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V Dujmovic","year":"2007","unstructured":"Dujmovic, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discret. Comput. Geom. 37(4), 641\u2013670 (2007). https:\/\/doi.org\/10.1007\/s00454-007-1318-7","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.7155\/jgaa.00292","volume":"17","author":"F Frati","year":"2013","unstructured":"Frati, F., Fulek, R., Ruiz-Vargas, A.J.: On the page number of upward planar directed acyclic graphs. J. Graph Algorithms Appl. 17(3), 221\u2013244 (2013). https:\/\/doi.org\/10.7155\/jgaa.00292","journal-title":"J. Graph Algorithms Appl."},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Fulek, R., T\u00f3th, C.D.: Atomic embeddability, clustered planarity, and thickenability. In: Chawla, S. (ed.) ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pp. 2876\u20132895. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.175","DOI":"10.1137\/1.9781611975994.175"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0895480193252380","volume":"10","author":"LS Heath","year":"1997","unstructured":"Heath, L.S., Pemmaraju, S.V.: Stack and queue layouts of posets. SIAM J. Discrete Math. 10(4), 599\u2013625 (1997)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"18_CR22","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/S0097539795291550","volume":"28","author":"LS Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V.: Stack and queue layouts of directed acyclic graphs: Part II. SIAM J. Comput. 28(5), 1588\u20131626 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"18_CR23","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539795280287","volume":"28","author":"LS Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V., Trenk, A.N.: Stack and queue layouts of directed acyclic graphs: Part I. SIAM J. Comput. 28(4), 1510\u20131539 (1999). https:\/\/doi.org\/10.1137\/S0097539795280287","journal-title":"SIAM J. Comput."},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Kainen, P.C.: Some recent results in topological graph theory. In: Bari, R.A., Harary, F. (eds.) Graphs and Combinatorics, pp. 76\u2013108. Springer, Cham (1974). https:\/\/doi.org\/10.1007\/BFb0066436","DOI":"10.1007\/BFb0066436"},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.1994.1028","volume":"17","author":"SM Malitz","year":"1994","unstructured":"Malitz, S.M.: Genus $$g$$ graphs have pagenumber $$o(\\sqrt{g})$$. J. Algorithms 17(1), 85\u2013109 (1994). https:\/\/doi.org\/10.1006\/jagm.1994.1028","journal-title":"J. Algorithms"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1007\/978-3-642-10631-6_89","volume-title":"Algorithms and Computation","author":"T Mchedlidze","year":"2009","unstructured":"Mchedlidze, T., Symvonis, A.: Crossing-free acyclic Hamiltonian path completion for planar st-digraphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 882\u2013891. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_89"},{"key":"18_CR27","unstructured":"Merker, L.: Ordered covering numbers. Masters thesis, Karlsruhe Institute of Technology (2020)"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF00563521","volume":"6","author":"R Nowakowski","year":"1989","unstructured":"Nowakowski, R., Parker, A.: Ordered sets, pagenumbers and planarity. Order 6(3), 209\u2013218 (1989)","journal-title":"Order"},{"key":"18_CR29","unstructured":"Ollmann, L.T.: On the book thicknesses of various graphs. In: Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium, vol. 8, p. 459 (1973)"},{"issue":"1","key":"18_CR30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36\u201367 (1989). https:\/\/doi.org\/10.1016\/0022-0000(89)90032-9","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92931-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:52Z","timestamp":1766365312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_18","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":"23 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","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":"23","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":"5","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":"31% - 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.02","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":"8.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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}