{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T03:51:03Z","timestamp":1770004263373,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030358013","type":"print"},{"value":"9783030358020","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_41","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"545-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Stories in Small Area"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Borrazzo","sequence":"first","affiliation":[]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"6","key":"41_CR1","doi-asserted-by":"publisher","first-page":"2196","DOI":"10.1007\/s00453-018-0530-6","volume":"81","author":"P Angelini","year":"2019","unstructured":"Angelini, P., Bekos, M.A.: Hierarchical partial planarity. Algorithmica 81(6), 2196\u20132221 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0530-6","journal-title":"Algorithmica"},{"key":"41_CR2","doi-asserted-by":"publisher","unstructured":"Beck, F., Burch, M., Diehl, S., Weiskopf, D.: The state of the art in visualizing dynamic graphs. In: Borgo, R., Maciejewski, R., Viola, I. (eds.) Eurographics Conference on Visualization, EuroVis 2014 - State of the Art Reports, STARs, Swansea, UK, 9\u201313 June 2014. Eurographics Association (2014). https:\/\/doi.org\/10.2312\/eurovisstar.20141174","DOI":"10.2312\/eurovisstar.20141174"},{"issue":"11","key":"41_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., Brandes, U., Di Battista, G., Didimo, W., Gaertler, M., Palladino, P., Patrignani, M., Symvonis, A., Zweig, K.A.: 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":"41_CR4","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 349\u2013381. Chapman and Hall\/CRC (2013)"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Borrazzo, M., Da Lozzo, G., Frati, F., Patrignani, M.: Graph stories in small area. CoRR abs\/1908.09318 (2019)","DOI":"10.1007\/978-3-030-35802-0_41"},{"issue":"2","key":"41_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., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: 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":"5","key":"41_CR7","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":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-18173-8_11","volume-title":"Algorithms and Complexity","author":"G Da Lozzo","year":"2015","unstructured":"Da Lozzo, G., Rutter, I.: Planarity of streamed graphs. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 153\u2013166. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_11"},{"issue":"1","key":"41_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"},{"key":"41_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"},{"issue":"5","key":"41_CR11","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":"41_CR12","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":"41_CR13","first-page":"147","volume":"2","author":"D Dolev","year":"1984","unstructured":"Dolev, D., Leighton, F., Trickey, H.: Planar embedding of planar graphs. Adv. Comput. Res. 2, 147\u2013161 (1984)","journal-title":"Adv. Comput. Res."},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-77537-9_33","volume-title":"Graph Drawing","author":"F Frati","year":"2008","unstructured":"Frati, F., Patrignani, M.: A note on minimum-area straight-line drawings of planar graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 339\u2013344. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77537-9_33"},{"key":"41_CR15","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":"41_CR16","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1007\/978-1-4939-2864-4_157","volume-title":"Encyclopedia of Algorithms","author":"GF Italiano","year":"2016","unstructured":"Italiano, G.F.: Fully dynamic planarity testing. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 806\u2013808. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_157"},{"issue":"4","key":"41_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)","journal-title":"Internet Math."},{"key":"41_CR18","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, Montr\u00e9al, Qu\u00e9bec, Canada, 23\u201325 May 1994, pp. 706\u2013715. ACM (1994). https:\/\/doi.org\/10.1145\/195058.195439","DOI":"10.1145\/195058.195439"},{"issue":"2","key":"41_CR19","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. Softw. Eng. 7(2), 223\u2013228 (1981). https:\/\/doi.org\/10.1109\/TSE.1981.234519","journal-title":"IEEE Trans. Softw. Eng."},{"key":"41_CR20","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"},{"key":"41_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-45803-7_2","volume-title":"Graph Drawing","author":"M Schaefer","year":"2014","unstructured":"Schaefer, M.: Picking planar edges; or, drawing a graph with a planar subgraph. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 13\u201324. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_2"},{"key":"41_CR22","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"},{"issue":"1","key":"41_CR23","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54(1), 150\u2013168 (1932). http:\/\/www.jstor.org\/stable\/2371086","journal-title":"Am. J. Math."}],"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-030-35802-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:06:10Z","timestamp":1701133570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}