{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:32Z","timestamp":1770994172094,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319084039","type":"print"},{"value":"9783319084046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08404-6_23","type":"book-chapter","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T23:55:08Z","timestamp":1403654108000},"page":"265-276","source":"Crossref","is-referenced-by-count":8,"title":["Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams"],"prefix":"10.1007","author":[{"given":"Boris","family":"Klemz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-16108-7_12","volume-title":"Algorithmic Learning Theory","author":"D. Angluin","year":"2010","unstructured":"Angluin, D., Aspnes, J., Reyzin, L.: Inferring social networks from outbreaks. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) Algorithmic Learning Theory. LNCS, vol.\u00a06331, pp. 104\u2013118. Springer, Heidelberg (2010)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Reyzin, L.: Network construction with subgraph connectivity constraints. J. Comb. Optim. (2013)","DOI":"10.1007\/s10878-013-9603-2"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-19222-7_21","volume-title":"Combinatorial Algorithms","author":"U. Brandes","year":"2011","unstructured":"Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Blocks of hypergraphs applied to hypergraphs and outerplanarity. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 201\u2013211. Springer, Heidelberg (2011)"},{"key":"23_CR4","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, Utrecht University (2009)","DOI":"10.1007\/978-3-642-11805-0_33"},{"key":"23_CR5","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":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-45030-3_34","volume-title":"Algorithms and Computation","author":"J. Chen","year":"2013","unstructured":"Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Such\u00fd, O., Weller, M.: Effective and efficient data reduction for the subset interconnection design problem. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol.\u00a08283, pp. 361\u2013371. Springer, Heidelberg (2013)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Chockler, G., Melamed, R., Tock, Y., Vitenberg, R.: Constructing scalable overlays for pub-sub with many topics. In: Principles of Distributed Computing (PODC 2007), pp. 109\u2013118 (2007)","DOI":"10.1145\/1281100.1281118"},{"key":"23_CR8","unstructured":"Chow, S.: Generating and Drawing Area-Proportional Euler and Venn Diagrams. PhD thesis, University of Victoria (2007)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-24595-7_44","volume-title":"Graph Drawing","author":"S. Chow","year":"2004","unstructured":"Chow, S., Ruskey, F.: Drawing area-proportional Venn and Euler diagrams. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 466\u2013477. Springer, Heidelberg (2004)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01096768","volume":"6","author":"D.-Z. Du","year":"1995","unstructured":"Du, D.-Z., Kelley, D.F.: On complexity of subset interconnection designs. J. Global Optim.\u00a06, 193\u2013205 (1995)","journal-title":"J. Global Optim."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-85097-7_19","volume-title":"Combinatorial Optimization and Applications","author":"H. Fan","year":"2008","unstructured":"Fan, H., Hundt, C., Wu, Y.-L., Ernst, J.: Algorithms and implementation for interconnection graph problem. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 201\u2013210. Springer, Heidelberg (2008)"},{"issue":"6","key":"23_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. J. Visual Languages and Computing\u00a019(6), 675\u2013694 (2008)","journal-title":"J. Visual Languages and Computing"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Hosoda, J., Hromkovi\u010d, J., Izumi, T., Ono, H., Steinov\u00e1, M., Wada, K.: On the approximability and hardness of minimum topic connected overlay and its special instances. Theoretical Computer Science 429, 144\u2013154 (2012)","DOI":"10.1016\/j.tcs.2011.12.033"},{"issue":"3","key":"23_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. J. Graph Theory\u00a011(3), 309\u2013325 (1987)","journal-title":"J. Graph Theory"},{"key":"23_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)"},{"issue":"1-3","key":"23_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\u00a098(1-3), 385\u2013414 (2003)","journal-title":"Mathematical Programming"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.dam.2006.12.004","volume":"156","author":"E. Korach","year":"2008","unstructured":"Korach, E., Stern, M.: The complete optimal stars-clustering-tree problem. Discrete Applied Mathematics\u00a0156, 444\u2013450 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR18","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-87730-1_6","volume-title":"Diagrammatic Representation and Inference","author":"P.J. Rodgers","year":"2008","unstructured":"Rodgers, P.J., Zhang, L., Fish, A.: General Euler diagram generation. In: Stapleton, G., Howse, J., Lee, J. (eds.) Diagrams 2008. LNCS (LNAI), vol.\u00a05223, pp. 13\u201327. Springer, Heidelberg (2008)"},{"issue":"6","key":"23_CR19","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.jvlc.2011.07.001","volume":"22","author":"G. Stapleton","year":"2011","unstructured":"Stapleton, G., Rodgers, P., Howse, J.: A general method for drawing area-proportional Euler diagrams. J. Visual Languages and Computing\u00a022(6), 426\u2013442 (2011)","journal-title":"J. Visual Languages and Computing"},{"issue":"3","key":"23_CR20","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 J. Comput.\u00a013(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08404-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:20:05Z","timestamp":1558916405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08404-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084039","9783319084046"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08404-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}