{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:35:44Z","timestamp":1742927744642,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031712906"},{"type":"electronic","value":"9783031712913"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71291-3_16","type":"book-chapter","created":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:02:00Z","timestamp":1725804120000},"page":"190-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["EulerMerge: Simplifying Euler Diagrams Through Set Merges"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3396-1310","authenticated-orcid":false,"given":"Xinyuan","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4100-3596","authenticated-orcid":false,"given":"Peter","family":"Rodgers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3926-4938","authenticated-orcid":false,"given":"Peter","family":"Rottmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4978-8479","authenticated-orcid":false,"given":"Daniel","family":"Archambault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8005-943X","authenticated-orcid":false,"given":"Jan-Henrik","family":"Haunert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9240-0700","authenticated-orcid":false,"given":"Bei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,9]]},"reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/TVCG.2006.120","volume":"12","author":"J Abello","year":"2006","unstructured":"Abello, J., van Ham, F., Krishnan, N.: ASK-GraphView: a large scale graph visualization system. IEEE Trans. Visual Comput. Graph. 12(5), 669\u2013676 (2006)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1111\/cgf.12722","volume":"35","author":"B Alsallakh","year":"2016","unstructured":"Alsallakh, B., Micallef, L., Aigner, W., Hauser, H., Miksch, S., Rodgers, P.: The state-of-the-art of set visualization. Comput. Graph. Forum 35(1), 234\u2013260 (2016)","journal-title":"Comput. Graph. Forum"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TVCG.2010.60","volume":"17","author":"D Archambault","year":"2010","unstructured":"Archambault, D., Munzner, T., Auber, D.: Tugging graphs faster: efficiently modifying path-preserving hierarchies for browsing paths. IEEE Trans. Visual Comput. Graphics 17(3), 276\u2013289 (2010)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"16_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-031-15146-0_13","volume-title":"Diagrams 2022","author":"D Bourou","year":"2022","unstructured":"Bourou, D., Schorlemmer, M., Plaza, E.: Euler vs Hasse diagrams for reasoning about sets: a cognitive approach. In: Giardino, V., Linker, S., Burns, R., Bellucci, F., Boucheix, J.M., Viana, P. (eds.) Diagrams 2022. LNCS, vol. 13462, pp. 151\u2013167. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15146-0_13"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer, J.M., Myrvold, W.J.: On the cutting edge: simplified $${O}(n)$$ planarity by edge addition. J. Graph Algorithms Appl. 8, 241\u2013273 (2004)","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1109\/TVCG.2009.122","volume":"15","author":"C Collins","year":"2009","unstructured":"Collins, C., Penn, G., Carpendale, S.: Bubble sets: revealing set relations with isocontours over existing visualizations. IEEE Trans. Visual Comput. Graphics 15(6), 1009\u20131016 (2009)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"doi-asserted-by":"crossref","unstructured":"Dunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 3247\u20133256 (2013)","key":"16_CR7","DOI":"10.1145\/2470654.2466444"},{"doi-asserted-by":"crossref","unstructured":"Fischer, M.T., Frings, A., Keim, D.A., Seebacher, D.: Towards a survey on static and dynamic hypergraph visualizations. In: 2021 IEEE Visualization Conference (VIS), pp. 81\u201385 (2021)","key":"16_CR8","DOI":"10.1109\/VIS49827.2021.9623305"},{"doi-asserted-by":"crossref","unstructured":"Flower, J., Howse, J.: Generating Euler diagrams. In: International Conference on Diagrammatic Representation and Inference (DIAGRAMS), pp. 61\u201375 (2002)","key":"16_CR9","DOI":"10.1007\/3-540-46037-3_6"},{"doi-asserted-by":"crossref","unstructured":"Gansner, E.R., Hu, Y., Kobourov, S.: GMap: visualizing graphs and clusters as maps. In: 2010 IEEE Pacific Visualization Symposium, pp. 201\u2013208 (2010)","key":"16_CR10","DOI":"10.1109\/PACIFICVIS.2010.5429590"},{"issue":"15","key":"16_CR11","doi-asserted-by":"publisher","first-page":"7387","DOI":"10.3390\/app12157387","volume":"12","author":"X Huang","year":"2022","unstructured":"Huang, X., Liu, X.: Incorporating a topic model into a hypergraph neural network for searching-scenario oriented recommendations. Appl. Sci. 12(15), 7387 (2022)","journal-title":"Appl. Sci."},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190110306","volume":"11","author":"DS Johnson","year":"1987","unstructured":"Johnson, D.S., Pollak, H.O.: Hypergraph planarity and the complexity of drawing Venn diagrams. J. Graph Theory 11(3), 309\u2013325 (1987)","journal-title":"J. Graph Theory"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TVCG.2021.3114834","volume":"28","author":"R Kehlbeck","year":"2022","unstructured":"Kehlbeck, R., Gortler, J., Wang, Y., Deussen, O.: SPEULER: semantics-preserving Euler diagrams. IEEE Trans. Visual Comput. Graph. 28(1), 433\u2013442 (2022)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"doi-asserted-by":"crossref","unstructured":"Kestler, H.A., et al.: VennMaster: Area-proportional Euler diagrams for functional go analysis of microarrays. BMC Bioinform. 9 (2008)","key":"16_CR14","DOI":"10.1186\/1471-2105-9-67"},{"unstructured":"Kosara, R., Jankun-Kelly, T.J., Chlan, E.: IEEE InfoVis 2007 contest: InfoVis goes to the movies. https:\/\/eagereyes.org\/blog\/2007\/infovis-contest-2007-data","key":"16_CR15"},{"doi-asserted-by":"crossref","unstructured":"Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: VoG: summarizing and understanding large graphs. In: Proceedings of the 2014 SIAM International Conference on Data Mining pp. 91\u201399 (2014)","key":"16_CR16","DOI":"10.1137\/1.9781611973440.11"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C Kuratowski","year":"1930","unstructured":"Kuratowski, C.: Sur le probleme des courbes gauches en topologie. Fundam. Math. 15(1), 271\u2013283 (1930)","journal-title":"Fundam. Math."},{"doi-asserted-by":"crossref","unstructured":"Lee, K., Jo, H., Ko, J., Lim, S., Shin, K.: SSumM: sparse summarization of massive graphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 144\u2013154 (2020)","key":"16_CR18","DOI":"10.1145\/3394486.3403057"},{"unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data","key":"16_CR19"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-030-54249-8_21","volume-title":"Diagrammatic Representation and Inference","author":"S Linker","year":"2020","unstructured":"Linker, S.: Intuitionistic Euler-Venn diagrams. In: Pietarinen, A.-V., Chapman, P., Bosveld-de Smet, L., Giardino, V., Corter, J., Linker, S. (eds.) Diagrams 2020. LNCS (LNAI), vol. 12169, pp. 264\u2013280. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54249-8_21"},{"issue":"3\u20134","key":"16_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1080\/00207169008803875","volume":"34","author":"E M\u00e4kinen","year":"1990","unstructured":"M\u00e4kinen, E.: How to draw a hypergraph. Int. J. Comput. Math. 34(3\u20134), 177\u2013185 (1990)","journal-title":"Int. J. Comput. Math."},{"issue":"6","key":"16_CR22","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1016\/j.jvlc.2014.09.002","volume":"25","author":"L Micallef","year":"2014","unstructured":"Micallef, L., Rodgers, P.: eulerForce: force-directed layout for Euler diagrams. J. Vis. Lang. Comput. 25(6), 924\u2013934 (2014)","journal-title":"J. Vis. Lang. Comput."},{"doi-asserted-by":"crossref","unstructured":"Michail, D., Kinable, J., Naveh, B., Sichi, J.V.: JGraphT\u2014a java library for graph data structures and algorithms. ACM Trans. Math. Softw. 46(2) (2020)","key":"16_CR23","DOI":"10.1145\/3381449"},{"issue":"1","key":"16_CR24","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TVCG.2023.3326599","volume":"30","author":"P Oliver","year":"2024","unstructured":"Oliver, P., Zhang, E., Zhang, Y.: Scalable hypergraph visualization. IEEE Trans. Visual Comput. Graph. 30(1), 595\u2013605 (2024)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-87730-1_6","volume-title":"Diagrammatic Representation and Inference","author":"P Rodgers","year":"2008","unstructured":"Rodgers, P., Zhang, L., Fish, A.: General Euler diagram generation. In: Stapleton, G., Howse, J., Lee, J. (eds.) Diagrams 2008. LNCS (LNAI), vol. 5223, pp. 13\u201327. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87730-1_6"},{"issue":"7","key":"16_CR26","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1109\/TVCG.2011.143","volume":"18","author":"P Rodgers","year":"2011","unstructured":"Rodgers, P., Zhang, L., Purchase, H.: Wellformedness properties in Euler diagrams: which should be used? IEEE Trans. Visual Comput. Graph. 18(7), 1089\u20131100 (2011)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"doi-asserted-by":"crossref","unstructured":"Rottmann, P., Rodgers, P., Yan, X., Archambault, D., Wang, B., Haunert, J.H.: Generating Euler diagrams through combinatorial optimization. Comput. Graph. Forum 43(3) (2024)","key":"16_CR27","DOI":"10.1111\/cgf.15089"},{"issue":"1","key":"16_CR28","first-page":"875","volume":"29","author":"P Rottmann","year":"2023","unstructured":"Rottmann, P., Wallinger, M., Bonerath, A., Gedicke, S., N\u00f6llenburg, M., Haunert, J.H.: MosaicSets: embedding set systems into grid graphs. IEEE Trans. Visual Comput. Graph. 29(1), 875\u2013885 (2023)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"doi-asserted-by":"crossref","unstructured":"Shin, K., Ghoting, A., Kim, M., Raghavan, H.: SWeG: lossless and lossy summarization of web-scale graphs. In: WWW Conference, pp. 1679\u20131690 (2019)","key":"16_CR29","DOI":"10.1145\/3308558.3313402"},{"unstructured":"Shneiderman, B.: The eyes have it: a task by data type taxonomy for information visualizations. In: Proceedings of the IEEE Symposium on Visual Languages, pp. 336\u2013343 (1996)","key":"16_CR30"},{"issue":"1","key":"16_CR31","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1109\/TVCG.2015.2467992","volume":"22","author":"P Simonetto","year":"2016","unstructured":"Simonetto, P., Archambault, D., Scheidegger, C.: A simple approach for boundary improvement of Euler diagrams. IEEE Trans. Visual Comput. Graph. 22(1), 678\u2013687 (2016)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"doi-asserted-by":"crossref","unstructured":"Simonetto, P., Auber, D.: Visualise undrawable Euler diagrams. In: 12th International Conference Information Visualisation, pp. 594\u2013599 (2008)","key":"16_CR32","DOI":"10.1109\/IV.2008.78"},{"issue":"3","key":"16_CR33","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jvlc.2012.02.001","volume":"23","author":"G Stapleton","year":"2012","unstructured":"Stapleton, G., Flower, J., Rodgers, P., Howse, J.: Automatically drawing Euler diagrams with circles. J. Vis. Lang. Comput. 23(3), 163\u2013193 (2012)","journal-title":"J. Vis. Lang. Comput."},{"issue":"1","key":"16_CR34","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/TVCG.2010.28","volume":"17","author":"G Stapleton","year":"2011","unstructured":"Stapleton, G., Rodgers, P., Howse, J., Zhang, L.: Inductively generating Euler diagrams. IEEE Trans. Visual Comput. Graphics 17(1), 88\u2013100 (2011)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"issue":"2","key":"16_CR35","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TVCG.2011.56","volume":"18","author":"L Wilkinson","year":"2012","unstructured":"Wilkinson, L.: Exact and approximate area-proportional circular Venn and Euler diagrams. IEEE Trans. Visual Comput. Graphics 18(2), 321\u2013331 (2012)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"doi-asserted-by":"crossref","unstructured":"Zhou, W., Nakhleh, L.: Properties of metabolic graphs: biological organization or representation artifacts? BMC Bioinform. 12(132) (2011)","key":"16_CR36","DOI":"10.1186\/1471-2105-12-132"},{"issue":"7","key":"16_CR37","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1109\/TVCG.2022.3153895","volume":"29","author":"Y Zhou","year":"2023","unstructured":"Zhou, Y., Rathore, A., Purvine, E., Wang, B.: Topological simplifications of hypergraphs. IEEE Trans. Vis. Comput. Graph. (TVCG) 29(7), 3209\u20133225 (2023)","journal-title":"IEEE Trans. Vis. Comput. Graph. (TVCG)"}],"container-title":["Lecture Notes in Computer Science","Diagrammatic Representation and Inference"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71291-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T13:04:13Z","timestamp":1731071053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71291-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031712906","9783031712913"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71291-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"9 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Diagrams","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Application of Diagrams","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"M\u00fcnster","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"diagrams2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/diagrams-2024.diagrams-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}