{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:08:10Z","timestamp":1743073690658,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492747"},{"type":"electronic","value":"9783031492754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49275-4_11","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"153-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Hive Plots: A Combinatorial Framework"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2191-4413","authenticated-orcid":false,"given":"Markus","family":"Wallinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-11440-3_7","volume-title":"WALCOM: Algorithms and Computation","author":"C Bachmaier","year":"2010","unstructured":"Bachmaier, C., Brandenburg, F.J., Brunner, W., H\u00fcbner, F.: A global k-level crossing reduction algorithm. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 70\u201381. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11440-3_7"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-00219-9_34","volume-title":"Graph Drawing","author":"C Bachmaier","year":"2009","unstructured":"Bachmaier, C., Brandenburg, F.J., Brunner, W., Lov\u00e1sz, G.: Cyclic leveling of directed graphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 348\u2013359. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_34"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-77537-9_8","volume-title":"Graph Drawing","author":"C Bachmaier","year":"2008","unstructured":"Bachmaier, C., Brunner, W., K\u00f6nig, C.: Cyclic level planarity testing and embedding. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 50\u201361. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77537-9_8"},{"issue":"10","key":"11_CR4","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008). https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"11_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004). https:\/\/doi.org\/10.1103\/PhysRevE.70.066111","journal-title":"Phys. Rev. E"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"5444","DOI":"10.1038\/s41467-020-19160-7","volume":"11","author":"F Crameri","year":"2020","unstructured":"Crameri, F., Shephard, G.E., Heron, P.J.: The misuse of colour in science communication. Nat. Commun. 11(1), 5444 (2020). https:\/\/doi.org\/10.1038\/s41467-020-19160-7","journal-title":"Nat. Commun."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-319-73915-1_44","volume-title":"Graph Drawing and Network Visualization","author":"W Devanny","year":"2018","unstructured":"Devanny, W., Kindermann, P., L\u00f6ffler, M., Rutter, I.: Graph drawing contest report. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 575\u2013582. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_44"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P Eades","year":"1994","unstructured":"Eades, P., Whitesides, S.: Drawing graphs in two layers. Theoret. Comput. Sci. 131(2), 361\u2013374 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90179-1","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379\u2013403 (1994). https:\/\/doi.org\/10.1007\/BF01187020","journal-title":"Algorithmica"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-31843-9_22","volume-title":"Graph Drawing","author":"M Forster","year":"2005","unstructured":"Forster, M.: A fast and simple heuristic for constrained two-level crossing reduction. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 206\u2013216. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_22"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010). https:\/\/doi.org\/10.1016\/j.physrep.2009.11.002","journal-title":"Phys. Rep."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-24749-4_35","volume-title":"STACS 2004","author":"MK Ganapathy","year":"2004","unstructured":"Ganapathy, M.K., Lodha, S.P.: On minimum circular arrangement. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 394\u2013405. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_35"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"ER Gansner","year":"2007","unstructured":"Gansner, E.R., Koren, Y.: Improved circular layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 386\u2013398. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_37"},{"issue":"6","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"MS Granovetter","year":"1973","unstructured":"Granovetter, M.S.: The strength of weak ties. Am. J. Sociol. 78(6), 1360\u20131380 (1973). https:\/\/doi.org\/10.1086\/225469","journal-title":"Am. J. Sociol."},{"doi-asserted-by":"publisher","unstructured":"Guarino, M., Rivas, P., DeCusatis, C.: Towards adversarially robust DDoS-attack classification. In: 2020 11th IEEE Annual Ubiquitous Computing, Electronics Mobile Communication Conference (UEMCON), pp. 0285\u20130291 (2020). https:\/\/doi.org\/10.1109\/UEMCON51285.2020.9298167","key":"11_CR15","DOI":"10.1109\/UEMCON51285.2020.9298167"},{"issue":"5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1093\/bib\/bbr069","volume":"13","author":"M Krzywinski","year":"2012","unstructured":"Krzywinski, M., Birol, I., Jones, S.J., Marra, M.A.: Hive plots-rational approach to visualizing networks. Brief. Bioinform. 13(5), 627\u2013644 (2012). https:\/\/doi.org\/10.1093\/bib\/bbr069","journal-title":"Brief. Bioinform."},{"issue":"5","key":"11_CR17","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1162\/LEON\\_a_01278","volume":"50","author":"M Krzywinski","year":"2017","unstructured":"Krzywinski, M., Nip, K.M., Birol, I., Marra, M.: Differential hive plots: seeing networks change. Leonardo 50(5), 504 (2017). https:\/\/doi.org\/10.1162\/LEON_a_01278","journal-title":"Leonardo"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.jalgor.2003.10.003","volume":"51","author":"V Liberatore","year":"2004","unstructured":"Liberatore, V.: Circular arrangements and cyclic broadcast scheduling. J. Algorithms 51(2), 185\u2013215 (2004). https:\/\/doi.org\/10.1016\/j.jalgor.2003.10.003","journal-title":"J. Algorithms"},{"unstructured":"Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the NP-completeness of a computer network layout problem. In: Proceedings IEEE International Symposium on Circuits and Systems, pp. 292\u2013295. IEEE Computer Society Press, Los Alamitos (1987)","key":"11_CR19"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46648-7_22","volume-title":"Graph Drawing","author":"C Matuszewski","year":"1999","unstructured":"Matuszewski, C., Sch\u00f6nfeld, R., Molitor, P.: Using sifting for k-layer straightline crossing minimization. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 217\u2013224. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46648-7_22"},{"issue":"12","key":"11_CR21","doi-asserted-by":"publisher","first-page":"2506","DOI":"10.1109\/TVCG.2013.192","volume":"19","author":"C Perin","year":"2013","unstructured":"Perin, C., Vuillemot, R., Fekete, J.D.: SoccerStories: a kick-off for visual soccer analysis. IEEE Trans. Visual Comput. Graphics 19(12), 2506\u20132515 (2013). https:\/\/doi.org\/10.1109\/TVCG.2013.192","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ejca.2013.09.011","volume":"50","author":"D Pils","year":"2014","unstructured":"Pils, D., et al.: Cyclin E1 (CCNE1) as independent positive prognostic factor in advanced stage serous ovarian cancer patients \u2013 a study of the OVCAD consortium. Eur. J. Cancer 50(1), 99\u2013110 (2014). https:\/\/doi.org\/10.1016\/j.ejca.2013.09.011","journal-title":"Eur. J. Cancer"},{"doi-asserted-by":"publisher","unstructured":"Rivas, P., et al.: Machine learning for DDoS attack classification using hive plots. In: 2019 IEEE 10th Annual Ubiquitous Computing, Electronics Mobile Communication Conference (UEMCON), pp. 0401\u20130407 (2019). https:\/\/doi.org\/10.1109\/UEMCON47517.2019.8993021","key":"11_CR23","DOI":"10.1109\/UEMCON47517.2019.8993021"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981). https:\/\/doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans. Syst. Man Cybern."},{"unstructured":"Tamassia, R.: Handbook of Graph Drawing and Visualization, 1st edn. Chapman & Hall\/CRC (2016)","key":"11_CR25"},{"issue":"411","key":"11_CR26","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1080\/01621459.1990.10474926","volume":"85","author":"EJ Wegman","year":"1990","unstructured":"Wegman, E.J.: Hyperdimensional data analysis using parallel coordinates. J. Am. Stat. Assoc. 85(411), 664\u2013675 (1990)","journal-title":"J. Am. Stat. Assoc."},{"unstructured":"yWorks GmbH: yEd. https:\/\/www.yworks.com\/products\/yed","key":"11_CR27"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s12859-020-03921-8","volume":"22","author":"J Zoppi","year":"2021","unstructured":"Zoppi, J., Guillaume, J.F., Neunlist, M., Chaffron, S.: MiBiOmics: an interactive web application for multi-omics data exploration and integration. BMC Bioinform. 22(1), 6 (2021). https:\/\/doi.org\/10.1186\/s12859-020-03921-8","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49275-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:03:54Z","timestamp":1704715434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"6 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}