{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:10:22Z","timestamp":1743045022792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_6","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"67-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Twins in Subdivision Drawings of Hypergraphs"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"van Bevern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iyad","family":"Kanj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1111\/cgf.12722","volume":"35","author":"B Alsallakh","year":"2016","unstructured":"Alsallakh, B., Micallef, L., Aigner, W., Hauser, H., Miksch, S., Rodgers, P.J.: The state-of-the-art of set visualization. Comput. Graph. Forum 35(1), 234\u2013260 (2016)","journal-title":"Comput. Graph. Forum"},{"issue":"3","key":"6_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. J. ACM 30(3), 479\u2013513 (1983)","journal-title":"J. ACM"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/moor.13.1.99","volume":"13","author":"RE Bixby","year":"1988","unstructured":"Bixby, R.E., Wagner, D.K.: An almost linear-time algorithm for graph realization. Math. Oper. Res. 13(1), 99\u2013123 (1988)","journal-title":"Math. Oper. Res."},{"key":"6_CR4","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\u2014applied to hypergraphs and outerplanarity. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 201\u2013211. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-19222-7_21"},{"key":"6_CR5","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 14, 248\u2013261 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.7155\/jgaa.00237","volume":"15","author":"K Buchin","year":"2011","unstructured":"Buchin, K., van Kreveld, M.J., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. J. Graph Algorithms Appl. 15(4), 533\u2013549 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/140955057","volume":"29","author":"J Chen","year":"2015","unstructured":"Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Such\u00fd, O., Weller, M.: Polynomial-time data reduction for the subset interconnection design problem. SIAM J. Discrete Math. 29(1), 1\u201325 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"key":"6_CR9","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Berlin (2010)","edition":"4"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1111\/j.1467-8659.2012.03080.x","volume":"31","author":"K Dinkla","year":"2012","unstructured":"Dinkla, K., van Kreveld, M.J., Speckmann, B., Westenberg, M.A.: Kelp diagrams: point set membership visualization. Comput. Graph. Forum 31(3), 875\u2013884 (2012)","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"6_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. J. Graph Algorithms Appl. 10(2), 141\u2013157 (2006)","journal-title":"J. Graph Algorithms Appl."},{"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. Vis. Lang. Comput. 19(6), 675\u2013694 (2008)","journal-title":"J. Vis. Lang. Comput."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: an interesting algorithmic tool kit. Int. J. Found. Comput. Sci. 10(2), 147\u2013170 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190110306","volume":"11","author":"DS Johnson","year":"1987","unstructured":"Johnson, D.S., Pollak, H.O.: Hypergraph planarity and the complexity of drawing Venn diagrams. J. Graph Theory 11(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., Kreveld, M., Speckmann, B.: Subdivision drawings of hypergraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 396\u2013407. Springer, Heidelberg (2009). doi:\n                      10.1007\/978-3-642-00219-9_39"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-08404-6_23","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"B Klemz","year":"2014","unstructured":"Klemz, B., Mchedlidze, T., N\u00f6llenburg, M.: Minimum tree supports for hypergraphs and low-concurrency Euler diagrams. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 265\u2013276. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-319-08404-6_23"},{"issue":"1\u20133","key":"6_CR17","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. Math. Program. 98(1\u20133), 385\u2013414 (2003)","journal-title":"Math. Program."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1080\/00207169008803875","volume":"34","author":"E M\u00e4kinen","year":"1990","unstructured":"M\u00e4kinen, E.: How to draw a hypergraph. Int. J. Comput. Math. 34, 178\u2013185 (1990)","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13(3), 743\u2013768 (1963)","journal-title":"Proc. London Math. Soc."},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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 (LNAI), vol. 2980, pp. 128\u2013141. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-25931-2_13"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:39:28Z","timestamp":1600475968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}