{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T21:27:41Z","timestamp":1673386061590},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":[[2002,6]]},"DOI":"10.1016\/s0020-0190(01)00280-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:03:54Z","timestamp":1027605834000},"page":"237-242","source":"Crossref","is-referenced-by-count":3,"title":["On the approximability of two tree drawing conventions"],"prefix":"10.1016","volume":"82","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00280-0_BIB001","series-title":"Complexity and Approximation\u2014Combinatorial Optimization Problems and their Approximability Properties","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0020-0190(01)00280-0_BIB002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)00291-P","article-title":"Appoximate solutions of NP optimization problems","volume":"150","author":"Ausiello","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00280-0_BIB003","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","article-title":"A note on optimal area algorithms for upward drawings of binary trees","volume":"2","author":"Crescenzi","year":"1992","journal-title":"Comput. Geometry: Theory Appl."},{"key":"10.1016\/S0020-0190(01)00280-0_BIB004","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. Geometry: Theory Appl."},{"key":"10.1016\/S0020-0190(01)00280-0_BIB005","series-title":"Graph Drawing\u2014Algorithms for Drawing Graphs","author":"Di Battista","year":"1999"},{"key":"10.1016\/S0020-0190(01)00280-0_BIB006","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S0218195993000099","article-title":"Two tree drawing conventions","volume":"3","author":"Eades","year":"1996","journal-title":"Internat. J. Comput. Geometry Appl."},{"key":"10.1016\/S0020-0190(01)00280-0_BIB007","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1142\/S0218195996000228","article-title":"Planar upward tree drawings with optimal area","volume":"6","author":"Garg","year":"1996","journal-title":"Internat. J. Comput. Geometry Appl."},{"key":"10.1016\/S0020-0190(01)00280-0_BIB008","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(01)00280-0_BIB009","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0925-7721(96)00018-1","article-title":"A note on parallel algorithms for optimal h-v drawings of binary trees","volume":"9","author":"Metaxas","year":"1998","journal-title":"Comput. Geometry: Theory Appl."},{"key":"10.1016\/S0020-0190(01)00280-0_BIB010","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","article-title":"Tidier drawings of trees","volume":"2","author":"Reingold","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0020-0190(01)00280-0_BIB011","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","article-title":"Optimal orientations of cells in slicing floorplan design","volume":"57","author":"Stockmeyer","year":"1993","journal-title":"Inform. and Control"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002800?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002800?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:53:02Z","timestamp":1556481182000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001002800"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00280-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}