{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:13:44Z","timestamp":1761988424455},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_22","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"226-237","source":"Crossref","is-referenced-by-count":24,"title":["Evaluating Partially Drawn Links for Directed Graph Edges"],"prefix":"10.1007","author":[{"given":"Michael","family":"Burch","sequence":"first","affiliation":[]},{"given":"Corinna","family":"Vehlow","sequence":"additional","affiliation":[]},{"given":"Natalia","family":"Konevtsova","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Weiskopf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5439","key":"22_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/2945.468391","volume":"1","author":"R.A. Becker","year":"1995","unstructured":"Becker, R.A., Eick, S.G., Wilks, A.R.: Visualizing network data. IEEE Transactions on Visualization and Computer Graphics\u00a01(1), 16\u201328 (1995)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"22_CR3","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River (1999)"},{"key":"22_CR4","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium\u00a042, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"issue":"11","key":"22_CR5","first-page":"1129","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software: Practice and Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software: Practice and Experience"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Ghoniem, M., Fekete, J.D., Castagliola, P.: A comparison of the readability of graphs using node-link and matrix-based representations. In: Proc. IEEE Symposium on Information Visualization, pp. 17\u201324 (2004)","DOI":"10.1109\/INFVIS.2004.1"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Holten, D., Isenberg, P., van Wijk, J.J., Fekete, J.D.: An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs. In: Proc. IEEE Pacific Visualization Symposium, pp. 195\u2013202 (2011)","DOI":"10.1109\/PACIFICVIS.2011.5742390"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Holten, D., van Wijk, J.J.: A user study on visualizing directed edges in graphs. In: Proc. SIGCHI Conference on Human Factors in Computing Systems, pp. 2299\u20132308 (2009)","DOI":"10.1145\/1518701.1519054"},{"key":"22_CR9","unstructured":"Huang, W., Eades, P.: How people read graphs. In: Proc. Asia-Pacific Symposium on Information Visualisation, pp. 51\u201358 (2005)"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11618058_24","volume-title":"Graph Drawing","author":"W. Huang","year":"2006","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Layout Effects on Sociogram Perception. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 262\u2013273. Springer, Heidelberg (2006)"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters\u00a031(1), 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"key":"22_CR12","unstructured":"Koffka, K.: Principles of Gestalt Psychology. Harcourt, Brace (1935)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Lee, B., Plaisant, C., Parr, C.S., Fekete, J.-D., Henry, N.: Task taxonomy for graph visualization. In: Proc. AVI Workshop on BEyond time and errors: novel evaLuation methods for Information Visualization, BELIV 2006 (2006)","DOI":"10.1145\/1168149.1168168"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1997","unstructured":"Purchase, H.C.: Which Aesthetic Has the Greatest Effect on Human Understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 248\u2013261. Springer, Heidelberg (1997)"},{"issue":"3","key":"22_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"H.C. Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D., Allder, J.-A.: Empirical evaluation of aesthetics-based graph layout. Empirical Software Engineering\u00a07(3), 233\u2013255 (2002)","journal-title":"Empirical Software Engineering"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","first-page":"435","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1997","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating Graph Drawing Aesthetics. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 435\u2013446. Springer, Heidelberg (1997)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Rosenholtz, R., Li, Y., Mansfield, J., Jin, Z.: Feature congestion: a measure of display clutter. In: Proc. SIGCHI Conference on Human Factors in Computing Systems, pp. 761\u2013770 (2005)","DOI":"10.1145\/1054972.1055078"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Rusu, A., Fabian, A.J., Jianu, R., Rusu, A.: Using the Gestalt principle of closure to alleviate the edge crossing problem in graph drawings. In: Proc. International Conference on Information Visualisation (IV 2011), pp. 488\u2013493 (2011)","DOI":"10.1109\/IV.2011.63"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C. Ware","year":"2002","unstructured":"Ware, C., Purchase, H., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization\u00a01(2), 103\u2013110 (2002)","journal-title":"Information Visualization"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:30:59Z","timestamp":1555878659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}