{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:29:48Z","timestamp":1766377788603,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_12","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"130-141","source":"Crossref","is-referenced-by-count":7,"title":["1-Planar Graphs have Constant Book Thickness"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Till","family":"Bruckdorfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chrysanthi","family":"Raftopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-03841-4_8","volume-title":"Graph Drawing","author":"M.. J. Alam","year":"2013","unstructured":"Alam, M. J., Brandenburg, F.J., Kobourov, S.G.: Straight-line grid drawings of 3-connected 1-planar graphs. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 83\u201394. Springer, Heidelberg (2013)"},{"key":"12_CR2","unstructured":"Bekos, M., Gronemann, M., Raftopoulou, C.: Two-page book embeddings of 4-planar graphs. In: STACS. LIPIcs, vol.\u00a025, pp. 137\u2013148. Schloss Dagstuhl (2014)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, C.N.: The book thickness of 1-planar graphs is constant. CoRR, abs\/1503.04990 (2015)","DOI":"10.1007\/s00453-016-0203-2"},{"issue":"3","key":"12_CR4","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.: The book thickness of a graph. Combinatorial Theory\u00a027(3), 320\u2013331 (1979)","journal-title":"Combinatorial Theory"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1049\/ip-e.1992.0021","volume":"139","author":"T. Bilski","year":"1992","unstructured":"Bilski, T.: Embedding graphs in books: a survey. IEEE Proceedings Computers and Digital Techniques\u00a0139(2), 134\u2013138 (1992)","journal-title":"IEEE Proceedings Computers and Digital Techniques"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/mana.3211170125","volume":"117","author":"R. Bodendiek","year":"1984","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: \u00dcber 1-optimale graphen. Mathematische Nachrichten\u00a0117(1), 323\u2013339 (1984)","journal-title":"Mathematische Nachrichten"},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S. Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM Journal on Computing\u00a042(5), 1803\u20131829 (2013)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"12_CR8","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. Mathematical Programming\u00a026(3), 287\u2013294 (1983)","journal-title":"Mathematical Programming"},{"issue":"4","key":"12_CR9","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.: Graph treewidth and geometric thickness parameters. Discrete and Computational Geometry\u00a037(4), 641\u2013670 (2007)","journal-title":"Discrete and Computational Geometry"},{"issue":"1","key":"12_CR10","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.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica\u00a049(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Heath, L.: Embedding planar graphs in seven pages. In: FOCS, pp. 74\u201383. IEEE (1984)","DOI":"10.1109\/SFCS.1984.715903"},{"key":"12_CR12","unstructured":"Heath, L.: Algorithms for Embedding Graphs in Books. PhD thesis, University of North Carolina (1985)"},{"issue":"7","key":"12_CR13","first-page":"835","volume":"20","author":"P. Kainen","year":"2007","unstructured":"Kainen, P., Overbay, S.: Extension of a theorem of whitney. AML\u00a020(7), 835\u2013837 (2007)","journal-title":"AML"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"V. Korzhik","year":"2013","unstructured":"Korzhik, V., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. Journal of Graph Theory\u00a072(1), 30\u201371 (2013)","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"12_CR15","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})$ . Journal of Algorithms\u00a017(1), 85\u2013109 (1994)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"12_CR16","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})$ . Journal of Algorithms\u00a017(1), 71\u201384 (1994)","journal-title":"Journal of Algorithms"},{"key":"12_CR17","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity: Graphs, Structures, and Algorithms","author":"J. Nesetril","year":"2012","unstructured":"Nesetril, J., Ossona de Mendez, P.: Sparsity: Graphs, Structures, and Algorithms. Algorithms and Combinatorics, vol.\u00a028. Springer, New York (2012)"},{"key":"12_CR18","unstructured":"Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. In: Hamiltonian Cycles, ch. 10. Dover Books on Mathematics, pp. 171\u2013184. Courier Dover Publications (2008)"},{"key":"12_CR19","unstructured":"Ollmann, T.: On the book thicknesses of various graphs. In: Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium, vol.\u00a0VIII, p. 459 (1973)"},{"issue":"2","key":"12_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.35834\/mjms\/1316092491","volume":"19","author":"S. Overbay","year":"2007","unstructured":"Overbay, S.: Graphs with small book thickness. Missouri Journal of Mathematical Science\u00a019(2), 121\u2013130 (2007)","journal-title":"Missouri Journal of Mathematical Science"},{"key":"12_CR21","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":"12_CR22","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. Journal of Computer and System Science\u00a038(1), 36\u201367 (1989)","journal-title":"Journal of Computer and System Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T09:56:36Z","timestamp":1748598996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}