{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:48:17Z","timestamp":1742932097061,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439797"},{"type":"electronic","value":"9783031439803"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_18","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"233-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Compact Planar Embeddings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3689-327X","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0358-7102","authenticated-orcid":false,"given":"Meng","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7163-576X","authenticated-orcid":false,"given":"Michael","family":"St Denis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"issue":"12","key":"18_CR1","doi-asserted-by":"publisher","first-page":"278","DOI":"10.3390\/math6120278","volume":"6","author":"M Akram","year":"2018","unstructured":"Akram, M., Mohsan Dar, J., Farooq, A.: Planar graphs under Pythagorean fuzzy environment. Mathematics 6(12), 278 (2018)","journal-title":"Mathematics"},{"key":"18_CR2","unstructured":"Aleardi, L.C., Devillers, O., Schaeffer, G.: Dynamic updates of succinct triangulations. Technical report (2005)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00453-010-9452-7","volume":"62","author":"J Barbay","year":"2012","unstructured":"Barbay, J., Castelli Aleardi, L., He, M., Munro, J.I.: Succinct representation of labeled graphs. Algorithmica 62, 224\u2013257 (2012)","journal-title":"Algorithmica"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-13509-5_13","volume-title":"Combinatorial Pattern Matching","author":"GE Blelloch","year":"2010","unstructured":"Blelloch, G.E., Farzan, A.: Succinct representations of separable graphs. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 138\u2013150. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13509-5_13"},{"issue":"4","key":"18_CR5","first-page":"924","volume":"34","author":"YT Chiang","year":"2005","unstructured":"Chiang, Y.T., Lin, C.C., Lu, H.I.: Orderly spanning trees with applications. Soc. Ind. Appl. Math. J. Comput. 34(4), 924\u2013945 (2005)","journal-title":"Soc. Ind. Appl. Math. J. Comput."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-642-02927-1_37","volume-title":"Automata, Languages and Programming","author":"A Farzan","year":"2009","unstructured":"Farzan, A., Munro, J.I.: Dynamic succinct ordered trees. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 439\u2013450. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_37"},{"key":"18_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101630","volume":"89","author":"L Ferres","year":"2020","unstructured":"Ferres, L., Fuentes-Sep\u00falveda, J., Gagie, T., He, M., Navarro, G.: Fast and compact planar embeddings. Comput. Geom. 89, 101630 (2020)","journal-title":"Comput. Geom."},{"key":"18_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2022.101922","volume":"109","author":"J Fuentes-Sep\u00falveda","year":"2023","unstructured":"Fuentes-Sep\u00falveda, J., Navarro, G., Seco, D.: Navigating planar topologies in near-optimal space and time. Comput. Geom. 109, 101922 (2023)","journal-title":"Comput. Geom."},{"key":"18_CR9","unstructured":"Gagie, T., Wild, S.: Succinct Euler-Tour trees. In: He, M., Sheehy, D. (eds.) Proceedings of the 33rd Canadian Conference on Computational Geometry, Dalhousie University, Halifax, Nova Scotia, Canada, 10\u201312 August 2021, pp. 368\u2013376 (2021)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1007\/s00224-017-9768-7","volume":"61","author":"J Holm","year":"2017","unstructured":"Holm, J., Rotenberg, E.: Dynamic planar embeddings of dynamic graphs. Theory Comput. Syst. 61, 1054\u20131083 (2017)","journal-title":"Theory Comput. Syst."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Irribarra-Cort\u00e9s, A., Fuentes-Sep\u00falveda, J., Seco, D., As\u00edn, R.: Speeding up compact planar graphs by using shallower trees. In: 2022 Data Compression Conference, pp. 282\u2013291. IEEE (2022)","DOI":"10.1109\/DCC52660.2022.00036"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: 30th Annual Symposium on Foundations of Computer Science, pp. 549\u2013554. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Kammer, F., Meintrup, J.: Succinct planar encoding with minor operations. arXiv Computing Research Repository abs\/2301.10564 (2023). https:\/\/doi.org\/10.48550\/arXiv.2301.10564","DOI":"10.48550\/arXiv.2301.10564"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0166-218X(93)E0150-W","volume":"58","author":"K Keeler","year":"1995","unstructured":"Keeler, K., Westbrook, J.: Short encodings of planar graphs and maps. Discret. Appl. Math. 58(3), 239\u2013252 (1995)","journal-title":"Discret. Appl. Math."},{"key":"18_CR15","unstructured":"Levin, O.: Discrete mathematics: an open introduction (2021)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"JI Munro","year":"1996","unstructured":"Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37\u201342. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-62034-6_35"},{"issue":"3","key":"18_CR17","first-page":"1","volume":"10","author":"G Navarro","year":"2014","unstructured":"Navarro, G., Sadakane, K.: Fully functional static and dynamic succinct trees. Assoc. Comput. Mach. Trans. Algorithms 10(3), 1\u201339 (2014)","journal-title":"Assoc. Comput. Mach. Trans. Algorithms"},{"key":"18_CR18","unstructured":"von Staudt, K.G.C.: Geometrie de Lage. Bauer und Raspe, N\u00fcrnberg (1847)"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","volume":"8","author":"G Tur\u00e1n","year":"1984","unstructured":"Tur\u00e1n, G.: On the succinct representation of graphs. Discret. Appl. Math. 8(3), 289\u2013294 (1984)","journal-title":"Discret. Appl. Math."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.4153\/CJM-1963-029-x","volume":"15","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: A census of planar maps. Can. J. Math. 15, 249\u2013271 (1963)","journal-title":"Can. J. Math."},{"key":"18_CR21","volume-title":"Introduction to Graph Theory","author":"RJ Wilson","year":"2010","unstructured":"Wilson, R.J.: Introduction to Graph Theory. Prentice Hall\/Pearson, New York (2010)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43980-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:03:55Z","timestamp":1695125035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","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":"47","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":"31","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":"66% - 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":"3","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":"3","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)"}}]}}