{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T20:10:01Z","timestamp":1776111001042,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024,1]]},"DOI":"10.1109\/tvcg.2023.3326599","type":"journal-article","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:05:45Z","timestamp":1698084345000},"page":"595-605","source":"Crossref","is-referenced-by-count":8,"title":["Scalable Hypergraph Visualization"],"prefix":"10.1109","volume":"30","author":[{"given":"Peter","family":"Oliver","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Oregon State University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4752-3119","authenticated-orcid":false,"given":"Eugene","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Oregon State University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8467-2781","authenticated-orcid":false,"given":"Yue","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Oregon State University, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1057\/9781137515209.0008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/apcas.1996.569275"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2013.184"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12722"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64471-4_31"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237827"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/s0924-6509(09)x7013-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/0022250x.2001.9990249"},{"key":"ref9","article-title":"A unifying framework for spectrum-preserving graph sparsification and coarsening","author":"Bravo-Hermsdorff","year":"2019","journal-title":"arXiv preprint arXiv"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0"},{"key":"ref11","volume-title":"A heuristic for reducing fill-in in sparse matrix factorization","author":"Bui","year":"1993"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/18m1163865"},{"key":"ref13","first-page":"53:1","article-title":"Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries","volume-title":"48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)","author":"Chen"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/43.103500"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/157485.165119"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ipdps.2006.1639359"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2012.252"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67731-2_26"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/iccad.1990.129970"},{"key":"ref20","volume-title":"Gp3 eye-tracker","year":"2021"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/iccad.1991.185177"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/iccad.1992.279334"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/43.644609"},{"key":"ref24","first-page":"28","article-title":"A multi-level algorithm for partitioning graphs","volume-title":"SC Conference","author":"Hendrickson"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2020.02.004"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2016.2615308"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2020.3030475"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137650"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/focs52979.2021.00114"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/s1064827595287997"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.intcom.2007.05.004"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688093"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.4064\/fm-15-1-271-283"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2014.2346248"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45735-6_1"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/bf01589116"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746555"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0101717"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3139295.3139314"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2021.3114759"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2010.210"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87730-1_6"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/100791142"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2014.2346249"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.e93.d.1957"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2015.2467992"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01452.x"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.159"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/08074489x"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvlc.2012.02.001"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/vast.2007.4389006"},{"key":"ref53","article-title":"Plane representations of graphs","author":"Thomassen","year":"1984","journal-title":"Progress in graph theory"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.11.002"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2019.2933196"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14030"},{"issue":"6","key":"ref57","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1070\/RM1974v029n06ABEH001303","article-title":"Hypergraphs","volume":"29","author":"Zykov","year":"1974","journal-title":"Russian Mathematical Surveys"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/10373160\/10290912.pdf?arnumber=10290912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T19:04:16Z","timestamp":1707764656000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10290912\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":57,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2023.3326599","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":[[2024,1]]}}}