{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:31Z","timestamp":1770994171912,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642192210","type":"print"},{"value":"9783642192227","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_21","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"201-211","source":"Crossref","is-referenced-by-count":15,"title":["Blocks of Hypergraphs"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[]},{"given":"Barbara","family":"Pampel","sequence":"additional","affiliation":[]},{"given":"Arnaud","family":"Sallaberry","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","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 Association for Computing Mashinery\u00a030(4), 479\u2013513 (1983)","journal-title":"Journal of the Association for Computing Mashinery"},{"key":"21_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)"},{"key":"21_CR3","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Diagrammatic Representation and Inference","year":"2004","unstructured":"Blackwell, A.F., Marriott, K., Shimojima, A. (eds.): Diagrams 2004. LNCS (LNAI), vol.\u00a02980. Springer, Heidelberg (2004)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutives ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Buchin, K., van Kreveld, M., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. Technical Report UU-CS-2009-035, Department of Information and Computing Sciences, Utrecht University (2009)","DOI":"10.1007\/978-3-642-11805-0_33"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-11805-0_33","volume-title":"Graph Drawing","author":"K. Buchin","year":"2010","unstructured":"Buchin, K., van Kreveld, M., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 345\u2013356. Springer, Heidelberg (2010)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-77120-3_18","volume-title":"Algorithms and Computation","author":"M. Chimani","year":"2007","unstructured":"Chimani, M., Gutwenger, C.: Algorithms for the hypergraph and the minor crossing number problems. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 184\u2013195. Springer, Heidelberg (2007)"},{"key":"21_CR8","unstructured":"Chow, S.C.: Generating and drawing area-proportional Euler and Venn diagrams. PhD thesis, University of Victoria, British Columbia Canada (2007)"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.7155\/jgaa.00167","volume":"12","author":"W. Didimo","year":"2008","unstructured":"Didimo, W., Giordano, F., Liotta, G.: Overlapping cluster planarity. Journal on Graph Algorithms and Applications\u00a012(3), 267\u2013291 (2008)","journal-title":"Journal on Graph Algorithms and Applications"},{"key":"21_CR10","unstructured":"Dinitz, Y., Karzanov, A.V., Lomonosov, M.: On the structure of a family of minimal weighted cuts in a graph. In: Fridman, A. (ed.) Studies in Discrete Optimization, pp. 290\u2013306. Nauka (1976) (in Russian)"},{"issue":"2","key":"21_CR11","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. Journal on Graph Algorithms and Applications\u00a010(2), 141\u2013157 (2006)","journal-title":"Journal on Graph Algorithms and Applications"},{"issue":"6","key":"21_CR12","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.jvlc.2008.01.004","volume":"19","author":"J. Flower","year":"2008","unstructured":"Flower, J., Fish, A., Howse, J.: Euler diagram generation. Journal on Visual Languages and Computing\u00a019(6), 675\u2013694 (2008)","journal-title":"Journal on Visual Languages and Computing"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J.E. Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. Journal of the Association for Computing Mashinery\u00a021, 549\u2013568 (1974)","journal-title":"Journal of the Association for Computing Mashinery"},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190110306","volume":"11","author":"D.S. Johnson","year":"1987","unstructured":"Johnson, D.S., Pollak, H.O.: 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":"21_CR15","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":"21_CR16","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":"21_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.disc.2003.11.051","volume":"286","author":"D. Kr\u00e1l\u2019","year":"2004","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Voss, H.-J.: Mixed hypercacti. Discrete Mathematics\u00a0286, 99\u2013113 (2004)","journal-title":"Discrete Mathematics"},{"key":"21_CR18","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 Journal of Computer Mathematics\u00a034, 177\u2013185 (1990)","journal-title":"International Journal of Computer Mathematics"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Mutton, P., Rodgers, P., Flower, J.: Drawing graphs in Euler diagrams. In: Blackwell, et al. (eds.) [13], pp. 66\u201381","DOI":"10.1007\/978-3-540-25931-2_9"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-24595-7_35","volume-title":"Graph Drawing","author":"G. Sander","year":"2004","unstructured":"Sander, G.: Layout of directed hypergraphs with orthogonal hyperedges. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 381\u2013386. Springer, Heidelberg (2004)"},{"issue":"2","key":"21_CR21","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.jcss.2003.07.002","volume":"68","author":"M. Schaefer","year":"2004","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Decidability of string graphs. Journal of Computer and System Sciences\u00a068(2), 319\u2013334 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR22","first-page":"594","volume-title":"Proceedings of the 12th International Conference on Information Visualization (InfoVis 2008)","author":"P. Simonetto","year":"2008","unstructured":"Simonetto, P., Auber, D.: Visualise undrawable Euler diagrams. In: Proceedings of the 12th International Conference on Information Visualization (InfoVis 2008), pp. 594\u2013599. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"21_CR23","first-page":"673","volume-title":"Proceedings of the 13th International Conference on Information Visualization (InfoVis 2009)","author":"P. Simonetto","year":"2009","unstructured":"Simonetto, P., Auber, D.: An heuristic for the construction of intersection graphs. In: Proceedings of the 13th International Conference on Information Visualization (InfoVis 2009), pp. 673\u2013678. IEEE Computer Society Press, Los Alamitos (2009)"},{"issue":"3","key":"21_CR24","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(3), 566\u2013579 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"21_CR25","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/PROC.1978.10945","volume":"66","author":"W.M. van Cleemput","year":"1978","unstructured":"van Cleemput, W.M.: On the planarity of hypergraphs. Proceedings of the IEEE\u00a066(4), 514\u2013515 (1978)","journal-title":"Proceedings of the IEEE"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Verroust, A., Viaud, M.-L.: Ensuring the drawability of extended Euler diagrams for up to 8 sets. In: Blackwell, et al. (eds.) [3], pp. 128\u2013141","DOI":"10.1007\/978-3-540-25931-2_13"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0095-8956(75)90042-8","volume":"18","author":"T.R.S. Walsh","year":"1975","unstructured":"Walsh, T.R.S.: Hypermaps versus bipartite maps. Journal of Combinatorial Theory, Series B\u00a018, 155\u2013163 (1975)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"21_CR28","first-page":"89","volume":"6","author":"A.A. Zykov","year":"1974","unstructured":"Zykov, A.A.: Hypergraphs. Uspekhi Matematicheskikh Nauk\u00a06, 89\u2013154 (1974)","journal-title":"Uspekhi Matematicheskikh Nauk"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T08:33:38Z","timestamp":1637397218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_21"}},"subtitle":["Applied to Hypergraphs and Outerplanarity"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}