{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:16Z","timestamp":1770994156748,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642002182","type":"print"},{"value":"9783642002199","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_39","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T13:03:51Z","timestamp":1233752631000},"page":"396-407","source":"Crossref","is-referenced-by-count":26,"title":["Subdivision Drawings of Hypergraphs"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kaufmann","sequence":"first","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)"},{"key":"39_CR2","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. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 164\u2013169. Springer, Heidelberg (2001)"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Brinkmeier, M., Werner, J., Recknagel, S.: Communities in graphs and hypergraphs. In: ACM CIKM 2007, pp. 869\u2013872 (2007)","DOI":"10.1145\/1321440.1321563"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Didimo, W., Giordano, F., Liotta, G.: Overlapping cluster planarity. In: Asia-Pacific Symposium on Visualisation, pp. 73\u201380 (2007)","DOI":"10.1109\/APVIS.2007.329278"},{"issue":"6","key":"39_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0020-0190(90)90210-O","volume":"33","author":"M.B. Dillencourt","year":"1990","unstructured":"Dillencourt, M.B.: Realizability of Delaunay triangulations. Information Processing Letters\u00a033(6), 283\u2013287 (1990)","journal-title":"Information Processing Letters"},{"issue":"2","key":"39_CR6","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. of Graph Algorithms and Applications\u00a010(2), 141\u2013157 (2006)","journal-title":"J. of Graph Algorithms and Applications"},{"issue":"3","key":"39_CR7","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. of the ACM\u00a030(3), 514\u2013550 (1983)","journal-title":"J. of the ACM"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","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, vol.\u00a02317, pp. 61\u201375. Springer, Heidelberg (2002)"},{"issue":"3","key":"39_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190110306","volume":"11","author":"D. Johnson","year":"1987","unstructured":"Johnson, D., Pollak, H.: Hypergraph planarity and the complexity of drawing Venn diagrams. J. of Graph Theory\u00a011(3), 309\u2013325 (1987)","journal-title":"J. of Graph Theory"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-1-4684-6381-1_9","volume":"17","author":"J.R. Lundgren","year":"1989","unstructured":"Lundgren, J.R.: Food webs, competition graphs, competition-common enemy graphs and niche graphs. Applications of Combinatorics and Graph Theory to the Biological and Social Sciences\u00a017, 221\u2013243 (1989)","journal-title":"Applications of Combinatorics and Graph Theory to the Biological and Social Sciences"},{"key":"39_CR11","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. International J. of Computer Mathematics\u00a034, 177\u2013185 (1990)","journal-title":"International J. of Computer Mathematics"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Ramadan, E., Tarafdar, A., Pothen, A.: A hypergraph model for the yeast protein complex network. In: 18th Parallel and Distributed Processing Symposium, pp. 189\u2013190 (2004)","DOI":"10.1109\/IPDPS.2004.1303205"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Ruskey, F., Weston, M.: A survey of Venn diagrams. The Electronic J. of Combinatorics (2005), http:\/\/www.combinatorics.org\/Surveys\/ds5\/VennEJC.html","DOI":"10.37236\/26"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","first-page":"381","volume-title":"Formal Methods in Software and Systems Modeling","author":"G. Sander","year":"2005","unstructured":"Sander, G.: Layout of directed hypergraphs with orthogonal hyperedges. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol.\u00a03393, pp. 381\u2013386. Springer, Heidelberg (2005)"},{"key":"39_CR15","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","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, vol.\u00a02980, pp. 128\u2013141. Springer, Heidelberg (2004)"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0095-8956(75)90042-8","volume":"18","author":"T. Walsh","year":"1975","unstructured":"Walsh, T.: Hypermaps versus bipartite maps. J. of Combinatorial Theory\u00a018, 155\u2013163 (1975)","journal-title":"J. of Combinatorial Theory"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T09:53:00Z","timestamp":1589536380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}