{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:12:38Z","timestamp":1761988358577},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_30","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"329-340","source":"Crossref","is-referenced-by-count":22,"title":["Improving Layered Graph Layouts with Edge\u00a0Bundling"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Pupyrev","sequence":"first","affiliation":[]},{"given":"Lev","family":"Nachmanson","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-00219-9_33","volume-title":"Graph Drawing","author":"E. Argyriou","year":"2009","unstructured":"Argyriou, E., Bekos, M.A., Kaufmann, M., Symvonis, A.: Two polynomial time algorithms for the metro-line crossing minimization problem. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 336\u2013347. Springer, Heidelberg (2009)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-77537-9_24","volume-title":"Graph Drawing","author":"M.A. Bekos","year":"2008","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 231\u2013242. Springer, Heidelberg (2008)"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1109\/TVCG.2008.135","volume":"14","author":"W. Cui","year":"2008","unstructured":"Cui, W., Zhou, H., Qu, H., Wong, P.C., Li, X.: Geometry-based edge clustering for graph visualization. IEEE Transactions on Visualization and Computer Graphics\u00a014, 1277\u20131284 (2008)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"4","key":"30_CR4","first-page":"424","volume":"14","author":"P. Eades","year":"1990","unstructured":"Eades, P., Sugiyama, K.: How to draw a directed graph. Journal of Information Processing\u00a014(4), 424\u2013437 (1990)","journal-title":"Journal of Information Processing"},{"issue":"3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.7155\/jgaa.00111","volume":"9","author":"M. Eiglsperger","year":"2005","unstructured":"Eiglsperger, M., Siebenhaller, M., Kaufmann, M.: An efficient implementation of sugiyamas algorithm for layered graph drawing. Journal of Graph Algorithms and Applications\u00a09(3), 305\u2013325 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-31843-9_20","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2005","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 184\u2013194. Springer, Heidelberg (2005)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"2007","unstructured":"Gansner, E.R., Koren, Y.: Improved circular layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 386\u2013398. Springer, Heidelberg (2007)"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E.R. Gansner","year":"1993","unstructured":"Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.-P.: A technique for drawing directed graphs. IEEE Transactions on Software Engineering\u00a019(3), 214\u2013230 (1993)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"5","key":"30_CR9","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D. Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics\u00a012(5), 741\u2013748 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. In: Computer Graphics Forum, vol.\u00a028, pp. 983\u2013990 (2009)","DOI":"10.1111\/j.1467-8659.2009.01450.x"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Physical Review E\u00a080(1) (2008)","DOI":"10.1103\/PhysRevE.80.016118"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-77537-9_38","volume-title":"Graph Drawing","author":"L. Nachmanson","year":"2008","unstructured":"Nachmanson, L., Robertson, G., Lee, B.: Drawing graphs with GLEE. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 389\u2013394. Springer, Heidelberg (2008)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Newbery, F.J.: Edge concentration: A method for clustering directed graphs. In: Proc. 2nd Int. Workshop on Software Configuration Management, pp. 76\u201385 (1989)","DOI":"10.1145\/72910.73350"},{"issue":"2","key":"30_CR14","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. on Systems, Man, and Cybernetics\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"key":"30_CR15","volume-title":"The Visual Display of Quantitative Information","author":"E.R. Tufte","year":"1983","unstructured":"Tufte, E.R.: The Visual Display of Quantitative Information. Graphics Press, CT (1983)"},{"key":"30_CR16","unstructured":"The AT&T graph collection. \n                    \n                      http:\/\/www.graphdrawing.org\n                    \n                    \n                  ."},{"key":"30_CR17","unstructured":"http:\/\/research.microsoft.com\/en-us\/projects\/specexplorer\n                    \n                    \n                  ."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T04:29:15Z","timestamp":1553401755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}