{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T11:47:10Z","timestamp":1747136830718,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"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-22203-0_21","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"289-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Small Point-Sets Supporting Graph Stories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4224-1550","authenticated-orcid":false,"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2463-3772","authenticated-orcid":false,"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-4567","authenticated-orcid":false,"given":"Fabrizio","family":"Grosso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4481-698X","authenticated-orcid":false,"given":"Giacomo","family":"Ortali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9806-7411","authenticated-orcid":false,"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"issue":"2\u20133","key":"21_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2008.08.004","volume":"408","author":"M Badent","year":"2008","unstructured":"Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. Theor. Comput. Sci. 408(2\u20133), 129\u2013142 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2008.08.004","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1111\/cgf.12791","volume":"36","author":"F Beck","year":"2017","unstructured":"Beck, F., Burch, M., Diehl, S., Weiskopf, D.: A taxonomy and survey of dynamic graph visualization. Comput. Graph. Forum 36(1), 133\u2013159 (2017). https:\/\/doi.org\/10.1111\/cgf.12791","journal-title":"Comput. Graph. Forum"},{"issue":"11","key":"21_CR3","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ipl.2012.02.011","volume":"112","author":"C Binucci","year":"2012","unstructured":"Binucci, C., et al.: Drawing trees in a streaming model. Inf. Process. Lett. 112(11), 418\u2013422 (2012). https:\/\/doi.org\/10.1016\/j.ipl.2012.02.011","journal-title":"Inf. Process. Lett."},{"key":"21_CR4","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Handbook on Graph Drawing and Visualization, pp. 349\u2013381. Chapman and Hall\/CRC (2013)"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.7155\/jgaa.00530","volume":"24","author":"M Borrazzo","year":"2020","unstructured":"Borrazzo, M., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Graph stories in small area. J. Graph Algorithms Appl. 24(3), 269\u2013292 (2020). https:\/\/doi.org\/10.7155\/jgaa.00530","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P Bra\u00df","year":"2007","unstructured":"Bra\u00df, P., et al.: On simultaneous planar graph embeddings. Comput. Geom. 36(2), 117\u2013130 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.05.006","journal-title":"Comput. Geom."},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"681","DOI":"10.7155\/jgaa.00375","volume":"19","author":"TM Chan","year":"2015","unstructured":"Chan, T.M., Frati, F., Gutwenger, C., Lubiw, A., Mutzel, P., Schaefer, M.: Drawing partially embedded and simultaneously planar graphs. J. Graph Algorithms Appl. 19(2), 681\u2013706 (2015). https:\/\/doi.org\/10.7155\/jgaa.00375","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"RF Cohen","year":"1995","unstructured":"Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: Dynamic graph drawings: trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput. 24(5), 970\u20131001 (1995). https:\/\/doi.org\/10.1137\/S0097539792235724","journal-title":"SIAM J. Comput."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.09.029","volume":"799","author":"G Da Lozzo","year":"2019","unstructured":"Da Lozzo, G., Rutter, I.: Planarity of streamed graphs. Theor. Comput. Sci. 799, 1\u201321 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.09.029","journal-title":"Theor. Comput. Sci."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-46648-7_39","volume-title":"Graph Drawing","author":"C Demetrescu","year":"1999","unstructured":"Demetrescu, C., Di Battista, G., Finocchi, I., Liotta, G., Patrignani, M., Pizzonia, M.: Infinite trees and the future. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 379\u2013391. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46648-7_39"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Di Battista, G., et al.: Small point-sets supporting graph stories (2022). https:\/\/doi.org\/10.48550\/ARXIV.2208.14126","DOI":"10.48550\/ARXIV.2208.14126"},{"issue":"5","key":"21_CR12","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996). https:\/\/doi.org\/10.1137\/S0097539794280736","journal-title":"SIAM J. Comput."},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/inco.2001.3031","volume":"169","author":"G Di Battista","year":"2001","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Incremental convex planarity testing. Inf. Comput. 169(1), 94\u2013126 (2001). https:\/\/doi.org\/10.1006\/inco.2001.3031","journal-title":"Inf. Comput."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-03841-4_23","volume-title":"Graph Drawing","author":"MT Goodrich","year":"2013","unstructured":"Goodrich, M.T., Pszona, P.: Streamed graph drawing and the file maintenance problem. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 256\u2013267. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_23"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Italiano, G.F.: Fully dynamic planarity testing. In: Encyclopedia of Algorithms, pp. 806\u2013808. Springer (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_157","DOI":"10.1007\/978-1-4939-2864-4_157"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/S0097539793258143","volume":"25","author":"H Kaplan","year":"1996","unstructured":"Kaplan, H., Shamir, R.: Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques. SIAM J. Comput. 25(3), 540\u2013561 (1996). https:\/\/doi.org\/10.1137\/S0097539793258143","journal-title":"SIAM J. Comput."},{"issue":"4","key":"21_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016). https:\/\/doi.org\/10.1080\/15427951.2016.1177801","journal-title":"Internet Math."},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Comb. 17(4), 717\u2013728 (2001). https:\/\/doi.org\/10.1007\/PL00007258","journal-title":"Graphs Comb."},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Poutr\u00e9, J.A.L.: Alpha-algorithms for incremental planarity testing (preliminary version). In: Leighton, F.T., Goodrich, M.T. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994. Montr\u00e9al, Qu\u00e9bec, Canada, pp. 706\u2013715. ACM (1994). https:\/\/doi.org\/10.1145\/195058.195439","DOI":"10.1145\/195058.195439"},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"EM Reingold","year":"1981","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Software Eng. 7(2), 223\u2013228 (1981). https:\/\/doi.org\/10.1109\/TSE.1981.234519","journal-title":"IEEE Trans. Software Eng."},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-00219-9_24","volume-title":"Graph Drawing","author":"A Rextin","year":"2009","unstructured":"Rextin, A., Healy, P.: A fully dynamic algorithm to test the upward planarity of single-source embedded digraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 254\u2013265. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_24"},{"issue":"4","key":"21_CR22","doi-asserted-by":"publisher","first-page":"367","DOI":"10.7155\/jgaa.00298","volume":"17","author":"M Schaefer","year":"2013","unstructured":"Schaefer, M.: Toward a theory of planarity: Hanani-Tutte and planarity variants. J. Graph Algorithms Appl. 17(4), 367\u2013440 (2013). https:\/\/doi.org\/10.7155\/jgaa.00298","journal-title":"J. Graph Algorithms Appl."},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-319-50106-2_44","volume-title":"Graph Drawing and Network Visualization","author":"M Skambath","year":"2016","unstructured":"Skambath, M., Tantau, T.: Offline drawing of dynamic trees: algorithmics and document integration. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 572\u2013586. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_44"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54(1), 150\u2013168 (1932). http:\/\/www.jstor.org\/stable\/2371086","DOI":"10.2307\/2371086"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22203-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:05:09Z","timestamp":1704351909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_21","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":"19 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","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":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"70","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":"25","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":"7","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":"36% - 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.01","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":"7.03","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)"}}]}}