{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:51Z","timestamp":1740107151866,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T00:00:00Z","timestamp":1567555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T00:00:00Z","timestamp":1567555200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS-1400653"],"award-info":[{"award-number":["DMS-1400653"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00373-019-02077-4","type":"journal-article","created":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T05:53:56Z","timestamp":1567576436000},"page":"303-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Crossing Number of 2-Page Book Drawings of $$K_{n}$$ with Prescribed Number of Edges in Each Page"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4695-5454","authenticated-orcid":false,"given":"Bernardo","family":"\u00c1brego","sequence":"first","affiliation":[]},{"given":"Silvia","family":"Fern\u00e1ndez-Merchant","sequence":"additional","affiliation":[]},{"given":"Evgeniya","family":"Lagoda","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Ramos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,4]]},"reference":[{"key":"2077_CR1","first-page":"121","volume":"71","author":"PC Kainen","year":"1990","unstructured":"Kainen, P.C.: The book thickness of a graph II. Congressus Numerantium 71, 121\u2013132 (1990)","journal-title":"Congressus Numerantium"},{"key":"2077_CR2","doi-asserted-by":"crossref","unstructured":"Six, J. M., Tollis, I. G.: Circular drawings of biconnected graphs. In: Proc. Workshop on Algorithm Engineering and Experimentation (ALENEX99), pp. 57\u201373. Springer, LNCS (1999)","DOI":"10.1007\/3-540-48518-X_4"},{"key":"2077_CR3","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1016\/j.dam.2007.05.009","volume":"155","author":"R Cimikowski","year":"2007","unstructured":"Cimikowski, R., Mumey, B.: Approximating the fixed linear crossing number. Discrete Appl. Math. 155, 2202\u20132210 (2007)","journal-title":"Discrete Appl. Math."},{"key":"2077_CR4","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1049\/ip-e.1992.0021","volume":"139","author":"T Bilski","year":"1992","unstructured":"Bilski, T.: Embeddings graphs in books: a survey. IEEE Proc. Comput. Digit. Tech. 139, 134\u2013138 (1992)","journal-title":"IEEE Proc. Comput. Digit. Tech."},{"key":"2077_CR5","first-page":"339","volume":"6","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6, 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2077_CR6","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 vsli design. SIAM J. Algebraic Discrete Math. 8, 33\u201358 (1987)","journal-title":"SIAM J. Algebraic Discrete Math."},{"key":"2077_CR7","first-page":"75","volume":"19","author":"E Damiani","year":"1994","unstructured":"Damiani, E., D\u2019Antona, O., Salemi, P.: An upper bound to the crossing number of the complete graph drawn on the pages of a book. J. Comb. Inf. Syst. Sci. 19, 75\u201384 (1994)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"2077_CR8","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1137\/120886777","volume":"27","author":"E de Klerk","year":"2012","unstructured":"de Klerk, E., Pasechnik, D.V., Salazar, G.: Improved lower bounds on book crossing numbers of complete graphs. SIAM J. Discrete Math. 27, 619\u2013633 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"2077_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.0.CO;2-S","volume":"21","author":"F Shahrokhi","year":"1996","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: The book crossing number of a graph. J. Graph Theory 21, 413\u2013424 (1996)","journal-title":"J. Graph Theory"},{"key":"2077_CR10","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B. M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Salazar, G.: The $$2$$-page crossing number of $$K_n$$. In: 28th Ann. ACM Symp., pp. 397\u2013403. Computational Geometry. Chapel Hill, NC, USA (2012)","DOI":"10.1145\/2261250.2261310"},{"key":"2077_CR11","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00454-013-9514-0","volume":"49\u20134","author":"BM \u00c1brego","year":"2013","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Salazar, G.: The 2-page crossing number of $$K_{n}$$. Discrete Comput. Geom. 49\u20134, 747\u2013777 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"2077_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0013091500025645","volume":"13","author":"F Harary","year":"1963","unstructured":"Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinb. Math. Soc. 13, 333\u2013338 (1963)","journal-title":"Proc. Edinb. Math. Soc."},{"key":"2077_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00283-009-9120-4","volume":"32","author":"L Beineke","year":"2010","unstructured":"Beineke, L., Wilson, R.: The early history of the brick factory problem. Math. Intell. 32, 41\u201348 (2010)","journal-title":"Math. Intell."},{"key":"2077_CR14","first-page":"113","volume-title":"Theory of Graphs and its Applications","author":"J Bla\u017eek","year":"1964","unstructured":"Bla\u017eek, J., Koman, M.: A minimal problem concerning complete plane graphs. In: Fiedler, M. (ed.) Theory of Graphs and its Applications, pp. 113\u2013117. Czech Academy of Science, Prague (1964)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02077-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02077-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02077-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T23:29:11Z","timestamp":1599089351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02077-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2077"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02077-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,9,4]]},"assertion":[{"value":"5 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}