{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:51:51Z","timestamp":1742403111715},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212683"},{"type":"electronic","value":"9783540259312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25931-2_9","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T18:34:19Z","timestamp":1294425259000},"page":"66-81","source":"Crossref","is-referenced-by-count":7,"title":["Drawing Graphs in Euler Diagrams"],"prefix":"10.1007","author":[{"given":"Paul","family":"Mutton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Rodgers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Flower","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44541-2_15","volume-title":"Graph Drawing","author":"F. Bertault","year":"2001","unstructured":"Bertault, F., Eades, P.: Drawing Hypergraphs in the Subset Standard. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 164\u2013169. Springer, Heidelberg (2001)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"De Chiara, R., Erra, U., Scarano, V.: VENNFS: A Venn-Diagram File Manager. In: IEEE Proceedingsof Information Visualization (IV 2003), pp. 120\u2013126 (2003)","DOI":"10.1109\/IV.2003.1217967"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Consens, M.P., Mendelzon, A.O.: Hy+: A Hygraph-based Query and Visualization System. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 511\u2013516 (1993)","DOI":"10.1145\/170035.171537"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-62495-3_41","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Feng, Q.: Multilevel Visualization of Clustered Graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 101\u2013112. Springer, Heidelberg (1997)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Fish, A., Flower, J., Howse, J.: A Reading Algorithm for Constraint Diagrams. In: Proc. IEEE 2003 symposium on Human-Centric Computing languages and environments (HCC 2003), pp. 161\u2013168 (2003)","DOI":"10.1109\/HCC.2003.1260220"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-25959-6_19","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A. Fish","year":"2004","unstructured":"Fish, A., Howse, J.: Computing Reading Trees for Constraint Diagrams. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol.\u00a03062, pp. 260\u2013274. Springer, Heidelberg (2004)"},{"key":"9_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-46037-3_6","volume-title":"Diagrammatic Representation and Inference","author":"J. Flower","year":"2002","unstructured":"Flower, J., Howse, J.: Generating Euler Diagrams. In: Hegarty, M., Meyer, B., Narayanan, N.H. (eds.) Diagrams 2002. LNCS (LNAI), vol.\u00a02317, pp. 61\u201375. Springer, Heidelberg (2002)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Flower, J., Rodgers, P., Mutton, P.: Layout Metrics for Euler Diagrams. In: Proc. IEEE Information Visualization (IV 2003), pp. 272\u2013280 (2003)","DOI":"10.1109\/IV.2003.1217990"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Flower, J., Stapleton, G.: Automated Theorem Proving with Spider Diagrams. To appear in Proc. Computing Australasian Theory Symposium (CATS 2004)","DOI":"10.1016\/j.entcs.2003.12.016"},{"key":"9_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25931-2_17","volume-title":"Diagrammatic Representation and Inference","author":"J. Flower","year":"2004","unstructured":"Flower, J., Masthoff, J., Stapleton, G.: Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds.) Diagrams 2004. LNCS (LNAI), vol.\u00a02980, Springer, Heidelberg (2004)"},{"key":"9_CR11","unstructured":"Flower, J., Howse, J., Taylor, J.: Nesting in Euler Diagrams, Syntax, Semantics and Construction. Journal of Software and Systems Modelling (SoSyM), Springer Verlag, Issue 1, article 5"},{"issue":"11","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph Drawing by Force-directed Placement. Software-Practice and Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software-Practice and Experience"},{"issue":"5","key":"9_CR13","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/42411.42414","volume":"31","author":"D. Harel","year":"1988","unstructured":"Harel, D.: On Visual Formalisms. Communications of the ACM\u00a031(5), 514\u2013530 (1988)","journal-title":"Communications of the ACM"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Harel, D., Yashchin, G.: An Algorithm for Blob Hierarchy Layout. In: Working Conference on Advanced Visual Interfaces, May 2000, pp. 29\u201340 (2000)","DOI":"10.1145\/345513.345240"},{"key":"9_CR15","unstructured":"Higraph web page, \n                  \n                    http:\/\/db.uwaterloo.ca\/~gweddell\/higraph\/higraph.html"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/VL.1999.795885","volume-title":"Proc. IEEE Symposium on Visual Languages 1999 (VL 1999)","author":"J. Howse","year":"1999","unstructured":"Howse, J., Molina, F., Taylor, J., Kent, S.: Reasoning with Spider Diagrams. In: Proc. IEEE Symposium on Visual Languages 1999 (VL 1999), pp. 138\u2013147. IEEE Press, Los Alamitos (1999)"},{"key":"9_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. International Journal of Computer Mathematics\u00a034, 177\u2013185 (1990)","journal-title":"International Journal of Computer Mathematics"},{"key":"9_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25931-2_12","volume-title":"Diagrammatic Representation and Inference","author":"G. Stapleton","year":"2004","unstructured":"Stapleton, G., Howse, J., Taylor, J., Thompson, S.: What Can Spider Diagrams Say? In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds.) Diagrams 2004. LNCS (LNAI), vol.\u00a02980, Springer, Heidelberg (2004)"},{"key":"9_CR19","unstructured":"Stapleton, G., Howse, J., Taylor, J.: A Constraint Diagram Reasoning System. In: Proc Visual Languages and Computing 2003, pp. 263\u2013270 (2003)"},{"key":"9_CR20","unstructured":"Visual Modelling Group: technical report on spider diagram reasoning systems at \n                  \n                    www.cmis.brighton.ac.uk\/research\/vmg\/SDRules.html"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing Graphs Nicely Using Simulated Annealing. ACM Transactions of Graphics\u00a015(4), 301\u2013331 (1996)","journal-title":"ACM Transactions of Graphics"},{"key":"9_CR22","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":"9_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-44590-0_8","volume-title":"Theory and Application of Diagrams","author":"J. Howse","year":"2000","unstructured":"Howse, J., Molina, F., Taylor, J.: On the completeness and expressiveness of spider diagram systems. In: Anderson, M., Cheng, P., Haarslev, V. (eds.) Diagrams 2000. LNCS (LNAI), vol.\u00a01889, pp. 26\u201341. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Diagrammatic Representation and Inference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25931-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T09:24:05Z","timestamp":1553333045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25931-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212683","9783540259312"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25931-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}