{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:57:35Z","timestamp":1762505855907},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_14","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"136-147","source":"Crossref","is-referenced-by-count":21,"title":["Edge Routing with Ordered Bundles"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Pupyrev","sequence":"first","affiliation":[]},{"given":"Lev","family":"Nachmanson","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Bereg","sequence":"additional","affiliation":[]},{"given":"Alexander E.","family":"Holroyd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/43.703928","volume":"17","author":"H.-F.S. Chen","year":"1998","unstructured":"Chen, H.-F.S., Lee, D.T.: On crossing minimization problem. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems\u00a017, 406\u2013418 (1998)","journal-title":"IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems"},{"issue":"6","key":"14_CR2","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 Trans. on Visualization and Computer Graphics\u00a014(6), 1277\u20131284 (2008)","journal-title":"IEEE Trans. on Visualization and Computer Graphics"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-11805-0_15","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2010","unstructured":"Dwyer, T., Nachmanson, L.: Fast Edge-Routing for Large Graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 147\u2013158. Springer, Heidelberg (2010)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Gansner, E., Hu, Y., North, S., Scheidegger, C.: Multilevel agglomerative edge bundling for visualizing large graphs. In: Proc. IEEE Pacific Visualization Symposium (to appear, 2011)","DOI":"10.1109\/PACIFICVIS.2011.5742389"},{"key":"14_CR5","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)"},{"key":"14_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. Int. Conf. on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"5","key":"14_CR8","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"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D. Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Computer Graphics Forum\u00a028(3), 983\u2013990 (2009)","journal-title":"Computer Graphics Forum"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1111\/j.1467-8659.2009.01700.x","volume":"29","author":"A. Lambert","year":"2010","unstructured":"Lambert, A., Bourqui, R., Auber, D.: Winding Roads: Routing edges into bundles. Computer Graphics Forum\u00a029(3 ), 853\u2013862 (2010)","journal-title":"Computer Graphics Forum"},{"key":"14_CR11","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":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-11805-0_36","volume-title":"Graph Drawing","author":"M. N\u00f6llenburg","year":"2010","unstructured":"N\u00f6llenburg, M.: An Improved Algorithm for the Metro-Line Crossing Minimization Problem. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 381\u2013392. Springer, Heidelberg (2010)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-18469-7_30","volume-title":"Graph Drawing","author":"S. Pupyrev","year":"2011","unstructured":"Pupyrev, S., Nachmanson, L., Kaufmann, M.: Improving Layered Graph Layouts with Edge Bundling. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 329\u2013340. Springer, Heidelberg (2011)"},{"key":"14_CR14","unstructured":"Gephi dataset, \n                    \n                      http:\/\/wiki.gephi.org\/index.php?title=Datasets"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:41:26Z","timestamp":1555879286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}