{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T04:59:18Z","timestamp":1770526758912,"version":"3.49.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319272603","type":"print"},{"value":"9783319272610","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_16","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T01:24:59Z","timestamp":1448501099000},"page":"192-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["On Minimizing Crossings in Storyline Visualizations"],"prefix":"10.1007","author":[{"given":"Irina","family":"Kostitsyna","sequence":"first","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Valentin","family":"Polishchuk","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"Darren","family":"Strash","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D Adolphson","year":"1973","unstructured":"Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math. 25(3), 403\u2013423 (1973)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/1020084","volume":"20","author":"FRK Chung","year":"1978","unstructured":"Chung, F.R.K.: A conjectured minimum valuation tree (I. Cahit). SIAM Rev. 20(3), 601\u2013604 (1978)","journal-title":"SIAM Rev."},{"key":"16_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Disc. Meth. 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Muelder, C., Crnovrsanin, T., Sallaberry, A., Ma, K.-L.: Egocentric storylines for visual analysis of large dynamic graphs. In: IEEE Big Data\u201913, pp. 56\u201362 (2013)","DOI":"10.1109\/BigData.2013.6691715"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Pach, J., Rubin, N., Tardos, G.: On the Richter-Thomassen conjecture about pairwise intersecting closed curves. In: Discrete Algorithms (SODA\u201915), pp. 1506\u20131516 (2015)","DOI":"10.1137\/1.9781611974331.ch68"},{"key":"16_CR7","first-page":"56","volume":"17","author":"MA \u0160e\u012ddvasser","year":"1970","unstructured":"\u0160e\u012ddvasser, M.A.: The optimal numbering of the vertices of a tree. Diskret. Analiz 17, 56\u201374 (1970)","journal-title":"Diskret. Analiz"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. System Sci. 26(3), 362\u2013391 (1983)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybernet. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"issue":"12","key":"16_CR10","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.-L.: Design considerations for optimizing storyline visualizations. IEEE Trans. Vis. Comput. Graph. 18(12), 2679\u20132688 (2012)","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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T20:11:33Z","timestamp":1569269493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}