{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:52:29Z","timestamp":1649040749821},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0020-0190(98)00049-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"133-139","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for drawing binary trees in the plane"],"prefix":"10.1016","volume":"66","author":[{"given":"Chan-Su","family":"Shin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung Kwon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Ho","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00049-0_BIB1","series-title":"Proc. Symp. on Graph Drawing","article-title":"Optimizing area and aspect ratio in straight-line orthogonal tree drawings","author":"Chan","year":"1997"},{"key":"10.1016\/S0020-0190(98)00049-0_BIB2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Comput. Geom."},{"key":"10.1016\/S0020-0190(98)00049-0_BIB3","series-title":"Proc. 9th ACM Sympo. Comput. Geom.","first-page":"359","article-title":"Area-efficient upward tree drawings","author":"Garg","year":"1993"},{"key":"10.1016\/S0020-0190(98)00049-0_BIB4","series-title":"Proc. 2nd Int. Computing and Combinatorics Conf., COCOON-96","first-page":"106","article-title":"Area-efficient algorithms for upward straight-line tree drawings","author":"Shin","year":"1996"},{"issue":"12","key":"10.1016\/S0020-0190(98)00049-0_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations of VLSI circuits","volume":"C-30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000490?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000490?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:27:48Z","timestamp":1556044068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0020019098000490"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00049-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}