{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:42:50Z","timestamp":1759333370294,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T00:00:00Z","timestamp":1692230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T00:00:00Z","timestamp":1692230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000187","name":"University of British Columbia Graduate School","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000187","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000187","name":"University of British Columbia Graduate School","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000187","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":[[2023,10]]},"DOI":"10.1007\/s00373-023-02699-9","type":"journal-article","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T03:19:17Z","timestamp":1692242357000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Exponential Bound for Simultaneous Embeddings of Planar Graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Ritesh","family":"Goenka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2735-6966","authenticated-orcid":false,"given":"Pardis","family":"Semnani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi Hoi","family":"Yip","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,17]]},"reference":[{"issue":"2","key":"2699_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00318","volume":"18","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Cheng, Z., Devanny, W.E., Eppstein, D.: Superpatterns and universal point sets. J. Graph Algorithms Appl. 18(2), 177\u2013209 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"2699_CR2","first-page":"349","volume-title":"Handbook of graph drawing and visualization, discrete mathematics and its applications ch. 11","author":"T Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embeddings of planar graphs. In: Tamassia, R. (ed.) Handbook of graph drawing and visualization, discrete mathematics and its applications ch. 11, pp. 349\u2013382. Chapman and Hall\/CRC (2013)"},{"issue":"2","key":"2699_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P Brass","year":"2007","unstructured":"Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D.P., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. 36(2), 117\u2013130 (2007)","journal-title":"Comput. Geom."},{"key":"2699_CR4","volume-title":"Research problems in discrete geometry","author":"P Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research problems in discrete geometry. Springer, New York (2005)"},{"issue":"1","key":"2699_CR5","doi-asserted-by":"publisher","first-page":"529","DOI":"10.7155\/jgaa.00374","volume":"19","author":"J Cardinal","year":"2015","unstructured":"Cardinal, J., Hoffmann, M., Kusters, V.: On universal point sets for planar graphs. J. Graph Algorithms Appl. 19(1), 529\u2013547 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"2699_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/74074.74088","volume":"20","author":"M Chrobak","year":"1989","unstructured":"Chrobak, M., Karloff, H.J.: A lower bound on the size of universal sets for planar graphs. ACM SIGACT News 20(4), 83\u201386 (1989)","journal-title":"ACM SIGACT News"},{"issue":"4","key":"2699_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inform. Process. Lett. 54(4), 241\u2013246 (1995)","journal-title":"Inform. Process. Lett."},{"key":"2699_CR8","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight-line representing of planar graphs. Acta Sci. Math. (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"issue":"1","key":"2699_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"2","key":"2699_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ipl.2004.06.009","volume":"92","author":"M Kurowski","year":"2004","unstructured":"Kurowski, M.: A $$1.235$$ lower bound on the number of points needed to draw all $$n$$-vertex planar graphs. Inform. Process. Lett. 92(2), 95\u201398 (2004)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"2699_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.7155\/jgaa.00529","volume":"24","author":"M Scheucher","year":"2020","unstructured":"Scheucher, M., Schrezenmaier, H., Steiner, R.: A note on universal point sets for planar graphs. J. Graph Algorithms Appl. 24(3), 247\u2013267 (2020)","journal-title":"J. Graph Algorithms Appl."},{"doi-asserted-by":"crossref","unstructured":"Steiner, R.: A logarithmic bound for simultaneous embeddings of planar graphs, arXiv preprint, arXiv:2305.19186 (2023). To appear in the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)","key":"2699_CR12","DOI":"10.1007\/978-3-031-49275-4_9"},{"key":"2699_CR13","first-page":"26","volume":"46","author":"K Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresbericht Deutsch. Math. Verein. 46, 26\u201332 (1936)","journal-title":"Jahresbericht Deutsch. Math. Verein."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02699-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02699-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02699-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T07:45:03Z","timestamp":1729928703000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02699-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,17]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["2699"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02699-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,8,17]]},"assertion":[{"value":"5 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"100"}}