{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T05:34:13Z","timestamp":1770528853891,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_29","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"365-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Computing Storyline Visualizations with Few Block Crossings"],"prefix":"10.1007","author":[{"given":"Thomas C.","family":"van Dijk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7833-0454","authenticated-orcid":false,"given":"Fabian","family":"Lipp","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Markfelder","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-24318-4_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Balyo","year":"2015","unstructured":"Balyo, T., Sanders, P., Sinz, C.: HordeSat: a massively parallel portfolio SAT solver. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 156\u2013172. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_12"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-27261-0_11","volume-title":"Graph Drawing and Network Visualization","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Kaufmann, M., Zielke, C.: The book embedding problem from a SAT-solving perspective. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 125\u2013138. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_11"},{"issue":"5","key":"29_CR3","doi-asserted-by":"publisher","first-page":"873","DOI":"10.7155\/jgaa.00443","volume":"21","author":"TC van Dijk","year":"2017","unstructured":"van Dijk, T.C., Fink, M., Fischer, N., Lipp, F., Markfelder, P., Ravsky, A., Suri, S., Wolff, A.: Block crossings in storyline visualizations. J. Graph Algorithms Appl. 21(5), 873\u2013913 (2017). https:\/\/doi.org\/10.7155\/jgaa.00443","journal-title":"J. Graph Algorithms Appl."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"van Dijk, T.C., Lipp, F., Markfelder, P., Wolff, A.: Computing storyline visualizations with few block crossings. arXiv report http:\/\/arxiv.org\/abs\/1709.01055 (2017)","DOI":"10.1007\/978-3-319-73915-1_29"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-72788-0_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"N E\u00e9n","year":"2007","unstructured":"E\u00e9n, N., Mishchenko, A., S\u00f6rensson, N.: Applying logic synthesis for speeding up SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 272\u2013286. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72788-0_26"},{"key":"29_CR6","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: MiniSat SAT solver (2003). http:\/\/minisat.se"},{"key":"29_CR7","first-page":"71","volume":"6","author":"L Gil","year":"2008","unstructured":"Gil, L., Flores, P., Silveira, L.M.: PMSat: a parallel version of MiniSAT. J. Satisf. Bool. Model. Comput. 6, 71\u201398 (2008). https:\/\/satassociation.org\/jsat\/index.php\/jsat\/article\/view\/70","journal-title":"J. Satisf. Bool. Model. Comput."},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-50106-2_29","volume-title":"Graph Drawing and Network Visualization","author":"M Gronemann","year":"2016","unstructured":"Gronemann, M., J\u00fcnger, M., Liers, F., Mambelli, F.: Crossing minimization in storyline visualization. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 367\u2013381. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_29"},{"key":"29_CR9","doi-asserted-by":"publisher","unstructured":"Kim, N.W., Card, S.K., Heer, J.: Tracing genealogical data with TimeNets. In: Proceedings of the International Conference on Advanced Visual Interfaces (AVI 2010), pp. 241\u2013248 (2010). https:\/\/doi.org\/10.1145\/1842993.1843035","DOI":"10.1145\/1842993.1843035"},{"key":"29_CR10","volume-title":"The Art of Computer Programming, Volume 3: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edn. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)","edition":"2"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-27261-0_16","volume-title":"Graph Drawing and Network Visualization","author":"I Kostitsyna","year":"2015","unstructured":"Kostitsyna, I., N\u00f6llenburg, M., Polishchuk, V., Schulz, A., Strash, D.: On minimizing crossings in storyline visualizations. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 192\u2013198. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_16"},{"key":"29_CR12","unstructured":"Munroe, R.: Movie narrative charts (2009). https:\/\/xkcd.com\/657\/. Accessed 16 Feb 2017"},{"issue":"12","key":"29_CR13","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1109\/TVCG.2012.212","volume":"18","author":"Y Tanahashi","year":"2012","unstructured":"Tanahashi, Y., Ma, K.: Design considerations for optimizing storyline visualizations. IEEE Trans. Vis. Comput. Graph. 18(12), 2679\u20132688 (2012). https:\/\/doi.org\/10.1109\/TVCG.2012.212","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF00410640","volume":"4","author":"M Wertheimer","year":"1923","unstructured":"Wertheimer, M.: Untersuchungen zur Lehre von der Gestalt. II. Psychologische Forschung 4(1), 301\u2013350 (1923)","journal-title":"Psychologische Forschung"}],"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-319-73915-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:24:40Z","timestamp":1710242680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","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":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}