{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T15:09:47Z","timestamp":1726758587707},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_15","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"164-169","source":"Crossref","is-referenced-by-count":12,"title":["Drawing Hypergraphs in the Subset Standard (Short Demo Paper)"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bertault","sequence":"first","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"issue":"1\u20132","key":"15_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00042-9","volume":"74","author":"F. Bertault","year":"2000","unstructured":"F. Bertault. A force-directed algorithm that preserves edge-crossing properties. Information Processing Letters, 74(1\u20132):7\u201313, 2000.","journal-title":"Information Processing Letters"},{"issue":"11","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129\u20131164, 1991.","journal-title":"Software-Practice and Experience"},{"issue":"5","key":"15_CR3","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/42411.42414","volume":"31","author":"D. Harel","year":"1988","unstructured":"D. Harel. On visual formalisms. Communications of the ACM, 31(5):514\u2013530, 1988.","journal-title":"Communications of the ACM"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"D. S. Johnson and H. O. Pollak. Hypergraph planarity and the complexity of drawing venn diagrams. Journal of Graph Theory, 1987.","DOI":"10.1002\/jgt.3190110306"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R. M. Karp","year":"1975","unstructured":"R. M. Karp. On the computational complexity of combinatorial problems. Networks, 5:45\u201368, 1975.","journal-title":"Networks"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/209849.209855","volume":"27","author":"H. Klemetti","year":"1995","unstructured":"H. Klemetti, I. Lapinleimu, E. M\u00e4kinen, and M. Sieranta. A programming project: Trimming the spring algorithm for drawing hypergraphs. SIGCSE Bulletin, 27(3):34\u201338, 1995.","journal-title":"SIGCSE Bulletin"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"E. M\u00e4kinen. How to draw a hypergraph. International Journal of Computer Mathematics, 1990.","DOI":"10.1080\/00207169008803875"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. Naher. LEDA, a Platform for Combinatorial and Geometric Computing. Communications of the ACM, 38(1):96\u2013102, 1995.","journal-title":"Communications of the ACM"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/14786448008626877","volume":"9","author":"J. Venn","year":"1880","unstructured":"John Venn. On the diagrammatic and mechanical representation of propositions and reasonings. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 9:1\u201318, 1880.","journal-title":"The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L","volume":"30","author":"P. Winter","year":"1997","unstructured":"P. Winter and M. Zachariasen. Euclidean steiner minimum trees: An improved exact algorithm. Networks, 30:149\u2013166, 1997.","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:19:31Z","timestamp":1556666371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}