{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:36:08Z","timestamp":1787499368519,"version":"build-2736575974"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T00:00:00Z","timestamp":1472083200000},"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":["Algorithmica"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00453-016-0203-2","type":"journal-article","created":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T15:59:56Z","timestamp":1472140796000},"page":"444-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["The Book Thickness of 1-Planar Graphs is Constant"],"prefix":"10.1007","volume":"79","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Till","family":"Bruckdorfer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chrysanthi N.","family":"Raftopoulou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,25]]},"reference":[{"key":"203_CR1","doi-asserted-by":"crossref","unstructured":"Alam, J., Brandenbur, F.J., Kobourov, S.G.: Straight-line grid drawings of 3-connected 1-planar graphs. In: Graph Drawing, vol. 8242 of LNCS, pp. 83\u201394. Springer, Berlin (2013)","DOI":"10.1007\/978-3-319-03841-4_8"},{"key":"203_CR2","unstructured":"Bekos, M.A,, Gronemann, M., Raftopoulou, C.N.: Two-page book embeddings of 4-planar graphs. In: STACS, vol.\u00a025 of LIPIcs, pp. 137\u2013148. Schloss Dagstuhl, Wadern (2014)"},{"issue":"3","key":"203_CR3","doi-asserted-by":"crossref","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. Combin. Theory Ser. B 27(3), 320\u2013331 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"203_CR4","doi-asserted-by":"crossref","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 Proc. Comput. Digit. Techn. 139(2), 134\u2013138 (1992)","journal-title":"IEEE Proc. Comput. Digit. Techn."},{"issue":"1","key":"203_CR5","doi-asserted-by":"crossref","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. Math. Nachr. 117(1), 323\u2013339 (1984)","journal-title":"Math. Nachr."},{"key":"203_CR6","doi-asserted-by":"crossref","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. CoRR, abs\/1203.5944 (2012)","DOI":"10.1137\/120872310"},{"issue":"3","key":"203_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","volume":"26","author":"G Cornu\u00e9jols","year":"1983","unstructured":"Cornu\u00e9jols, G., Naddef, D., Pulleyblank, W.R.: Halin graphs and the travelling salesman problem. Math. Program. 26(3), 287\u2013294 (1983)","journal-title":"Math. Program."},{"issue":"4","key":"203_CR8","doi-asserted-by":"crossref","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. Discrete Comput. Geom. 37(4), 641\u2013670 (2007)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"203_CR9","doi-asserted-by":"crossref","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)","journal-title":"Algorithmica"},{"key":"203_CR10","doi-asserted-by":"crossref","unstructured":"Heath, L.: Embedding planar graphs in seven pages. In: FOCS, pp. 74\u201383. IEEE, New York (1984)","DOI":"10.1109\/SFCS.1984.715903"},{"key":"203_CR11","unstructured":"Heath, L.S.: Algorithms for embedding graphs in books. Ph.D. thesis, University of North Carolina (1985)"},{"issue":"7\u20138","key":"203_CR12","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","volume":"307","author":"I Fabrici","year":"2007","unstructured":"Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Disc. Math. 307(7\u20138), 854\u2013865 (2007)","journal-title":"Disc. Math."},{"issue":"7","key":"203_CR13","first-page":"835","volume":"20","author":"PC Kainen","year":"2007","unstructured":"Kainen, P.C., Overbay, S.: Extension of a theorem of whitney. AML 20(7), 835\u2013837 (2007)","journal-title":"AML"},{"issue":"1","key":"203_CR14","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1), 30\u201371 (2013)","journal-title":"J. Graph Theory"},{"issue":"1","key":"203_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/jagm.1994.1028","volume":"17","author":"SM Malitz","year":"1994","unstructured":"Malitz, S.M.: Genus $$g$$ g graphs have pagenumber $$o(\\sqrt{q})$$ o ( q ) . J. Algorithms 17(1), 85\u2013109 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"203_CR16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"SM Malitz","year":"1994","unstructured":"Malitz, S.M.: Graphs with $$e$$ e edges have pagenumber $$o(\\sqrt{E})$$ o ( E ) . J. Algorithms 17(1), 71\u201384 (1994)","journal-title":"J. Algorithms"},{"key":"203_CR17","doi-asserted-by":"crossref","unstructured":"Nesetril, J., Ossona de Mendez, P.: Sparsity: graphs, structures, and algorithms. In: Algorithms and Combinatorics, vol. 28. Springer, New York (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"key":"203_CR18","unstructured":"Nishizeki, T., Chiba, N.: Planar graphs: theory and algorithms, Chap. 10. In: Hamiltonian Cycles, pp. 171\u2013184. Dover, New York (2008)"},{"key":"203_CR19","unstructured":"Ollmann, T.L.: On the book thicknesses of various graphs. In: Proceedings of 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, vol. 8 of Congressus Numerantium, p. 459 (1973)"},{"issue":"2","key":"203_CR20","first-page":"121","volume":"19","author":"S Overbay","year":"2007","unstructured":"Overbay, S.: Graphs with small book thickness. Mo. J. Math. Sci. 19(2), 121\u2013130 (2007)","journal-title":"Mo. J. Math. Sci."},{"issue":"3","key":"203_CR21","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"203_CR22","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"H Whitney","year":"1931","unstructured":"Whitney, H.: A theorem on graphs. Ann. Math. 32, 378\u2013390 (1931)","journal-title":"Ann. Math."},{"issue":"1","key":"203_CR23","doi-asserted-by":"crossref","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":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0203-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0203-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0203-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0203-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T19:38:19Z","timestamp":1568317099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0203-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,25]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0203-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,25]]}}}