{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T11:05:16Z","timestamp":1791457516217,"version":"4.3.4"},"reference-count":96,"publisher":"IBM","issue":"2\/3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IBM J. Res. &amp; Dev."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1147\/jrd.2015.2411412","type":"journal-article","created":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T18:45:31Z","timestamp":1429901131000},"page":"14:1-14:16","source":"Crossref","is-referenced-by-count":33,"title":["Readability metric feedback for aiding node-link visualization designers"],"prefix":"10.1147","volume":"59","author":[{"given":"C.","family":"Dunne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. I.","family":"Ross","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Shneiderman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Martino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"3082","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/APVIS.2007.329282"},{"key":"ref72","author":"huang","year":"2006","journal-title":"An eye tracking study into the effects of graph layout"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00152"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/11618058_24"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1002\/acp.997"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102785"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/1377966.1377970"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00219-9_20"},{"key":"ref75","author":"huang","year":"2007","journal-title":"Beyond Time and Error A Cognitive Approach to the Evaluation of Graph Visualizations"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1038\/324446a0"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/1865841.1865854"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-011-0473-2"},{"key":"ref33","first-page":"131","article-title":"Using spring algorithms to remove node overlapping","author":"li","year":"0","journal-title":"Proc APVIS"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00194-6"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2397696.2397712"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/2945.841119"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1054972.1055031"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"ref35","first-page":"149","article-title":"A heuristic for graph drawing","volume":"42","author":"eades","year":"0","journal-title":"Proc CN"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.1995.1010"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63938-1_67"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0021827"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/OZCHI.1998.732199"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016344215610"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18469-7_15"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500013"},{"key":"ref27","first-page":"213","article-title":"Aesthetic of angular resolution for node-link diagrams: Validation and algorithm","author":"huang","year":"0","journal-title":"Proc IEEE Symp VL\/HCC"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1037\/1076-898X.8.1.57"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00054"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01956.x"},{"key":"ref67","first-page":"199","article-title":"How people read sociograms: A questionnaire study","author":"huang","year":"0","journal-title":"Proc APVIS"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.155"},{"key":"ref69","author":"huang","year":"2005","journal-title":"Layout effects Comparison of sociogram drawing conventions"},{"key":"ref2","author":"aris","year":"2008","journal-title":"Visualizing and Exploring Networks Using Semantic Substrates"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74800-7_24"},{"key":"ref20","author":"battista","year":"1998","journal-title":"Graph Drawing Algorithms for the Visualization of Graphs"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TSE.1979.234212","article-title":"tidy drawings of trees","volume":"se 5","author":"wetherell","year":"1979","journal-title":"IEEE Transactions on Software Engineering"},{"key":"ref21","author":"ware","year":"2004","journal-title":"Information Visualization Perception for Design"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/234535.234538"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/774833.774857"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvlc.2011.12.002"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/VLHCC.2010.32"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00219-9_28"},{"key":"ref51","author":"smith","year":"0","journal-title":"NodeXL A Free and Open Network Overview Discovery and Exploration Add-In for Excel 2007\/2010\/2013"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03113.x"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00051"},{"key":"ref92","author":"smith","year":"0","journal-title":"(2013) NodeXLGraph Gallery"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/2470654.2466444"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90120-7"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1057\/ivs.2009.10"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62495-3_57"},{"key":"ref57","first-page":"424","article-title":"How to draw a directed graph","volume":"13","author":"eades","year":"1990","journal-title":"J Inf Process"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199612)26:12<1415::AID-SPE69>3.0.CO;2-P"},{"key":"ref55","author":"moreno","year":"1953","journal-title":"Who Shall Survive? Foundations of Sociometry Group Psychotherapy and Sociodrama"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035315.ch38"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.cageo.2008.08.009"},{"key":"ref52","first-page":"207","article-title":"Predicting graph reading performance: A cognitive approach","author":"huang","year":"0","journal-title":"Proc APVIS"},{"key":"ref10","author":"purchase","year":"1996","journal-title":"Graph drawing aesthetic metrics"},{"key":"ref11","author":"dunne","year":"2013","journal-title":"Measuring and improving the readability of network visualizations"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1556262.1556288"},{"key":"ref12","author":"dunne","year":"2009","journal-title":"Improving Graph Drawing Readability by Incorporating Readability Metrics A Software Tool for Network Analysts"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2009.120"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2004.1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.141"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1137\/0222063"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1142\/sseke"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"ref17","first-page":"57","article-title":"The aesthetics of graph visualization","author":"bennett","year":"0","journal-title":"Proc 3rd Eurograph Conf Comput Aesthetics Graph Visual Imag Comput Aesthetics"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12400"},{"key":"ref18","first-page":"312","article-title":"What is a good diagram? A pragmatic approach","author":"batini","year":"0","journal-title":"Proc 4th Int Conf ER Approach Softw Eng"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31843-9_46"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)00014-X"},{"key":"ref80","first-page":"51","article-title":"How people read graphs","author":"huang","year":"0","journal-title":"Proc APVIS"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(72)90045-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1556460.1556497"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.166"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1101\/gr.1239303"},{"key":"ref5","first-page":"1","article-title":"Gephi: An open source software for exploring and manipulating networks","author":"bastian","year":"0","journal-title":"Proc ICWSM"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24595-7_40"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1124772.1124889"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/PASSAT\/SocialCom.2011.139"},{"key":"ref7","first-page":"47","article-title":"Pajek&#x2014;Program for large network analysis","volume":"21","author":"batagelj","year":"1998","journal-title":"Connections"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00004"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36763-2_2"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.122"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S1045-926X(02)90232-6"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022371615202"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70904-6_44"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.02.016"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-37623-2_28"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/scj.1104"},{"key":"ref41","first-page":"253","article-title":"Algorithms for disjoint node images","author":"eades","year":"0","journal-title":"Proceedings of the 15th ACSAC"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/11618058_15"},{"key":"ref43","first-page":"349","article-title":"Force-transfer: A new approach to removing overlapping nodes in graph layout","author":"huang","year":"0","journal-title":"Proc 26th ACSAC"}],"container-title":["IBM Journal of Research and Development"],"original-title":[],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T20:39:33Z","timestamp":1609187973000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/lpdocs\/epic03\/wrapper.htm?arnumber=7094971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":96,"journal-issue":{"issue":"2\/3"},"URL":"https:\/\/doi.org\/10.1147\/jrd.2015.2411412","relation":{},"ISSN":["0018-8646","0018-8646"],"issn-type":[{"value":"0018-8646","type":"print"},{"value":"0018-8646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}