{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:08:58Z","timestamp":1725455338080},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540607236"},{"type":"electronic","value":"9783540493518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0021837","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:56:38Z","timestamp":1131864998000},"page":"520-523","source":"Crossref","is-referenced-by-count":2,"title":["Swan: A data structure visualization system"],"prefix":"10.1007","author":[{"given":"Jun","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clifford A.","family":"Shaffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lenwood S.","family":"Heath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"issue":"8","key":"54_CR1","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1002\/spe.4380230802","volume":"23","author":"A. Bloesch","year":"1993","unstructured":"A. Bloesch, \u201cAesthetic Layout of Generalized Trees\u201d, SOFTWARE\u2014Practice and Experience, Vol. 23(8), August 1993, pp. 817\u2013827.","journal-title":"SOFTWARE\u2014Practice and Experience"},{"issue":"No.4","key":"54_CR2","first-page":"424","volume":"13","author":"P. Eades","year":"1990","unstructured":"P. Eades and K. Sugiyama, \u201cHow to Draw a Directed Graph\u201d, Journal of Information Processing, Vol. 13, No. 4, 1990, pp. 424\u2013437.","journal-title":"Journal of Information Processing"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"T. Kamada and S. Kawai, \u201cAn Algorithm for Drawing General Undirected Graphs\u201d, Information Processing Letters, Vol. 31, April 1989, pp. 7\u201315.","journal-title":"Information Processing Letters"},{"issue":"No.12","key":"54_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/2.247643","volume":"26","author":"G.-C. Roman","year":"1993","unstructured":"G.-C. Roman and K.C. Cox, \u201cA Taxonomy of Program Visualization Systems\u201d, IEEE Computer, Vol. 26, No. 12, 1993, pp. 11\u201324.","journal-title":"IEEE Computer"},{"key":"54_CR5","volume-title":"Lecture Notes in Computer Science 894","author":"R. Tamassia","year":"1994","unstructured":"R. Tamassia and I.G. Tollis, Eds., Graph Drawing'94, Lecture Notes in Computer Science 894, Springer, Berlin, 1994."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0021837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T11:10:11Z","timestamp":1549278611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0021837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607236","9783540493518"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0021837","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}