{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T16:09:39Z","timestamp":1784131779069,"version":"3.55.0"},"reference-count":66,"publisher":"Wiley","license":[{"start":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T00:00:00Z","timestamp":1781136000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T00:00:00Z","timestamp":1781136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100013209","name":"Hellenic Foundation for Research and Innovation","doi-asserted-by":"publisher","award":["26320"],"award-info":[{"award-number":["26320"]}],"id":[{"id":"10.13039\/501100013209","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We introduce\n                    <jats:italic>\n                      C\n                      <jats:sc>lusterix<\/jats:sc>\n                    <\/jats:italic>\n                    , a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges.\n                    <jats:italic>\n                      C\n                      <jats:sc>lusterix<\/jats:sc>\n                    <\/jats:italic>\n                    offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network. This is achieved through matrix\u2010based representations at various hierarchy levels, combined with a node\u2010link style linear layout at the leaf level. To support layout computation based on\n                    <jats:italic>\n                      C\n                      <jats:sc>lusterix<\/jats:sc>\n                    <\/jats:italic>\n                    , we propose two algorithmic approaches: an exact Integer Linear Program and a fast heuristic, both aimed at minimizing edge crossings. We present an extensive experimental comparison of these algorithmic approaches to highlight the trade\u2010offs between efficiency and effectiveness. Moreover, as a proof of concept for our model, we developed an interactive visualization system based on\n                    <jats:italic>\n                      C\n                      <jats:sc>lusterix<\/jats:sc>\n                    <\/jats:italic>\n                    and evaluated its performance through case studies and qualitative feedback from experts in different application domains.\n                  <\/jats:p>","DOI":"10.1111\/cgf.70469","type":"journal-article","created":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T10:47:27Z","timestamp":1781174847000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["C\n                    <scp>lusterix<\/scp>\n                    : A Hybrid Visualization Model for Hierarchically Clustered Networks"],"prefix":"10.1111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9110","authenticated-orcid":false,"given":"Carla","family":"Binucci","sequence":"first","affiliation":[{"name":"University of Perugia  Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8427-3246","authenticated-orcid":false,"given":"Annika","family":"Bonerath","sequence":"additional","affiliation":[{"name":"University of Bonn  Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[{"name":"University of Perugia  Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[{"name":"John Cabot University  Italy"},{"name":"Technical University of Munich  Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1698-3868","authenticated-orcid":false,"given":"Seok\u2010Hee","family":"Hong","sequence":"additional","affiliation":[{"name":"University of Sydney  Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4500-0112","authenticated-orcid":false,"given":"Maria Eleni","family":"Pavlidi","sequence":"additional","affiliation":[{"name":"University of Ioannina  Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[{"name":"University of Perugia  Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2026,6,11]]},"reference":[{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18469-7_7"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2022.09.019"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36763-2_8"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73915-1_18"},{"key":"e_1_2_8_6_2","doi-asserted-by":"crossref","unstructured":"AngoriL. DidimoW. MontecchianiF. PagliucaD. TappiniA.: Hybrid graph visualizations with chordlink: Algorithms experiments and applications.IEEE Trans. Vis. Comput. Graph. (2020). doi:10.1109\/TVCG.2020.3016055. 2 3","DOI":"10.1109\/TVCG.2020.3016055"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2014.11.016"},{"key":"e_1_2_8_8_2","unstructured":"AynaudT.:python-louvain: Louvain algorithm for community detection 2020. URL:https:\/\/pypi.org\/project\/python-louvain\/. 7"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.265"},{"key":"e_1_2_8_11_2","doi-asserted-by":"crossref","unstructured":"BehrischM. BachB. RicheN. H. SchreckT. FeketeJ.: Matrix reordering methods for table and network visualization.Comput. Graph. Forum(2016). doi:10.1111\/CGF.12935. 10","DOI":"10.1111\/cgf.12935"},{"key":"e_1_2_8_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-023-01142-Y"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1111\/CGF.14440"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_2_8_15_2","unstructured":"BekosM. A. HaugM. KaufmannM. M\u00e4nneckeJ.: An online framework to interact and efficiently compute linear layouts of graphs.CoRR abs\/2003.09642(2020). arXiv:2003.09642. 4"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(79)90021-2"},{"key":"e_1_2_8_17_2","doi-asserted-by":"crossref","unstructured":"BekosM. A. KaufmannM. ZielkeC.: The book embedding problem from a sat-solving perspective. InGraph Drawing and Network Visualization(2016). doi:10.1007\/978-3-319-27261-0_11. 6","DOI":"10.1007\/978-3-319-27261-0_11"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.185"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.4018\/IJSWIS.2013100102"},{"key":"e_1_2_8_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/VLHCC.2016.7739664"},{"key":"e_1_2_8_21_2","doi-asserted-by":"crossref","unstructured":"CorteseP. F. Di BattistaG.: Clustered planarity. InACM Symposium on Computational Geometry(2015) MitchellJ. S. B. RoteG. (Eds.). doi:10.1145\/1064092.1064093. 3","DOI":"10.1145\/1064092.1064093"},{"key":"e_1_2_8_22_2","doi-asserted-by":"crossref","unstructured":"CorteseP. F. Di BattistaG. FratiF. PatrignaniM. PizzoniaM.: C-planarity of c-connected clustered graphs.J. Graph Algorithms Appl. (2018). doi:10.7155\/JGAA.00165. 3","DOI":"10.7155\/jgaa.00165"},{"key":"e_1_2_8_23_2","unstructured":"COIN-OR Foundation Inc.:Optimization with PuLP. URL:https:\/\/coin-or.github.io\/pulp\/index.html. 8"},{"key":"e_1_2_8_24_2","doi-asserted-by":"crossref","unstructured":"deColP. KluteF. N\u00f6llenburgM.: Mixed linear layouts: Complexity heuristics and experiments. InGraph Drawing GD(2019) ArchambaultD. T\u00f3thC. D. (Eds.). doi:10.1007\/978-3-030-35802-0_35. 4","DOI":"10.1007\/978-3-030-35802-0_35"},{"key":"e_1_2_8_25_2","unstructured":"Di GiacomoE. DidimoW. F\u00f6rsterH. UeckerdtT. ZinkJ.: Linear layouts of graphs with priority queues. InInternational Symposium on Algorithms and Data Structures WADS(2025) MorinP. OhE. (Eds.) Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. doi:10.4230\/LIPICS.WADS.2025.29. 4"},{"key":"e_1_2_8_26_2","doi-asserted-by":"crossref","unstructured":"Di GiacomoE. DidimoW. GrilliL. LiottaG.: Graph visualization techniques for web clustering engines.IEEE Trans. Vis. Comput. Graph. (2007). doi:10.1109\/TVCG.2007.40. 2","DOI":"10.1109\/TVCG.2007.40"},{"key":"e_1_2_8_27_2","doi-asserted-by":"crossref","unstructured":"Di GiacomoE. DidimoW. LiottaG. MontecchianiF. TappiniA.: Comparative study and evaluation of hybrid visualizations of graphs.IEEE Trans. Vis. Comput. Graph. (2024). doi:10.1109\/TVCG.2022.3233389. 2 3","DOI":"10.1109\/TVCG.2022.3233389"},{"key":"e_1_2_8_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45848-4_5"},{"key":"e_1_2_8_29_2","doi-asserted-by":"crossref","unstructured":"Da LozzoG. EppsteinD. GoodrichM. T. GuptaS.: C-planarity testing of embedded clustered graphs with bounded dual carving-width.Algorithmica(2021). doi:10.1007\/S00453-021-00839-2. 3","DOI":"10.1007\/s00453-021-00839-2"},{"key":"e_1_2_8_30_2","doi-asserted-by":"crossref","unstructured":"Dogrus\u00f6zU. GiralE. CetintasA. CivrilA. DemirE.: A layout algorithm for undirected compound graphs.Inf. Sci. (2009). doi:10.1016\/J.INS.2008.11.017. 2","DOI":"10.1016\/j.ins.2008.11.017"},{"key":"e_1_2_8_31_2","doi-asserted-by":"crossref","unstructured":"DidimoW. MontecchianiF.: Fast layout computation of clustered networks: Algorithmic advances and experimental analysis.Inf. Sci. (2014). doi:10.1016\/J.INS.2013.09.048. 2","DOI":"10.1016\/j.ins.2013.09.048"},{"key":"e_1_2_8_32_2","unstructured":"Durant\u00c9. TappiniA. DidimoW. LiottaG. GhoniemM.: Hybrid multilayer network visualization of bibliographic data. InEurographics Conference on Visualization EuroVis - Posters(2024) KucherK. DiehlA. GillmannC. (Eds.). doi:10.2312\/EVP.20241084. 2"},{"key":"e_1_2_8_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62495-3_41"},{"key":"e_1_2_8_34_2","doi-asserted-by":"crossref","unstructured":"EadesP. FengQ. LinX. NagamochiH.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs.Algorithmica(2006). doi:10.1007\/S00453-004-1144-8. 2 3","DOI":"10.1007\/s00453-004-1144-8"},{"key":"e_1_2_8_35_2","doi-asserted-by":"crossref","unstructured":"EadesP. FengQ. NagamochiH.: Drawing clustered graphs on an orthogonal grid.J. Graph Algorithms Appl. (1999). doi:10.7155\/JGAA.00016. 2 3","DOI":"10.7155\/jgaa.00016"},{"key":"e_1_2_8_36_2","doi-asserted-by":"publisher","DOI":"10.1111\/CGF.14794"},{"key":"e_1_2_8_37_2","doi-asserted-by":"crossref","unstructured":"FengQ. CohenR. F. EadesP.: Planarity for clustered graphs. InAlgorithms - ESA(1995) SpirakisP. G. (Ed.). doi:10.1007\/3-540-60313-1_145. 2 3","DOI":"10.1007\/3-540-60313-1_145"},{"key":"e_1_2_8_38_2","doi-asserted-by":"publisher","DOI":"10.7155\/JGAA.00292"},{"key":"e_1_2_8_39_2","doi-asserted-by":"crossref","unstructured":"FulekR. T\u00f3thC. D.: Atomic embeddability clustered planarity and thickenability.ACM(2022). doi:10.1145\/3502264. 3","DOI":"10.1145\/3502264"},{"key":"e_1_2_8_40_2","unstructured":"Gurobi Optimization LLC:Gurobi Optimizer Reference Manual 2024. URL:https:\/\/www.gurobi.com. 7"},{"key":"e_1_2_8_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.141"},{"key":"e_1_2_8_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70582"},{"key":"e_1_2_8_43_2","doi-asserted-by":"crossref","unstructured":"HuangW. HongS. EadesP.: Layout effects on sociogram perception. InGraph Drawing GD(2005) HealyP. NikolovN. S. (Eds.). doi:10.1007\/11618058_24. 3","DOI":"10.1007\/11618058_24"},{"key":"e_1_2_8_44_2","doi-asserted-by":"crossref","unstructured":"HoltenD. IsenbergP. vanWijkJ. J. FeketeJ.: An extended evaluation of the readability of tapered animated and textured directed-edge representations in node-link graphs. InIEEE Pacific Visualization Symposium PacificVis(2011) BattistaG. D. FeketeJ. QuH. (Eds.). doi:10.1109\/PACIFICVIS.2011.5742390. 4","DOI":"10.1109\/PACIFICVIS.2011.5742390"},{"key":"e_1_2_8_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2015.12.039"},{"key":"e_1_2_8_46_2","doi-asserted-by":"crossref","unstructured":"HeathL. S. RosenbergA. L.: Laying out graphs using queues.SIAM J. Comput. (1992). doi:10.1137\/0221055. 4","DOI":"10.1137\/0221055"},{"key":"e_1_2_8_47_2","doi-asserted-by":"crossref","unstructured":"HagbergA. A. SchultD. A. SwartP. J.: Exploring network structure dynamics and function using networkx.Proceedings of Python in Science Conferences (SciPy)(2008) 11\u201315. doi:10.25080\/TCWV9851. 7","DOI":"10.25080\/TCWV9851"},{"key":"e_1_2_8_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/1518701.1519054"},{"key":"e_1_2_8_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2615308"},{"key":"e_1_2_8_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18638-7"},{"key":"e_1_2_8_51_2","doi-asserted-by":"crossref","unstructured":"JungeblutP. MerkerL. UeckerdtT.: A sublinear bound on the page number of upward planar graphs.SIAM J. Discret. Math. (2023). doi:10.1137\/22M1522450. 4","DOI":"10.1137\/22M1522450"},{"key":"e_1_2_8_52_2","doi-asserted-by":"publisher","DOI":"10.1140\/EPJDS\/S13688-023-00411-8"},{"key":"e_1_2_8_53_2","first-page":"292","volume-title":"International Symposium on Circuits and Systems","author":"Masuda S.","year":"1987"},{"key":"e_1_2_8_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11805-0_40"},{"key":"e_1_2_8_55_2","doi-asserted-by":"crossref","unstructured":"NewmanM. E. J.: Coauthorship networks and patterns of scientific collaboration.National Academy of Sciences(2004). doi:10.1073\/pnas.0307545100. 9","DOI":"10.1073\/pnas.0307545100"},{"key":"e_1_2_8_56_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016344215610"},{"key":"e_1_2_8_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63938-1_67"},{"key":"e_1_2_8_58_2","doi-asserted-by":"crossref","unstructured":"Sreevalsan-NairJ. AgarwalS.: Nodetrix - community hierarchy: Techniques for finding hierarchical communities for visual analytics of small-world networks. InInternational Joint Conference on Computer Vision Imaging and Computer Graphics Theory and Applications (VISIGRAPP)(2017) LinsenL. TeleaA. C. BrazJ. (Eds.). doi:10.5220\/0006175701400151. 2 3 4","DOI":"10.5220\/0006175701400151"},{"key":"e_1_2_8_59_2","unstructured":"SaketB. SimonettoP. KobourovS. G.: Group-level graph visualization taxonomy. InEurographics Conference on Visualization EuroVis(2014) ElmqvistN. HlawitschkaM. KennedyJ. (Eds.) Eurographics Association. doi:10.2312\/EUROVISSHORT.20141162. 5"},{"key":"e_1_2_8_60_2","doi-asserted-by":"publisher","DOI":"10.1142\/4902"},{"key":"e_1_2_8_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.rse.2021.112603"},{"key":"e_1_2_8_62_2","unstructured":"VehlowC. BeckF. WeiskopfD.: The state of the art in visualizing group structures in graphs. InEurographics Conference on Visualization EuroVis - State of the Art Reports(2015) pp.21\u201340. doi:10.2312\/EUROVISSTAR.20151110. 2"},{"key":"e_1_2_8_63_2","doi-asserted-by":"publisher","DOI":"10.1111\/CGF.12872"},{"key":"e_1_2_8_64_2","doi-asserted-by":"publisher","DOI":"10.1057\/PALGRAVE.IVS.9500013"},{"key":"e_1_2_8_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/S11192-017-2488-6"},{"key":"e_1_2_8_66_2","doi-asserted-by":"publisher","DOI":"10.1002\/ASI.21128"},{"key":"e_1_2_8_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2025.3634837"}],"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.70469","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1111\/cgf.70469","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.70469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T15:52:19Z","timestamp":1784130739000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/cgf.70469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,11]]},"references-count":66,"alternative-id":["10.1111\/cgf.70469"],"URL":"https:\/\/doi.org\/10.1111\/cgf.70469","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,11]]},"assertion":[{"value":"2026-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70469"}}