{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T11:20:14Z","timestamp":1785842414850,"version":"3.56.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319644707","type":"print"},{"value":"9783319644714","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64471-4_31","type":"book-chapter","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T10:37:25Z","timestamp":1501583845000},"page":"387-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Hypergraph Drawing by Force-Directed Placement"],"prefix":"10.1007","author":[{"given":"Naheed Anjum","family":"Arafat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"issue":"12","key":"31_CR1","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1109\/TVCG.2011.186","volume":"17","author":"B Alper","year":"2011","unstructured":"Alper, B., Riche, N., Ramos, G., Czerwinski, M.: Design study of linesets, a novel set visualization technique. IEEE Trans. Vis. Comput. Graph. 17(12), 2259\u20132267 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"31_CR2","unstructured":"Alsallakh, B., Micallef, L., Aigner, W., Hauser, H., Miksch, S., Rodgers, P.: Visualizing sets and set-typed data: State-of-the-art and future challenges. In: Eurographics conference on Visualization (EuroVis)-State of The Art Reports, pp. 1\u201321 (2014)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Arafat, N.A., Bressan, S.: Hypergraph drawing by force-directed placement. School of Computing, National University of Singapore, Technical report number TRC6\/17 (2017). http:\/\/www.comp.nus.edu.sg\/naheed\/files\/hypergraphdrawing.pdf","DOI":"10.1007\/978-3-319-64471-4_31"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44541-2_15","volume-title":"Graph Drawing","author":"F Bertault","year":"2001","unstructured":"Bertault, F., Eades, P.: Drawing hypergraphs in the subset standard (short demo paper). In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 164\u2013169. Springer, Heidelberg (2001). doi:10.1007\/3-540-44541-2_15"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Brinkmeier, M., Werner, J., Recknagel, S.: Communities in graphs and hypergraphs. In: Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management, pp. 869\u2013872. ACM (2007)","DOI":"10.1145\/1321440.1321563"},{"issue":"6","key":"31_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. Vis. Comput. Graph. 15(6), 1009\u20131016 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Dinkla, K., van Kreveld, M.J., Speckmann, B., Westenberg, M.A.: Kelp diagrams: point set membership visualization. In: Computer Graphics Forum, pp. 875\u2013884. Wiley Online Library (2012)","DOI":"10.1111\/j.1467-8659.2012.03080.x"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.7155\/jgaa.00122","volume":"10","author":"T Eschbach","year":"2006","unstructured":"Eschbach, T., G\u00fcnther, W., Becker, B.: Orthogonal hypergraph drawing for improved visibility. J. Graph Algorithms Appl. 10(2), 141\u2013157 (2006)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"31_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM (JACM) 30(3), 514\u2013550 (1983)","journal-title":"J. ACM (JACM)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-46037-3_6","volume-title":"Diagrammatic Representation and Inference","author":"J Flower","year":"2002","unstructured":"Flower, J., Howse, J.: Generating Euler diagrams. In: Hegarty, M., Meyer, B., Narayanan, N.H. (eds.) Diagrams 2002. LNCS (LNAI), vol. 2317, pp. 61\u201375. Springer, Heidelberg (2002). doi:10.1007\/3-540-46037-3_6"},{"issue":"11","key":"31_CR11","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TM Fruchterman","year":"1991","unstructured":"Fruchterman, T.M., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exp."},{"key":"31_CR12","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-1-4684-6381-1_9","volume-title":"Applications of Combinatorics and Graph Theory to the Biological and Social Sciences","author":"JR Lundgren","year":"1989","unstructured":"Lundgren, J.R.: Food webs, competition graphs, competition-common enemy graphs, and niche graphs. In: Roberts, F. (ed.) Applications of Combinatorics and Graph Theory to the Biological and Social Sciences. The IMA Volumes in Mathematics and its Applications, vol. 17, pp. 221\u2013243. Springer, New York (1989)"},{"issue":"3\u20134","key":"31_CR13","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":"11","key":"31_CR14","doi-asserted-by":"publisher","first-page":"1846","DOI":"10.1109\/TVCG.2013.76","volume":"19","author":"W Meulemans","year":"2013","unstructured":"Meulemans, W., Riche, N.H., Speckmann, B., Alper, B., Dwyer, T.: Kelpfusion: a hybrid set visualization technique. IEEE Trans. Vis. Comput. Graph. 19(11), 1846\u20131858 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Ramadan, E., Tarafdar, A., Pothen, A.: A hypergraph model for the yeast protein complex network. In: Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International. p. 189. IEEE (2004)","DOI":"10.1109\/IPDPS.2004.1303205"},{"issue":"7","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1587\/transinf.E93.D.1957","volume":"93","author":"R Santamar\u00eda","year":"2010","unstructured":"Santamar\u00eda, R., Ther\u00f3n, R.: Visualization of intersecting groups based on hypergraphs. IEICE Trans. Inf. Syst. 93(7), 1957\u20131964 (2010)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets. In: Computer Graphics Forum, pp. 967\u2013974. Wiley Online Library (2009)","DOI":"10.1111\/j.1467-8659.2009.01452.x"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-25931-2_13","volume-title":"Diagrammatic Representation and Inference","author":"A Verroust","year":"2004","unstructured":"Verroust, A., Viaud, M.-L.: Ensuring the drawability of extended Euler diagrams for up to 8 sets. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds.) Diagrams 2004. LNCS (LNAI), vol. 2980, pp. 128\u2013141. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-25931-2_13"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64471-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:35:21Z","timestamp":1750793721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-64471-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644707","9783319644714"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64471-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"2 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}