{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T06:04:02Z","timestamp":1732341842808,"version":"3.28.0"},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100010607","name":"Universit\u00e0 degli Studi di Perugia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010607","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021856","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2022TS4Y3N","2022ME9Z78"],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1016\/j.ins.2024.121642","type":"journal-article","created":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T16:43:32Z","timestamp":1731689012000},"page":"121642","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Introducing fairness in network visualization"],"prefix":"10.1016","volume":"691","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4820-5112","authenticated-orcid":false,"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1698-3868","authenticated-orcid":false,"given":"Seokhee","family":"Hong","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7088-920X","authenticated-orcid":false,"given":"Tommaso","family":"Piselli","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2024.121642_br0010","series-title":"GD 2020","first-page":"3","article-title":"Graph drawing via gradient descent, (gd)2","volume":"vol. 12590","author":"Ahmed","year":"2020"},{"issue":"6","key":"10.1016\/j.ins.2024.121642_br0020","first-page":"2388","article-title":"Multicriteria scalable graph drawing via stochastic gradient descent, (sgd)2","volume":"28","author":"Ahmed","year":"2022","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"10.1016\/j.ins.2024.121642_br0030","first-page":"1086","article-title":"Fairsight: visual analytics for fairness in decision making","volume":"26","author":"Ahn","year":"2020","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"10.1016\/j.ins.2024.121642_br0040","series-title":"Graph Drawing and Network Visualization - 28th International Symposium, GD 2020","first-page":"115","article-title":"VAIM: visual analytics for influence maximization","volume":"vol. 12590","author":"Arleo","year":"2020"},{"issue":"10","key":"10.1016\/j.ins.2024.121642_br0050","doi-asserted-by":"crossref","first-page":"3428","DOI":"10.1109\/TVCG.2022.3190623","article-title":"Influence maximization with visual analytics","volume":"28","author":"Arleo","year":"2022","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"10.1016\/j.ins.2024.121642_br0060","series-title":"Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015","first-page":"44","article-title":"A million edge drawing for a fistful of dollars","volume":"vol. 9411","author":"Arleo","year":"2015"},{"key":"10.1016\/j.ins.2024.121642_br0070","series-title":"Graph Drawing and Network Visualization - 24th International Symposium, GD 2016","first-page":"3","article-title":"A distributed multilevel force-directed algorithm","volume":"vol. 9801","author":"Arleo","year":"2016"},{"key":"10.1016\/j.ins.2024.121642_br0080","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2016.11.012","article-title":"Large graph visualizations using a distributed computing platform","volume":"381","author":"Arleo","year":"2017","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.ins.2024.121642_br0090","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1109\/TPDS.2018.2869805","article-title":"A distributed multilevel force-directed algorithm","volume":"30","author":"Arleo","year":"2019","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.ins.2024.121642_br0100","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.comgeo.2016.03.001","article-title":"Orthogonal graph drawing with inflexible edges","volume":"55","author":"Bl\u00e4sius","year":"2016","journal-title":"Comput. Geom."},{"year":"2005","series-title":"Modern Multidimensional Scaling: Theory and Applications","author":"Borg","key":"10.1016\/j.ins.2024.121642_br0110"},{"key":"10.1016\/j.ins.2024.121642_br0120","series-title":"IEEE VAST 2019","first-page":"46","article-title":"FAIRVIS: visual analytics for discovering intersectional bias in machine learning","author":"Cabrera","year":"2019"},{"issue":"3","key":"10.1016\/j.ins.2024.121642_br0130","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1111\/cgf.14034","article-title":"The state of the art in enhancing trust in machine learning models with the use of visualizations","volume":"39","author":"Chatzimparmpas","year":"2020","journal-title":"Comput. Graph. Forum"},{"key":"10.1016\/j.ins.2024.121642_br0140","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.ins.2020.12.069","article-title":"Online force-directed algorithms for visualization of dynamic graphs","volume":"556","author":"Cheong","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.121642_br0150","series-title":"Handbook on Graph Drawing and Visualization","first-page":"543","article-title":"The open graph drawing framework (OGDF)","author":"Chimani","year":"2013"},{"key":"10.1016\/j.ins.2024.121642_br0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120188","article-title":"Automatic annotation of protected attributes to support fairness optimization","volume":"663","author":"Consuegra-Ayala","year":"2024","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.121642_br0170","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.dam.2022.10.013","article-title":"House of graphs 2.0: a database of interesting graphs and more","volume":"325","author":"Coolsaet","year":"2023","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.ins.2024.121642_br0180","doi-asserted-by":"crossref","first-page":"1:1","DOI":"10.1145\/2049662.2049663","article-title":"The university of Florida sparse matrix collection","volume":"38","author":"Davis","year":"2011","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/j.ins.2024.121642_br0190","series-title":"ICML 2021","first-page":"2568","article-title":"Multidimensional scaling: approximation and complexity","volume":"vol. 139","author":"Demaine","year":"2021"},{"key":"10.1016\/j.ins.2024.121642_br0200","series-title":"GD 2019","first-page":"291","article-title":"Stress-plus-x (SPX) graph layout","volume":"vol. 11904","author":"Devkota","year":"2019"},{"year":"1999","series-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista","key":"10.1016\/j.ins.2024.121642_br0210"},{"key":"10.1016\/j.ins.2024.121642_br0230","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.ins.2019.07.097","article-title":"Visual querying and analysis of temporal fiscal networks","volume":"505","author":"Didimo","year":"2019","journal-title":"Inf. Sci."},{"issue":"1","key":"10.1016\/j.ins.2024.121642_br0240","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/TVCG.2021.3114813","article-title":"A critical reflection on visualization research: where do decision making tasks hide?","volume":"28","author":"Dimara","year":"2022","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"10.1016\/j.ins.2024.121642_br0250","series-title":"Handbook on Graph Drawing and Visualization","first-page":"223","article-title":"Planar orthogonal and polyline drawing algorithms","author":"Duncan","year":"2013"},{"issue":"3","key":"10.1016\/j.ins.2024.121642_br0260","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1111\/j.1467-8659.2009.01449.x","article-title":"Scalable, versatile and simple constrained graph layout","volume":"28","author":"Dwyer","year":"2009","journal-title":"Comput. Graph. Forum"},{"key":"10.1016\/j.ins.2024.121642_br0270","article-title":"Interactive, constraint-based layout of engineering diagrams","volume":"13","author":"Dwyer","year":"2008","journal-title":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol."},{"key":"10.1016\/j.ins.2024.121642_br0280","series-title":"AAAI 2022","first-page":"6631","article-title":"Modification-fair cluster editing","author":"Froese","year":"2022"},{"key":"10.1016\/j.ins.2024.121642_br0290","series-title":"GD 2004","first-page":"239","article-title":"Graph drawing by stress majorization","volume":"vol. 3383","author":"Gansner","year":"2004"},{"issue":"2","key":"10.1016\/j.ins.2024.121642_br0300","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/S0097539794277123","article-title":"On the computational complexity of upward and rectilinear planarity testing","volume":"31","author":"Garg","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ins.2024.121642_br0310","series-title":"FAccT 2021","first-page":"438","article-title":"Socially fair k-means clustering","author":"Ghadiri","year":"2021"},{"issue":"3","key":"10.1016\/j.ins.2024.121642_br0320","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1111\/cgf.13440","article-title":"Setcola: high-level constraints for graph layout","volume":"37","author":"Hoffswell","year":"2018","journal-title":"Comput. Graph. Forum"},{"key":"10.1016\/j.ins.2024.121642_br0330","series-title":"Machine Learning Methods in Visualisation for Big Data","article-title":"Introducing fairness in graph visualization via gradient descent","author":"Hong","year":"2024"},{"key":"10.1016\/j.ins.2024.121642_br0340","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123429","article-title":"A survey on influence maximization models","volume":"248","author":"Jaouadi","year":"2024","journal-title":"Expert Syst. Appl."},{"volume":"vol. 2025","year":"2001","series-title":"Drawing Graphs, Methods and Models","key":"10.1016\/j.ins.2024.121642_br0350"},{"key":"10.1016\/j.ins.2024.121642_br0360","series-title":"GD 2013","first-page":"448","article-title":"Incremental grid-like layout using soft and hard constraints","volume":"vol. 8242","author":"Kieffer","year":"2013"},{"key":"10.1016\/j.ins.2024.121642_br0370","series-title":"ICML 2019","first-page":"3458","article-title":"Guarantees for spectral clustering with fairness constraints","volume":"vol. 97","author":"Kleindessner","year":"2019"},{"key":"10.1016\/j.ins.2024.121642_br0380","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119521","article-title":"Active learning with fairness-aware clustering for fair classification considering multiple sensitive attributes","volume":"647","author":"Liu","year":"2023","journal-title":"Inf. Sci."},{"issue":"6","key":"10.1016\/j.ins.2024.121642_br0390","doi-asserted-by":"crossref","first-page":"115:1","DOI":"10.1145\/3457607","article-title":"A survey on bias and fairness in machine learning","volume":"54","author":"Mehrabi","year":"2022","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.ins.2024.121642_br0400","series-title":"14th IEEE Pacific Visualization Symposium","first-page":"166","article-title":"Sublinear-time algorithms for stress minimization in graph drawing","author":"Meidiana","year":"2021"},{"key":"10.1016\/j.ins.2024.121642_br0410","series-title":"ICML 2023","first-page":"27564","article-title":"Fair neighbor embedding","volume":"vol. 202","author":"Peltonen","year":"2023"},{"key":"10.1016\/j.ins.2024.121642_br0420","series-title":"NeurIPS 2018","first-page":"10999","article-title":"The price of fair PCA: one extra dimension","author":"Samadi","year":"2018"},{"issue":"3","key":"10.1016\/j.ins.2024.121642_br0430","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","article-title":"On embedding a graph in the grid with the minimum number of bends","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ins.2024.121642_br0440","series-title":"NeurIPS 2019","first-page":"15135","article-title":"Multi-criteria dimensionality reduction with applications to fairness","author":"Tantipongpipat","year":"2019"},{"key":"10.1016\/j.ins.2024.121642_br0450","series-title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019","first-page":"5997","article-title":"Group-fairness in influence maximization","author":"Tsang","year":"2019"},{"key":"10.1016\/j.ins.2024.121642_br0460","series-title":"Proceedings of the International Workshop on Software Fairness, FairWare@ICSE 2018","first-page":"1","article-title":"Fairness definitions explained","author":"Verma","year":"2018"},{"issue":"2","key":"10.1016\/j.ins.2024.121642_br0470","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/TVCG.2020.3030471","article-title":"Visual analysis of discrimination in machine learning","volume":"27","author":"Wang","year":"2021","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"10.1016\/j.ins.2024.121642_br0480","series-title":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018","first-page":"841","article-title":"Optimizing network structure for preventative health","author":"Wilder","year":"2018"},{"key":"10.1016\/j.ins.2024.121642_br0490","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119064","article-title":"A fairness-aware graph contrastive learning recommender framework for social tagging systems","volume":"640","author":"Xu","year":"2023","journal-title":"Inf. Sci."},{"issue":"9","key":"10.1016\/j.ins.2024.121642_br0500","doi-asserted-by":"crossref","first-page":"2738","DOI":"10.1109\/TVCG.2018.2859997","article-title":"Graph drawing by stochastic gradient descent","volume":"25","author":"Zheng","year":"2019","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025524015561?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025524015561?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T02:58:39Z","timestamp":1732330719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025524015561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":49,"alternative-id":["S0020025524015561"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2024.121642","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Introducing fairness in network visualization","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2024.121642","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"121642"}}