{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:58:26Z","timestamp":1769572706606,"version":"3.49.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319501055","type":"print"},{"value":"9783319501062","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_30","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"382-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Block Crossings in Storyline Visualizations"],"prefix":"10.1007","author":[{"given":"Thomas C.","family":"van Dijk","sequence":"first","affiliation":[]},{"given":"Martin","family":"Fink","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Fabian","family":"Lipp","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Markfelder","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Ravsky","sequence":"additional","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.7155\/jgaa.00237","volume":"15","author":"K Buchin","year":"2011","unstructured":"Buchin, K., van Kreveld, M.J., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. J. Graph Algorithms Appl. 15(4), 533\u2013549 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/110851390","volume":"26","author":"L Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discrete Math. 26(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"30_CR3","unstructured":"van Dijk, T.C., Fink, M., Fischer, N., Lipp, F., Markfelder, P., Ravsky, A., Suri, S., Wolff, A.: Block crossings in storyline visualizations (2016). \n                      http:\/\/arxiv.org\/abs\/1609.00321"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","volume":"241","author":"H Eriksson","year":"2001","unstructured":"Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., W\u00e4stlund, J.: Sorting a bridge hand. Discrete Math. 241(1), 289\u2013300 (2001)","journal-title":"Discrete Math."},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.7155\/jgaa.00351","volume":"19","author":"M Fink","year":"2015","unstructured":"Fink, M., Pupyrev, S., Wolff, A.: Ordering metro lines by block crossings. J. Graph Algorithms Appl. 19(1), 111\u2013153 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Kim, N.W., Card, S.K., Heer, J.: Tracing genealogical data with timenets. In: Proceedings of the International Conference Advanced Visual Interfaces (AVI 2010), pp. 241\u2013248 (2010)","DOI":"10.1145\/1842993.1843035"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"key":"30_CR8","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, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27261-0_16"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(77)90148-0","volume":"17","author":"JI Moore","year":"1977","unstructured":"Moore, J.I.: Interval hypergraphs and $$D$$-interval hypergraphs. Discrete Math. 17(2), 173\u2013179 (1977)","journal-title":"Discrete Math."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Muelder, C., Crnovrsanin, T., Sallaberry, A., Ma, K.: Egocentric storylines for visual analysis of large dynamic graphs. In: Proceedings of the IEEE International Conference Big Data, pp. 56\u201362 (2013)","DOI":"10.1109\/BigData.2013.6691715"},{"key":"30_CR11","unstructured":"Munroe, R.: Movie narrative charts. \n                      https:\/\/xkcd.com\/657\/"},{"issue":"12","key":"30_CR12","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)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"4","key":"30_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0012-365X(76)80011-8","volume":"16","author":"WT Trotter","year":"1976","unstructured":"Trotter, W.T., Moore, J.I.: Characterization problems for graphs, partially ordered sets, lattices, and families of sets. Discrete Math. 16(4), 361\u2013381 (1976)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:43:08Z","timestamp":1600476188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}