{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:33:33Z","timestamp":1774370013244,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_3","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"20-33","source":"Crossref","is-referenced-by-count":3,"title":["Path-Based Supports for 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":"3_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":"3_CR2","series-title":"LNCS","first-page":"201","volume-title":"IWOCA 2010","author":"U. Brandes","year":"2010","unstructured":"Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Hypergraphs and outerplanarity. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 201\u2013211. Springer, Heidelberg (2010)"},{"key":"3_CR3","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":"3_CR4","doi-asserted-by":"publisher","first-page":"6391","DOI":"10.1016\/j.disc.2008.10.023","volume":"309","author":"C. Bujt\u00e1s","year":"2009","unstructured":"Bujt\u00e1s, C., Tuza, Z.: Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. Discrete Mathematics\u00a0309, 6391\u20136401 (2009)","journal-title":"Discrete Mathematics"},{"issue":"6","key":"3_CR5","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":"3_CR6","first-page":"13","volume-title":"Proceedings of the 13th International Conference on Very Large Data Bases (VLDB\u00a02004)","author":"D.S. Johnson","year":"2004","unstructured":"Johnson, D.S., Krishnan, S., Chhugani, J., Kumar, S., Venkatasubramanian, S.: Compressing large boolean matrices using reordering techniques. In: Nascimento, M.A., \u00d6zsu, M.T., Kossmann, D., Miller, R.J., Blakeley, J.A., Schiefer, K.B. (eds.) Proceedings of the 13th International Conference on Very Large Data Bases (VLDB\u00a02004), pp. 13\u201323. Morgan Kaufmann, San Francisco (2004)"},{"issue":"3","key":"3_CR7","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":"3_CR8","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":"3_CR9","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":"3_CR10","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":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-11805-0_36","volume-title":"Graph Drawing","author":"M. N\u00f6llenburg","year":"2010","unstructured":"N\u00f6llenburg, M.: An improved algorithm for the metro-line crossing minimization problem. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 381\u2013392. Springer, Heidelberg (2010)"},{"issue":"3","key":"3_CR12","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"},{"issue":"3","key":"3_CR13","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"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00450-007-0036-y","volume":"22","author":"A. Wolff","year":"1970","unstructured":"Wolff, A.: Drawing subway maps: A survey. Informatik-Forschung und Entwicklung\u00a022, 23\u201344 (1970)","journal-title":"Informatik-Forschung und Entwicklung"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:51:12Z","timestamp":1558421472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}