{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:08Z","timestamp":1725807848975},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_6","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"64-75","source":"Crossref","is-referenced-by-count":2,"title":["Simultaneous Embeddability of Two Partitions"],"prefix":"10.1007","author":[{"given":"Jan Christoph","family":"Athenst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Hartmann","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":"6_CR1","doi-asserted-by":"crossref","unstructured":"Athenst\u00e4dt, J.C., Hartmann, T., N\u00f6llenburg, M.: Simultaneous embeddability of two partitions. CoRR, abs\/1408.6019 (August 2014)","DOI":"10.1007\/978-3-662-45803-7_6"},{"key":"6_CR2","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, ch.\u00a011, pp. 349\u2013381. CRC Press (2013)"},{"key":"6_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":"6_CR4","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.jda.2011.12.009","volume":"14","author":"U. Brandes","year":"2012","unstructured":"Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Path-based supports for hypergraphs. J. Discrete Algorithms\u00a014, 248\u2013261 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"6_CR5","doi-asserted-by":"crossref","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), see also Tech. Rep. UU-CS-2009-035, Utrecht University (2009)","DOI":"10.1007\/978-3-642-11805-0_33"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1198\/106186008X318440","volume":"17","author":"A. Buja","year":"2008","unstructured":"Buja, A., Swayne, D.F., Littman, M.L., Dean, N., Hofmann, H., Chen, L.: Data visualization with multidimensional scaling. J. Comput. Graphical Statistics\u00a017(2), 444\u2013472 (2008)","journal-title":"J. Comput. Graphical Statistics"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-34611-8_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Chaplick","year":"2012","unstructured":"Chaplick, S., Jel\u00ednek, V., Kratochv\u00edl, J., Vysko\u010dil, T.: Bend-bounded path intersection graphs: Sausages, noodles, and waffles on a grill. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 274\u2013285. Springer, Heidelberg (2012)"},{"key":"6_CR8","unstructured":"Chow, S.: Generating and Drawing Area-Proportional Euler and Venn Diagrams. PhD thesis, University of Victoria (2007)"},{"issue":"6","key":"6_CR9","first-page":"1009","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 TVCG\u00a015(6), 1009\u20131016 (2009)","journal-title":"IEEE TVCG"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-14031-0_25","volume-title":"Computing and Combinatorics","author":"M. Berg de","year":"2010","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions in the plane. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 216\u2013225. Springer, Heidelberg (2010)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms - ESA \u201995","author":"Q.-W. Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"issue":"6","key":"6_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"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"issue":"3","key":"6_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":"6_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":"6_CR16","doi-asserted-by":"crossref","unstructured":"Kohonen, T.: Self-Organizing Maps, 3rd edn. Springer (2001)","DOI":"10.1007\/978-3-642-56927-2"},{"issue":"3-4","key":"6_CR17","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. Computer Math.\u00a034(3-4), 177\u2013185 (1990)","journal-title":"Int. J. Computer Math."},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J. Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs and Combinatorics\u00a017(4), 717\u2013728 (2001)","journal-title":"Graphs and Combinatorics"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1111\/j.1467-8659.2009.01452.x","volume":"28","author":"P. Simonetto","year":"2009","unstructured":"Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets. Computer Graphics Forum\u00a028(3), 967\u2013974 (2009)","journal-title":"Computer Graphics Forum"},{"key":"6_CR20","unstructured":"S.\u00a0Wagner and D.\u00a0Wagner. Comparing Clusterings \u2013 An Overview. Tech. Rep. 2006-04, Department of Informatics, Universit\u00e4t Karlsruhe, 2007."},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0095-8956(75)90042-8","volume":"18","author":"T.R. Walsh","year":"1975","unstructured":"Walsh, T.R.: Hypermaps Versus Bipartite Maps. J. Combinatorial Theory Series\u00a0B\u00a018(2), 155\u2013163 (1975)","journal-title":"J. Combinatorial Theory Series\u00a0B"},{"issue":"6","key":"6_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1070\/RM1974v029n06ABEH001303","volume":"29","author":"A.A. Zykov","year":"1974","unstructured":"Zykov, A.A.: Hypergraphs. Russian Mathematical Surveys\u00a029(6), 89\u2013156 (1974)","journal-title":"Russian Mathematical Surveys"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T00:04:36Z","timestamp":1566086676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}