{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T04:47:24Z","timestamp":1790484444349,"version":"4.1.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1109\/tvcg.2021.3067820","type":"journal-article","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T20:20:26Z","timestamp":1616444426000},"page":"1634-1647","source":"Crossref","is-referenced-by-count":16,"title":["VERTIGo: A Visual Platform for Querying and Exploring Large Multilayer Networks"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3996-2851","authenticated-orcid":false,"given":"Erick","family":"Cuenca","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7068-176X","authenticated-orcid":false,"given":"Arnaud","family":"Sallaberry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8736-3132","authenticated-orcid":false,"given":"Dino","family":"Ienco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"Poncelet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.186"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.122"},{"key":"ref33","author":"kaufmann","year":"2003","journal-title":"Drawing Graphs Methods and Models"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44403-1_24"},{"key":"ref30","author":"ware","year":"2012","journal-title":"Information Visualization Perception for Design"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3173574.3174172"},{"key":"ref36","first-page":"6","article-title":"A Better Default Colormap for Matplotlib","author":"smith","year":"2015","journal-title":"Proc Conf Python Sci"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV.2015.7348077"},{"key":"ref34","first-page":"285","article-title":"Drawing large graphs with a potential-field-based multilevel algorithm","author":"hachul","year":"2004","journal-title":"Proc Int Symp Graph Drawing"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2909132.2909246"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03080.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2744898"},{"key":"ref12","article-title":"GraphVista: Interactive exploration of large graphs","author":"paradies","year":"2015"},{"key":"ref13","first-page":"1","article-title":"VOGUE: Towards a visual interaction-aware graph query processing framework","author":"bhowmick","year":"2013","journal-title":"Proc 6th Biennial Conf Innov Data Syst Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824106"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3221269.3223027"},{"key":"ref16","article-title":"Layer definition and discovery in multilayer network datasets","author":"mcgee","year":"2019","journal-title":"Proc Int Workshop Challenges Multilayer Netw Vis Anal"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/35021BIGCOMP.2015.7072812"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti556"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IV.2005.138"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783343"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465226"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2791347.2791383"},{"key":"ref3","first-page":"547","article-title":"Distance oracles in edge-labeled graphs","author":"bonchi","year":"2014","journal-title":"Proc Int Conf Extending Database Technol"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12644"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007295"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/iV.2015.20"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13610"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/PACIFICVIS.2016.7465267"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626593"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2008.99"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu016"},{"key":"ref20","article-title":"Human factors and multilayer networks","author":"pohl","year":"2019","journal-title":"Proc Int Workshop Challenges Multilayer Netw Vis Anal"},{"key":"ref22","first-page":"337","article-title":"Turbo${}_{\\mbox{iso}}$iso: Towards ultrafast and robust subgraph isomorphism search in large graph databases","author":"han","year":"2013","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.107"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00532"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"ref41","first-page":"206","article-title":"Efficient node overlap removal using a proximity stress model","author":"gansner","year":"2008","journal-title":"Proc Int Symp Graph Drawing"},{"key":"ref23","first-page":"149","article-title":"An improved algorithm for matching large graphs","author":"cordella","year":"2001","journal-title":"Proc 3rd Int Workshop Graph-Based Representations Pattern Recognit"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58961-9_12"},{"key":"ref43","article-title":"How family that runs azerbaijan built an empire of hidden wealth","author":"fitzgibbon","year":"2016","journal-title":"Int Consortium Invest J"},{"key":"ref25","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proc IEEE Int Conf Data Mining"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/9695945\/09382912.pdf?arnumber=9382912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T17:57:02Z","timestamp":1649440622000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9382912\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2021.3067820","relation":{},"ISSN":["1077-2626","1941-0506","2160-9306"],"issn-type":[{"value":"1077-2626","type":"print"},{"value":"1941-0506","type":"electronic"},{"value":"2160-9306","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]}}}