{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:38:24Z","timestamp":1763811504703,"version":"3.37.3"},"reference-count":86,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Italian Ministry for Universities and Research (MUR) Research Projects of National Relevance (PRIN)\u2014\u201cEXPAND: scalable algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data\u201d","award":["2022TS4Y3N"],"award-info":[{"award-number":["2022TS4Y3N"]}]},{"name":"Department of Engineering, University of Perugia, Ricerca di Base, \u201cModelli, algoritmi e sistemi per la visualizzazione e l\u2019analisi di grafi e reti\u201d","award":["RICBA22CB"],"award-info":[{"award-number":["RICBA22CB"]}]},{"name":"Summer Workshop on Graph Drawing (SWGD) 2022"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3401078","type":"journal-article","created":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T17:35:30Z","timestamp":1715708130000},"page":"68828-68846","source":"Crossref","is-referenced-by-count":1,"title":["Graphs Drawn With Some Vertices per Face: Density and Relationships"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9110","authenticated-orcid":false,"given":"Carla","family":"Binucci","sequence":"first","affiliation":[{"name":"Department of Engineering, University of Perugia, Perugia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4224-1550","authenticated-orcid":false,"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[{"name":"Department of Civil, Computer Science and Aeronautical Technologies Engineering, University “Roma Tre”, Roma, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[{"name":"Department of Engineering, University of Perugia, Perugia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7250-0600","authenticated-orcid":false,"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[{"name":"School of Computer Science and Electrical Engineering, University of Ottawa, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1698-3868","authenticated-orcid":false,"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[{"name":"School of Computer Science, The University of Sydney, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-3538","authenticated-orcid":false,"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[{"name":"Wilhelm-Schickard Institut für Informatik, University of Tübingen, Tübingen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[{"name":"Department of Engineering, University of Perugia, Perugia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0471-4118","authenticated-orcid":false,"given":"Pat","family":"Morin","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[{"name":"Department of Engineering, University of Perugia, Perugia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/978-3-031-43380-1_7"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1201\/b15385","volume-title":"Handbook on Graph Drawing and Visualization","author":"Tamassia","year":"2013"},{"volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","year":"1999","author":"Di Battista","key":"ref3"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs: Methods and Models","volume":"2025","author":"Kaufmann","year":"2001"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/978-3-319-91908-9_6"},{"key":"ref6","first-page":"27","article-title":"In-browser visualization of large-scale graphs","volume-title":"Proc. 1st Italian Conf. Big Data Data Sci.","volume":"3340","author":"Consalvi"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/9780470073049.ch3","volume-title":"Graph Visualization and Data Mining","author":"Didimo","year":"2006"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/access.2020.2967974"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1111\/j.1467-8659.2011.01898.x"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/tvcg.2022.3222186"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1111\/cgf.14733"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/aike48582.2020.00034"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/tvcg.2017.2743858"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1201\/9781420035315.ch10"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/access.2020.3047616"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/3301281"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/978-981-15-6533-5_1"},{"issue":"11","key":"ref18","first-page":"35","article-title":"Beyond-planar graphs: Algorithmics and combinatorics (Dagstuhl seminar 16452)","volume-title":"Dagstuhl Rep.","volume":"6","author":"Hong","year":"2016"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.cosrev.2017.06.002"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/BF01215922"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/s00454-009-9143-9"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/j.jcta.2006.08.002"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/BF02187731"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/BF02574361"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1016\/j.comgeo.2015.06.001"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1016\/j.comgeo.2015.06.001"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/978-3-031-49272-3_3"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1007\/978-3-031-49272-3_3"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/978-3-662-45803-7_17"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1007\/s00453-016-0200-5"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1007\/978-3-319-27261-0_24"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.7155\/jgaa.00398"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1016\/j.tcs.2015.04.020"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/978-3-662-45803-7_16"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.37236\/10521"},{"key":"ref36","first-page":"646","article-title":"1-gap planarity of complete bipartite graphs","volume-title":"Graph Drawing and Network Visualization","volume":"11282","author":"Bachmaier","year":"2018"},{"key":"ref37","first-page":"531","article-title":"Gap-planar graphs","volume-title":"Graph Drawing","volume":"10692","author":"Bae","year":"2017"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1016\/j.tcs.2018.05.029"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1007\/978-981-15-6533-5_9"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1016\/j.tcs.2011.05.025"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/978-3-642-18469-7_1"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1007\/978-3-642-11805-0_4"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1007\/s00224-010-9275-6"},{"issue":"4","key":"ref44","article-title":"Notes on large angle crossing graphs","volume":"2011","author":"Dujmovic","year":"2011","journal-title":"Chicago J. Theor. Comput. Sci."},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1016\/j.jvlc.2014.03.001"},{"key":"ref46","first-page":"2","article-title":"Graphs","volume":"3","author":"Avital","year":"1966","journal-title":"Gilyonot Lematematika"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1201\/b16132-57"},{"volume-title":"Extremal Problems in Combinatorial Geometry","year":"1979","author":"Kupitz","key":"ref48"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1007\/s00453-016-0226-8"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1016\/j.tcs.2016.04.026"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1007\/s00453-014-9890-8"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1007\/3-540-62495-3_59"},{"doi-asserted-by":"publisher","key":"ref53","DOI":"10.1016\/j.disc.2018.12.002"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1007\/s00373-018-1932-6"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1016\/j.disc.2023.113553"},{"doi-asserted-by":"publisher","key":"ref56","DOI":"10.1016\/j.disc.2009.07.016"},{"doi-asserted-by":"publisher","key":"ref57","DOI":"10.1016\/j.disc.2017.01.022"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1016\/j.jctb.2019.08.006"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.1016\/j.disc.2012.08.019"},{"issue":"3","key":"ref60","first-page":"401","article-title":"Plane graphs with large faces and small diameter","volume":"80","author":"Du Preez","year":"2021","journal-title":"Australas. J. Combinatorics"},{"doi-asserted-by":"publisher","key":"ref61","DOI":"10.37236\/8255"},{"doi-asserted-by":"publisher","key":"ref62","DOI":"10.1016\/S0925-7721(03)00027-0"},{"doi-asserted-by":"publisher","key":"ref63","DOI":"10.1016\/j.ipl.2013.01.013"},{"doi-asserted-by":"publisher","key":"ref64","DOI":"10.1007\/978-3-319-03841-4_7"},{"key":"ref65","article-title":"The density formula: One lemma to bound them all","author":"Kaufmann","year":"2023","journal-title":"arXiv:2311.06193"},{"doi-asserted-by":"publisher","key":"ref66","DOI":"10.1007\/s00454-006-1264-9"},{"doi-asserted-by":"publisher","key":"ref67","DOI":"10.1016\/j.comgeo.2019.101574"},{"doi-asserted-by":"publisher","key":"ref68","DOI":"10.1016\/j.dam.2012.11.019"},{"doi-asserted-by":"publisher","key":"ref69","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"ref70","first-page":"229","article-title":"On straight-line representation of planar graphs","volume":"11","author":"F\u00e1ry","year":"1948","journal-title":"Acta Sci. Math."},{"doi-asserted-by":"publisher","key":"ref71","DOI":"10.1007\/978-3-319-21840-3_25"},{"doi-asserted-by":"publisher","key":"ref72","DOI":"10.1007\/978-3-642-32241-9_29"},{"doi-asserted-by":"publisher","key":"ref73","DOI":"10.1016\/j.tcs.2021.09.015"},{"doi-asserted-by":"publisher","key":"ref74","DOI":"10.1002\/jgt.3190120306"},{"doi-asserted-by":"publisher","key":"ref75","DOI":"10.1007\/978-981-15-6533-5_4"},{"key":"ref76","first-page":"1","article-title":"On optimal 2- and 3-planar graphs","volume-title":"Proc. SoCG","volume":"77","author":"Bekos"},{"doi-asserted-by":"publisher","key":"ref77","DOI":"10.1007\/s00453-015-0002-1"},{"doi-asserted-by":"publisher","key":"ref78","DOI":"10.4064\/fm-41-1-137-145"},{"doi-asserted-by":"publisher","key":"ref79","DOI":"10.1016\/S0021-9800(70)80087-4"},{"doi-asserted-by":"publisher","key":"ref80","DOI":"10.1002\/jgt.3190170602"},{"doi-asserted-by":"publisher","key":"ref81","DOI":"10.1016\/j.dam.2018.08.018"},{"doi-asserted-by":"publisher","key":"ref82","DOI":"10.7155\/jgaa.00457"},{"doi-asserted-by":"publisher","key":"ref83","DOI":"10.1007\/978-3-319-13075-0_50"},{"doi-asserted-by":"publisher","key":"ref84","DOI":"10.1016\/j.dam.2014.05.025"},{"doi-asserted-by":"publisher","key":"ref85","DOI":"10.1007\/978-3-031-49272-3_17"},{"doi-asserted-by":"publisher","key":"ref86","DOI":"10.1109\/iisa.2016.7785427"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10530241.pdf?arnumber=10530241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T04:26:55Z","timestamp":1716265615000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10530241\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":86,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3401078","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}