{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:48:47Z","timestamp":1742989727677,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_22","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"304-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Complexity of\u00a0the\u00a0Storyplan Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9110","authenticated-orcid":false,"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9794-1928","authenticated-orcid":false,"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8618-2444","authenticated-orcid":false,"given":"William J.","family":"Lenhart","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0280-741X","authenticated-orcid":false,"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.11.016","volume":"575","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Neuwirth, D.: Advancements on SEFE and partitioned book embedding problems. Theoret. Comput. Sci. 575, 71\u201389 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.11.016","journal-title":"Theoret. Comput. Sci."},{"key":"22_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.) EuroVis 2014. Eurographics Association (2014). https:\/\/doi.org\/10.2312\/eurovisstar.20141174","DOI":"10.2312\/eurovisstar.20141174"},{"issue":"11","key":"22_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":"22_CR4","unstructured":"Binucci, C., Di Giacomo, E., Lenhart, W.J., Liotta, G., Montecchiani, F., N\u00f6llenburg, M., Symvonis, A.: On the complexity of the storyplan problem. CoRR abs\/2209.00453 (2022). https:\/\/arxiv.org\/abs\/2209.00453"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358\u2013402 (1996). https:\/\/doi.org\/10.1006\/jagm.1996.0049","journal-title":"J. Algorithms"},{"issue":"3","key":"22_CR6","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."},{"key":"22_CR7","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. Theoret. Comput. Sci. 799, 1\u201321 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.09.029","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.jvlc.2014.05.001","volume":"25","author":"E Di Giacomo","year":"2014","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F., Tollis, I.G.: Techniques for edge stratification of complex graph drawings. J. Vis. Lang. Comput. 25(4), 533\u2013543 (2014). https:\/\/doi.org\/10.1016\/j.jvlc.2014.05.001","journal-title":"J. Vis. Lang. Comput."},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 1\u201337 (2019). https:\/\/doi.org\/10.1145\/3301281","DOI":"10.1145\/3301281"},{"key":"22_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-6533-5","volume-title":"Beyond Planar Graphs","year":"2020","unstructured":"Hong, S.-H., Tokuyama, T. (eds.): Beyond Planar Graphs. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","volume":"58","author":"B Monien","year":"1988","unstructured":"Monien, B., Sudborough, I.H.: Min Cut is NP-complete for edge weighted trees. Theor. Comput. Sci. 58, 209\u2013229 (1988). https:\/\/doi.org\/10.1016\/0304-3975(88)90028-X","journal-title":"Theor. Comput. Sci."},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35(1), 39\u201361 (1983). https:\/\/doi.org\/10.1016\/0095-8956(83)90079-5","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986). https:\/\/doi.org\/10.1016\/0196-6774(86)90023-4","DOI":"10.1016\/0196-6774(86)90023-4"},{"issue":"4","key":"22_CR14","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":"22_CR15","doi-asserted-by":"publisher","unstructured":"Skambath, M., Tantau, T.: Offline drawing of dynamic trees: algorithmics and document integration. In: Hu, Y., N\u00f6llenburg, M. (eds.) Graph Drawing and Network Visualization (GD\u201916). LNCS, vol. 9801, pp. 572\u2013586. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_44","DOI":"10.1007\/978-3-319-50106-2_44"},{"issue":"10","key":"22_CR16","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1109\/TVCG.2015.2507595","volume":"22","author":"C Vehlow","year":"2016","unstructured":"Vehlow, C., Beck, F., Weiskopf, D.: Visualizing dynamic hierarchies in graph sequences. IEEE Trans. Vis. Comput. Graph. 22(10), 2343\u20132357 (2016). https:\/\/doi.org\/10.1109\/TVCG.2015.2507595","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:05:13Z","timestamp":1704351913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_22","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)"}}]}}