{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:11:13Z","timestamp":1770538273432,"version":"3.49.0"},"reference-count":46,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["10.55776\/ESP513"],"award-info":[{"award-number":["10.55776\/ESP513"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007223","name":"Technische Universitat Wien","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007223","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Biofabric is a novel method for network visualization, with promising potential to highlight specific network features. Recent studies emphasize the importance of staircase motifs \u2014 equivalent to fans or stars in node\u2010link diagrams \u2014 within Biofabric. However, to effectively showcase these motifs, we need to formulate specialized layout algorithms. This paper introduces a method to compute optimal layouts for Biofabric, focusing on maximizing staircase formation. We present an Integer Linear Programming (ILP) model for this task and evaluate its performance in terms of scalability and output quality against a leading heuristic method, Degreecending. Our results demonstrate that the ILP approach identifies significantly more, and often longer, staircases compared to Degreecending, albeit with the trade\u2010off of higher computation times. Our supplemental material, including a full copy of the paper, code, and results, is available on osf.io.<\/jats:p>","DOI":"10.1111\/cgf.70139","type":"journal-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T06:23:23Z","timestamp":1747981403000},"update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Staircase Motifs in Biofabric Network Layouts"],"prefix":"10.1111","volume":"44","author":[{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0001-9517-3526","authenticated-orcid":false,"given":"Sara","family":"Di Bartolomeo","sequence":"first","affiliation":[{"name":"TU Wien  Vienna Austria"}]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-2191-4413","authenticated-orcid":false,"given":"Markus","family":"Wallinger","sequence":"additional","affiliation":[{"name":"Technical University of Munich  Germany"}]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[{"name":"TU Wien  Vienna Austria"}]}],"member":"311","published-online":{"date-parts":[[2025,5,23]]},"reference":[{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2024.3456167"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12935"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13446"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0925-7721(96)00005-3"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11336-007-9049-5"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671975"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1901.05155"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_24"},{"key":"e_1_2_9_11_2","unstructured":"Concorde Home Oct.2020. [Online; accessed 27. Nov. 2024]. URL:https:\/\/linproxy.fan.workers.dev:443\/https\/www.math.uwaterloo.ca\/tsp\/concorde.html. 3"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2020.05.009"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2016.29"},{"key":"e_1_2_9_14_2","doi-asserted-by":"crossref","unstructured":"Di BartolomeoS. CrnovrsaninT. SaffoD. PuertaE. WilsonC. DunneC.: Evaluating graph layout algorithms: A systematic review of methods and best practices.Computer Graphics Forum n\/a n\/a (2024) e15073. doi:10.1111\/cgf.15073. 7","DOI":"10.1111\/cgf.15073"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14538"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2021.3114756"},{"key":"e_1_2_9_17_2","doi-asserted-by":"crossref","unstructured":"DoblerA. N\u00f6llenburgM.: On computing optimal linear diagrams. InDiagrammatic Representation and Inference - 13th International Conference Diagrams 2022 Rome Italy September 14\u201316 2022 Proceedings(2022) pp.20\u201336. doi:10.1007\/978-3-031-15146-0\\_2. 3","DOI":"10.1007\/978-3-031-15146-0_2"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2015.2411412"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2470654.2466444"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.15079"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2024.3456312"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"e_1_2_9_23_2","doi-asserted-by":"crossref","unstructured":"GhoniemM. FeketeJ.-D. CastagliolaP.: A comparison of the readability of graphs using node-link and matrix-based representations. InIEEE Symposium on Information Visualization(2004) pp.17\u201324. doi:10.1109\/INFVIS.2004.1. 3","DOI":"10.1109\/INFVIS.2004.1"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70904-6_37"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.221135"},{"key":"e_1_2_9_26_2","unstructured":"Gurobi Optimization LLC:Gurobi optimizer reference manual 2024. URL:https:\/\/linproxy.fan.workers.dev:443\/http\/www.gurobi.com. 7"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-022-1010-5"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.160"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFB0021817"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.7155\/JGAA.00001"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3030475"},{"key":"e_1_2_9_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73915-1_19"},{"key":"e_1_2_9_33_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-275"},{"issue":"3","key":"e_1_2_9_34_2","first-page":"357","article-title":"The barycenter heuristic and the reorderable matrix","volume":"29","author":"M\u00e4kinen E.","year":"2005","journal-title":"Informatica (Slovenia)"},{"key":"e_1_2_9_35_2","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13728"},{"key":"e_1_2_9_36_2","doi-asserted-by":"crossref","unstructured":"NiedermannB. RutterI.: An integer-linear program for bend-minimization in ortho-radial drawings. InGraph Drawing and Network Visualization \u2010 28th International Symposium GD 2020 Vancouver BC Canada September 16\u201318 2020 Revised Selected Papers(2020) pp.235\u2013249. doi:10.1007\/978-3-030-68766-3\\_19. 3","DOI":"10.1007\/978-3-030-68766-3_19"},{"key":"e_1_2_9_37_2","doi-asserted-by":"publisher","DOI":"10.7155\/JGAA.V28I2.2990"},{"key":"e_1_2_9_38_2","doi-asserted-by":"publisher","DOI":"10.1186\/1753-6561-9-S6-S4"},{"key":"e_1_2_9_39_2","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.2002.0232"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep13393"},{"key":"e_1_2_9_41_2","doi-asserted-by":"crossref","unstructured":"RossiR. A. AhmedN. K.: The network data repository with interactive graph analytics and visualization. InAAAI(2015). URL:https:\/\/linproxy.fan.workers.dev:443\/https\/networkrepository.com. 9","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"e_1_2_9_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2933196"},{"key":"e_1_2_9_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2933196"},{"key":"e_1_2_9_44_2","doi-asserted-by":"crossref","unstructured":"van denElzenS. HoltenD. BlaasJ. vanWijkJ. J.: Reordering massive sequence views: Enabling temporal and structural analysis of dynamic networks. In2013 IEEE Pacific Visualization Symposium (PacificVis)(2013) pp.33\u201340. doi:10.1109\/PacificVis.2013.6596125. 3","DOI":"10.1109\/PacificVis.2013.6596125"},{"key":"e_1_2_9_45_2","doi-asserted-by":"crossref","unstructured":"WattenbergM.: Arc diagrams: visualizing structure in strings. InIEEE Symposium on Information Visualization 2002. INFOVIS 2002. (2002) pp.110\u2013116. doi:10.1109\/INFVIS.2002.1173155. 3","DOI":"10.1109\/INFVIS.2002.1173155"},{"key":"e_1_2_9_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2023.3261934"},{"key":"e_1_2_9_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2024.3456349"}],"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.70139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T10:17:42Z","timestamp":1753265862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1111\/cgf.70139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,23]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10.1111\/cgf.70139"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1111\/cgf.70139","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,23]]},"assertion":[{"value":"2025-05-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70139"}}