{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T14:42:30Z","timestamp":1770216150921,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642118043","type":"print"},{"value":"9783642118050","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_33","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T02:45:33Z","timestamp":1267757133000},"page":"345-356","source":"Crossref","is-referenced-by-count":9,"title":["On Planar Supports for Hypergraphs"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM\u00a030, 479\u2013513 (1983)","journal-title":"Journal of the ACM"},{"key":"33_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)"},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and planarity using pq-tree algorithms. Journal of Computer and System Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Brinkmeier, M., Werner, J., Recknagel, S.: Communities in graphs and hypergraphs. In: 16th ACM Conference on Information and Knowledge Management, pp. 869\u2013872 (2007)","DOI":"10.1145\/1321440.1321563"},{"key":"33_CR6","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"33_CR7","series-title":"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.\u00a02317, pp. 61\u201375. Springer, Heidelberg (2002)"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.2001.1205","volume":"43","author":"W.L. Hsu","year":"2002","unstructured":"Hsu, W.L.: A simple test for the consecutive ones property. Journal of Algorithms\u00a043(1), 1\u201316 (2002)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"33_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. Journal of Graph Theory\u00a011(3), 309\u2013325 (1987)","journal-title":"Journal of Graph Theory"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-642-00219-9_39","volume-title":"Graph Drawing","author":"M. Kaufmann","year":"2009","unstructured":"Kaufmann, M., van Kreveld, M., Speckmann, B.: Subdivision drawings of hypergraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 396\u2013407. Springer, Heidelberg (2009)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10107-003-0410-x","volume":"98","author":"E. Korach","year":"2003","unstructured":"Korach, E., Stern, M.: The clustering matroid and the optimal clustering tree. Mathematical Programming, Series B\u00a098, 385\u2013414 (2003)","journal-title":"Mathematical Programming, Series B"},{"key":"33_CR12","doi-asserted-by":"crossref","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":"33_CR13","series-title":"Lecture Notes in Computer Science","first-page":"381","volume-title":"GD 2004","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.) GD 2004. LNCS, vol.\u00a03393, pp. 381\u2013386. Springer, Heidelberg (2005)"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0020-0190(92)90087-C","volume":"44","author":"A. Tamura","year":"1992","unstructured":"Tamura, A., Tamura, Y.: Degree constrained tree embedding into points in the plane. Information Processing Letters\u00a044, 211\u2013214 (1992)","journal-title":"Information Processing Letters"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing\u00a013, 566\u2013579 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"33_CR16","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","volume":"39","author":"A. Tucker","year":"1971","unstructured":"Tucker, A.: Matrix characterizations of circular-arc graphs. Pacific Journal of Mathematics\u00a039(2), 535\u2013545 (1971)","journal-title":"Pacific Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11805-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T13:46:53Z","timestamp":1552398413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}