{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:20:51Z","timestamp":1780352451415,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030002558","type":"print"},{"value":"9783030002565","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_1","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Dispersable Book Embeddings"],"prefix":"10.1007","author":[{"given":"Jawaherul Md.","family":"Alam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: On dispersable book embeddings. CoRR abs\/1803.10030 (2018)","DOI":"10.1007\/978-3-030-00256-5_1"},{"key":"1_CR2","unstructured":"Barnette, D.W.: Conjecture 5. In: Tutte, W.T. (ed.) Recent Progress in Combinatorics, Proceedings of the Third Waterloo Conference on Combinatorics, pp. xiv+347. Academic Press, New York, London (1969)"},{"issue":"1","key":"1_CR3","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":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-27261-0_11","volume-title":"Graph Drawing and Network Visualization","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Kaufmann, M., Zielke, C.: The book embedding problem from a SAT-Solving perspective. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 125\u2013138. Springer, Cham (2015)"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory, Ser. B 27(3), 320\u2013331 (1979)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"1_CR6","unstructured":"Blankenship, R.: Book embeddings of graphs. Ph.D. thesis, Louisiana State University (2003)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0095-8956(72)90030-5","volume":"12","author":"I Bouwer","year":"1972","unstructured":"Bouwer, I.: On edge but not vertex transitive regular graphs. J. Comb. Theory, Ser. B 12(1), 32\u201340 (1972)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0021-9800(69)80087-6","volume":"6","author":"G Chartrand","year":"1969","unstructured":"Chartrand, G., Geller, D.P.: On uniquely colorable planar graphs. J. Comb. Theory 6(3), 271\u2013278 (1969)","journal-title":"J. Comb. Theory"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK 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. Algebraic Discret. Methods 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02591867","volume":"26","author":"G Cornu\u00e9jols","year":"1983","unstructured":"Cornu\u00e9jols, G., Naddef, D., Pulleyblank, W.: Halin graphs and the travelling salesman problem. Math. Program. 26(3), 287\u2013294 (1983)","journal-title":"Math. Program."},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discret. Comput. Geom. 37(4), 641\u2013670 (2007)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"1_CR12","first-page":"339","volume":"6","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On linear layouts of graphs. Discret. Math. Theor. Comput. Sci. 6(2), 339\u2013358 (2004)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0021-9800(67)80069-3","volume":"3","author":"J Folkman","year":"1967","unstructured":"Folkman, J.: Regular line-symmetric graphs. J. Comb. Theory 3(3), 215\u2013232 (1967)","journal-title":"J. Comb. Theory"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF02574056","volume":"13","author":"H de Fraysseix","year":"1995","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: A left-first search algorithm for planar graphs. Discret. Comput. Geom. 13, 459\u2013468 (1995)","journal-title":"Discret. Comput. Geom."},{"key":"1_CR15","unstructured":"Gerbracht, E.: Eleven unit distance embeddings of the Heawood graph. CoRR abs\/0912.5395 (2009)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Heath, L.S.: Embedding planar graphs in seven pages. In: FOCS, pp. 74\u201383. IEEE Computer Society (1984)","DOI":"10.1109\/SFCS.1984.715903"},{"key":"1_CR17","unstructured":"Hoske, D.: Book embedding with fixed page assignments. Bachelor thesis, Karlsruhe Institute for Technology (2012)"},{"key":"1_CR18","unstructured":"Kainen, P.C.: Crossing-free matchings in regular outerplane drawings. In: Knots in Washington XXIX. George Washington Univ., Washington, DC, USA (2009). http:\/\/faculty.georgetown.edu\/kainen\/circLayouts.pdf"},{"issue":"7","key":"1_CR19","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.aml.2006.08.019","volume":"20","author":"PC Kainen","year":"2007","unstructured":"Kainen, P.C., Overbay, S.: Extension of a theorem of Whitney. Appl. Math. Lett. 20(7), 835\u2013837 (2007)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.1994.1028","volume":"17","author":"S Malitz","year":"1994","unstructured":"Malitz, S.: Genus $$g$$ graphs have pagenumber $$O(\\sqrt{g})$$. J. Algorithms 17(1), 85\u2013109 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"S Malitz","year":"1994","unstructured":"Malitz, S.: Graphs with E edges have pagenumber $$O(\\sqrt{E})$$. J. Algorithms 17(1), 71\u201384 (1994)","journal-title":"J. Algorithms"},{"key":"1_CR22","volume-title":"Planar Graphs: Theory and Algorithms","author":"T Nishizeki","year":"1988","unstructured":"Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. Elsevier, New York (1988)"},{"key":"1_CR23","unstructured":"Overbay, S.B.: Generalized book embeddings. Ph.D. thesis, Colorado State University (1998)"},{"key":"1_CR24","volume-title":"Quo Vadis, Graph Theory?","author":"R Steinberg","year":"1993","unstructured":"Steinberg, R.: The state of the three color problem. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory?. Elsevier, New York (1993). Ann. Discret. Math. 55, 211\u2013248"},{"key":"1_CR25","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for maximal planar graphs. Technical report TR-298, EECS Department, Princeton University (1982)"},{"issue":"1","key":"1_CR26","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)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T19:34:23Z","timestamp":1751830463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"30","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":"45% - 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","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":"11,5","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)"}}]}}