{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:02:25Z","timestamp":1751688145311,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T00:00:00Z","timestamp":1745539200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","award":["10.47379\/ICT19035"],"award-info":[{"award-number":["10.47379\/ICT19035"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,26]]},"DOI":"10.1145\/3706598.3713444","type":"proceedings-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T03:20:47Z","timestamp":1745464847000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["How Do People Perceive Bundling? An Experiment"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2191-4413","authenticated-orcid":false,"given":"Markus","family":"Wallinger","sequence":"first","affiliation":[{"name":"Chair for Efficient Algorithms, Technical University of Munich, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3949-2845","authenticated-orcid":false,"given":"Osman","family":"Akbulut","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Faculty of Engineering, Duzce University, Duzce, Turkiye"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5116-6818","authenticated-orcid":false,"given":"Kabir Ahmed","family":"Rufai","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University, Melborne, Victoria, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6994-4446","authenticated-orcid":false,"given":"Helen C.","family":"Purchase","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University, Melbourne, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4978-8479","authenticated-orcid":false,"given":"Daniel","family":"Archambault","sequence":"additional","affiliation":[{"name":"Newcastle University, Newcastle, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"unstructured":"Alexandru Telea. 2016. CUBu - Implementation. https:\/\/webspace.science.uu.nl\/\u00a0telea001\/InfoVis\/CUBu. [Online; accessed 6 Dec. 2024].","key":"e_1_3_3_3_2_2"},{"doi-asserted-by":"publisher","unstructured":"Clio Andris Daniel DellaPosta Brittany\u00a0N. Freelin Xi Zhu Bradley Hinger and Hanzhou Chen. 2021. To racketeer among neighbors: spatial features of criminal collaboration in the American Mafia. International Journal of Geographical Information Science 35 12 (2021) 2463\u20132488. 10.1080\/13658816.2021.1884869","key":"e_1_3_3_3_3_2","DOI":"10.1080\/13658816.2021.1884869"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_4_2","DOI":"10.4230\/LIPICS.GD.2024.15"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_5_2","DOI":"10.1007\/978-1-4939-7131-2_315"},{"doi-asserted-by":"publisher","unstructured":"Benjamin Bach Pierre Dragicevic Daniel Archambault Christophe Hurter and Sheelagh Carpendale. 2017. A Descriptive Framework for Temporal Data Visualizations Based on Generalized Space-Time Cubes. Comput. Graph. Forum 36 6 (2017) 36\u201361. 10.1111\/CGF.12804","key":"e_1_3_3_3_6_2","DOI":"10.1111\/CGF.12804"},{"doi-asserted-by":"publisher","unstructured":"Benjamin Bach Nathalie\u00a0Henry Riche Christophe Hurter Kim Marriott and Tim Dwyer. 2017. Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization. IEEE Trans. Vis. Comput. Graph. 23 1 (2017) 541\u2013550. 10.1109\/TVCG.2016.2598958","key":"e_1_3_3_3_7_2","DOI":"10.1109\/TVCG.2016.2598958"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_8_2","DOI":"10.21437\/INTERSPEECH.2023-78"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_9_2","DOI":"10.1109\/PACIFICVIS.2015.7156356"},{"doi-asserted-by":"publisher","unstructured":"Michael Burch Weidong Huang Mathew Wakefield Helen\u00a0C. Purchase Daniel Weiskopf and Jie Hua. 2021. The State of the Art in Empirical User Evaluation of Graph Visualizations. IEEE Access 9 (2021) 4173\u20134198. 10.1109\/ACCESS.2020.3047616","key":"e_1_3_3_3_10_2","DOI":"10.1109\/ACCESS.2020.3047616"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_11_2","DOI":"10.1145\/2020408.2020579"},{"doi-asserted-by":"publisher","unstructured":"Weiwei Cui Hong Zhou Huamin Qu Pak\u00a0Chung Wong and Xiaoming Li. 2008. Geometry-Based Edge Clustering for Graph Visualization. IEEE Trans. Vis. Comput. Graph. 14 6 (2008) 1277\u20131284. 10.1109\/TVCG.2008.135","key":"e_1_3_3_3_12_2","DOI":"10.1109\/TVCG.2008.135"},{"key":"e_1_3_3_3_13_2","series-title":"CEUR Workshop Proceedings","first-page":"45","volume-title":"Proceedings of the Third International Workshop on Visualization and Interaction for Ontologies and Linked Data co-located with the 16th International Semantic Web Conference (ISWC 2017), Vienna, Austria, October 22, 2017","volume":"1947","author":"Dang Tommy","year":"2017","unstructured":"Tommy Dang, Paul Murray, Ronak Etemadpour, and Angus\u00a0Graeme Forbes. 2017. A User Study of Techniques for Visualizing Structure and Connectivity in Hierarchical Datasets. In Proceedings of the Third International Workshop on Visualization and Interaction for Ontologies and Linked Data co-located with the 16th International Semantic Web Conference (ISWC 2017), Vienna, Austria, October 22, 2017(CEUR Workshop Proceedings, Vol.\u00a01947). CEUR-WS.org, 45\u201359."},{"doi-asserted-by":"publisher","unstructured":"Matthew Dickerson David Eppstein Michael\u00a0T. Goodrich and Jeremy\u00a0Y. Meng. 2005. Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms and Applications 9 1 (2005) 31\u201352. 10.7155\/jgaa.00099","key":"e_1_3_3_3_14_2","DOI":"10.7155\/jgaa.00099"},{"doi-asserted-by":"publisher","unstructured":"David Eppstein Danny Holten Maarten L\u00f6ffler Martin N\u00f6llenburg Bettina Speckmann and Kevin Verbeek. 2016. Strict Confluent Drawing. J. Computational Geometry 7 1 (2016) 22\u201346. 10.20382\/jocg.v7i1a2","key":"e_1_3_3_3_15_2","DOI":"10.20382\/jocg.v7i1a2"},{"doi-asserted-by":"publisher","unstructured":"Velitchko\u00a0Andreev Filipov Alessio Arleo and Silvia Miksch. 2023. Are We There Yet? A Roadmap of Network Visualization from Surveys to Task Taxonomies. Comput. Graph. Forum 42 6 (2023) e14794. 10.1111\/CGF.14794","key":"e_1_3_3_3_16_2","DOI":"10.1111\/CGF.14794"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_17_2","DOI":"10.1109\/PACIFICVIS.2011.5742389"},{"doi-asserted-by":"publisher","unstructured":"Danny Holten. 2006. Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data. IEEE Trans. Vis. Comput. Graph. 12 5 (2006) 741\u2013748. 10.1109\/TVCG.2006.147","key":"e_1_3_3_3_18_2","DOI":"10.1109\/TVCG.2006.147"},{"doi-asserted-by":"publisher","unstructured":"Danny Holten and Jarke\u00a0J. van Wijk. 2009. Force-Directed Edge Bundling for Graph Visualization. Comput. Graph. Forum 28 3 (2009) 983\u2013990. 10.1111\/J.1467-8659.2009.01450.X","key":"e_1_3_3_3_19_2","DOI":"10.1111\/J.1467-8659.2009.01450.X"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_20_2","DOI":"10.1109\/PACIFICVIS.2016.7465270"},{"doi-asserted-by":"publisher","unstructured":"Christophe Hurter Ozan Ersoy and Alexandru\u00a0C. Telea. 2012. Graph Bundling by Kernel Density Estimation. Comput. Graph. Forum 31 3pt1 (2012) 865\u2013874. 10.1111\/J.1467-8659.2012.03079.X","key":"e_1_3_3_3_21_2","DOI":"10.1111\/J.1467-8659.2012.03079.X"},{"doi-asserted-by":"publisher","unstructured":"Antoine Lambert Romain Bourqui and David Auber. 2010. Winding Roads: Routing edges into bundles. Comput. Graph. Forum 29 3 (2010) 853\u2013862. 10.1111\/J.1467-8659.2009.01700.X","key":"e_1_3_3_3_22_2","DOI":"10.1111\/J.1467-8659.2009.01700.X"},{"doi-asserted-by":"publisher","unstructured":"Antoine Lambert Jonathan Dubois and Romain Bourqui. 2011. Pathway Preserving Representation of Metabolic Networks. Comput. Graph. Forum 30 3 (2011) 1021\u20131030. 10.1111\/J.1467-8659.2011.01951.X","key":"e_1_3_3_3_23_2","DOI":"10.1111\/J.1467-8659.2011.01951.X"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_24_2","DOI":"10.1145\/2858036.2858071"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_25_2","DOI":"10.1109\/PACIFICVIS.2017.8031594"},{"doi-asserted-by":"publisher","unstructured":"Antoine Lhuillier Christophe Hurter and Alexandru\u00a0C. Telea. 2017. State of the Art in Edge and Trail Bundling Techniques. Comput. Graph. Forum 36 3 (2017) 619\u2013645. 10.1111\/CGF.13213","key":"e_1_3_3_3_26_2","DOI":"10.1111\/CGF.13213"},{"doi-asserted-by":"publisher","unstructured":"Sheng-Jie Luo Chun-Liang Liu Bing-Yu Chen and Kwan-Liu Ma. 2012. Ambiguity-Free Edge-Bundling for Interactive Graph Visualization. IEEE Trans. Vis. Comput. Graph. 18 5 (2012) 810\u2013821. 10.1109\/TVCG.2011.104","key":"e_1_3_3_3_27_2","DOI":"10.1109\/TVCG.2011.104"},{"unstructured":"Moira Maguire and Brid Delahunt. 2017. Doing a thematic analysis: A practical step-by-step guide for learning and teaching scholars. All Ireland journal of higher education 9 3 (2017) 335:1\u201314.","key":"e_1_3_3_3_28_2"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_29_2","DOI":"10.1145\/2254556.2254670"},{"doi-asserted-by":"publisher","unstructured":"Fintan McGee Mohammad Ghoniem Guy Melan\u00e7on Beno\u00eet Otjacques and Bruno Pinaud. 2019. The State of the Art in Multilayer Network Visualization. Comput. Graph. Forum 38 6 (2019) 125\u2013149. 10.1111\/CGF.13610","key":"e_1_3_3_3_30_2","DOI":"10.1111\/CGF.13610"},{"doi-asserted-by":"publisher","unstructured":"Lev Nachmanson Arlind Nocaj Sergey Bereg Leishi Zhang and Alexander\u00a0E. Holroyd. 2017. Node Overlap Removal by Growing a Tree. J. Graph Algorithms Appl. 21 5 (2017) 857\u2013872. 10.7155\/JGAA.00442","key":"e_1_3_3_3_31_2","DOI":"10.7155\/JGAA.00442"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_32_2","DOI":"10.1145\/2494188.2494201"},{"doi-asserted-by":"publisher","unstructured":"Carolina Nobre Miriah\u00a0D. Meyer Marc Streit and Alexander Lex. 2019. The State of the Art in Visualizing Multivariate Networks. Comput. Graph. Forum 38 3 (2019) 807\u2013832. 10.1111\/CGF.13728","key":"e_1_3_3_3_33_2","DOI":"10.1111\/CGF.13728"},{"key":"e_1_3_3_3_34_2","volume-title":"Mafia: The Government\u2019s Secret File on Organized Crime","author":"Narcotics United States Treasury Department\u00a0Bureau of","year":"2007","unstructured":"United States Treasury Department\u00a0Bureau of Narcotics. 2007. Mafia: The Government\u2019s Secret File on Organized Crime. Harper Collins."},{"doi-asserted-by":"publisher","unstructured":"Sergey Pupyrev Lev Nachmanson Sergey Bereg and Alexander\u00a0E. Holroyd. 2016. Edge routing with ordered bundles. Computational Geometry 52 (2016) 18\u201333. 10.1016\/j.comgeo.2015.10.005","key":"e_1_3_3_3_35_2","DOI":"10.1016\/j.comgeo.2015.10.005"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_36_2","DOI":"10.1007\/978-3-319-03841-4_21"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_37_2","DOI":"10.1007\/978-3-030-68766-3_36"},{"doi-asserted-by":"publisher","unstructured":"Helen\u00a0C. Purchase Christopher Pilcher and Beryl Plimmer. 2012. Graph Drawing Aesthetics - Created by Users Not Algorithms. IEEE Trans. Vis. Comput. Graph. 18 1 (2012) 81\u201392. 10.1109\/TVCG.2010.269","key":"e_1_3_3_3_38_2","DOI":"10.1109\/TVCG.2010.269"},{"doi-asserted-by":"publisher","unstructured":"Dennie Reniers Lucian Voinea Ozan Ersoy and Alexandru Telea. 2014. The Solid* toolset for software visual analytics of program structure and metrics comprehension: From research prototype to product. Science of Computer Programming 79 (2014) 224\u2013240. 10.1016\/j.scico.2012.05.002","key":"e_1_3_3_3_39_2","DOI":"10.1016\/j.scico.2012.05.002"},{"doi-asserted-by":"publisher","unstructured":"David Selassie Brandon Heller and Jeffrey Heer. 2011. Divided Edge Bundling for Directional Network Data. IEEE Trans. Vis. Comput. Graph. 17 12 (2011) 2354\u20132363. 10.1109\/TVCG.2011.190","key":"e_1_3_3_3_40_2","DOI":"10.1109\/TVCG.2011.190"},{"unstructured":"Corneliu Sugar and Amgad Naiem. 2013. d3.ForceBundle - Github. https:\/\/github.com\/upphiminn\/d3.ForceBundle. [Online; accessed 5. Dec. 2024].","key":"e_1_3_3_3_41_2"},{"doi-asserted-by":"publisher","unstructured":"Maoyuan Sun Jian Zhao Hao Wu Kurt Luther Chris North and Naren Ramakrishnan. 2019. The Effect of Edge Bundling and Seriation on Sensemaking of Biclusters in Bipartite Graphs. IEEE Trans. Vis. Comput. Graph. 25 10 (2019) 2983\u20132998. 10.1109\/TVCG.2018.2861397","key":"e_1_3_3_3_42_2","DOI":"10.1109\/TVCG.2018.2861397"},{"key":"e_1_3_3_3_43_2","series-title":"Dagstuhl Seminar Proceedings","first-page":"1","volume-title":"Visualization and Monitoring of Network Traffic, 17.05. - 20.05.2009","volume":"09211","author":"Telea Alexandru\u00a0C.","year":"2009","unstructured":"Alexandru\u00a0C. Telea, Ozan Ersoy, Hessel Hoogendorp, and Dennie Reniers. 2009. Comparison of Node-Link and Hierarchical Edge Bundling Layouts: A User Study. In Visualization and Monitoring of Network Traffic, 17.05. - 20.05.2009(Dagstuhl Seminar Proceedings, Vol.\u00a009211). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany, 1\u201312."},{"doi-asserted-by":"publisher","unstructured":"Naoko Toeda Rina Nakazawa Takayuki Itoh Takafumi Saito and Daniel Archambault. 2017. Convergent drawing for mutually connected directed graphs. J. Visual Languages & Computing 43 (2017) 83\u201390. 10.1016\/j.jvlc.2017.09.004","key":"e_1_3_3_3_44_2","DOI":"10.1016\/j.jvlc.2017.09.004"},{"doi-asserted-by":"publisher","unstructured":"Matthew van\u00a0der Zwan Valeriu Codreanu and Alexandru\u00a0C. Telea. 2016. CUBu: Universal Real-Time Bundling for Large Graphs. IEEE Trans. Vis. Comput. Graph. 22 12 (2016) 2550\u20132563. 10.1109\/TVCG.2016.2515611","key":"e_1_3_3_3_45_2","DOI":"10.1109\/TVCG.2016.2515611"},{"doi-asserted-by":"publisher","unstructured":"Frank van Ham and Bernice Rogowitz. 2008. Perceptual Organization in User-Generated Graph Layouts. IEEE Transactions on Visualization and Computer Graphics 14 6 (2008) 1333\u20131339. 10.1109\/TVCG.2008.155","key":"e_1_3_3_3_46_2","DOI":"10.1109\/TVCG.2008.155"},{"doi-asserted-by":"publisher","unstructured":"Tatiana von Landesberger Arjan Kuijper Tobias Schreck J\u00f6rn Kohlhammer Jarke\u00a0J. van Wijk Jean-Daniel Fekete and Dieter\u00a0W. Fellner. 2011. Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges. Comput. Graph. Forum 30 6 (2011) 1719\u20131749. 10.1111\/J.1467-8659.2011.01898.X","key":"e_1_3_3_3_47_2","DOI":"10.1111\/J.1467-8659.2011.01898.X"},{"doi-asserted-by":"publisher","unstructured":"Markus Wallinger Daniel Archambault David Auber Martin N\u00f6llenburg and Jaakko Peltonen. 2022. Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach. IEEE Trans. Vis. Comput. Graph. 28 1 (2022) 313\u2013323. 10.1109\/TVCG.2021.3114795","key":"e_1_3_3_3_48_2","DOI":"10.1109\/TVCG.2021.3114795"},{"doi-asserted-by":"publisher","unstructured":"Markus Wallinger Daniel Archambault David Auber Martin N\u00f6llenburg and Jaakko Peltonen. 2023. Faster Edge-Path Bundling through Graph Spanners. Comput. Graph. Forum 42 6 (2023) e14789. 10.1111\/CGF.14789","key":"e_1_3_3_3_49_2","DOI":"10.1111\/CGF.14789"},{"doi-asserted-by":"publisher","unstructured":"Kai Xu Chris Rooney Peter\u00a0J. Passmore Dong-Han Ham and Phong\u00a0Hai Nguyen. 2012. A User Study on Curved Edges in Graph Visualization. IEEE Trans. Vis. Comput. Graph. 18 12 (2012) 2449\u20132456. 10.1109\/TVCG.2012.189","key":"e_1_3_3_3_50_2","DOI":"10.1109\/TVCG.2012.189"},{"doi-asserted-by":"publisher","unstructured":"Xinyue Ye and Clio Andris. 2021. Spatial social networks in geographic information science. Int. J. Geogr. Inf. Sci. 35 12 (2021) 2375\u20132379. 10.1080\/13658816.2021.2001722","key":"e_1_3_3_3_51_2","DOI":"10.1080\/13658816.2021.2001722"},{"doi-asserted-by":"publisher","unstructured":"Vahan Yoghourdjian Daniel Archambault Stephan Diehl Tim Dwyer Karsten Klein Helen\u00a0C. Purchase and Hsiang-Yun Wu. 2018. Exploring the limits of complexity: A survey of empirical studies on graph visualisation. Vis. Informatics 2 4 (2018) 264\u2013282. 10.1016\/J.VISINF.2018.12.006","key":"e_1_3_3_3_52_2","DOI":"10.1016\/J.VISINF.2018.12.006"},{"doi-asserted-by":"publisher","unstructured":"Jonathan\u00a0X. Zheng Samraat Pawar and Dan F.\u00a0M. Goodman. 2021. Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization. IEEE Trans. Vis. Comput. Graph. 27 3 (2021) 2244\u20132249. 10.1109\/TVCG.2019.2944619","key":"e_1_3_3_3_53_2","DOI":"10.1109\/TVCG.2019.2944619"}],"event":{"sponsor":["SIGCHI ACM Special Interest Group on Computer-Human Interaction"],"acronym":"CHI '25","name":"CHI 2025: CHI Conference on Human Factors in Computing Systems","location":"Yokohama Japan"},"container-title":["Proceedings of the 2025 CHI Conference on Human Factors in Computing Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3706598.3713444","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3706598.3713444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:52:09Z","timestamp":1751604729000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3706598.3713444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,25]]},"references-count":52,"alternative-id":["10.1145\/3706598.3713444","10.1145\/3706598"],"URL":"https:\/\/doi.org\/10.1145\/3706598.3713444","relation":{},"subject":[],"published":{"date-parts":[[2025,4,25]]},"assertion":[{"value":"2025-04-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}