{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:56Z","timestamp":1759638656394},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":[[1997,4]]},"DOI":"10.1016\/s0020-0190(97)00048-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"81-88","source":"Crossref","is-referenced-by-count":10,"title":["Area requirement of visibility representations of trees"],"prefix":"10.1016","volume":"62","author":[{"given":"Goos","family":"Kant","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00048-3_BIB1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02574385","article-title":"Can visibility graphs be represented compactly?","volume":"12","author":"Agarwal","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(97)00048-3_BIB2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0166-218X(92)90018-6","article-title":"Some results on visibility graphs","volume":"40","author":"Andreae","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(97)00048-3_BIB3","series-title":"Graph Drawing (Proc. GD'95)","volume":"Vol. 1027","year":"1996"},{"key":"10.1016\/S0020-0190(97)00048-3_BIB4","series-title":"Graph Drawing (Proc. GD'94)","first-page":"159","article-title":"Rectangle-visibility representations of bipartite graphs","volume":"Vol. 894","author":"Dean","year":"1995"},{"key":"10.1016\/S0020-0190(97)00048-3_BIB5","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. Theory Appl."},{"key":"10.1016\/S0020-0190(97)00048-3_BIB6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","article-title":"Area requirement and symmetry display of planar upward drawings","volume":"7","author":"Di Battista","year":"1992","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"10.1016\/S0020-0190(97)00048-3_BIB7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1142\/S0218195996000228","article-title":"Area-optimal upward tree drawings","volume":"6","author":"Garg","year":"1996","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0020-0190(97)00048-3_BIB8","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/0220055","article-title":"An output-sensitive algorithm for computing visibility graphs","volume":"20","author":"Ghosh","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00048-3_BIB9","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"issue":"4","key":"10.1016\/S0020-0190(97)00048-3_BIB10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","article-title":"Rectilinear planar layouts and bipolar orientations of planar graphs","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"10.1016\/S0020-0190(97)00048-3_BIB11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(97)00048-3_BIB12","series-title":"Graph Drawing (Proc. GD'94)","volume":"Vol. 894","year":"1995"},{"key":"10.1016\/S0020-0190(97)00048-3_BIB13","series-title":"Proc. 1st Ann. ACM Symp. Comput. Geom.","first-page":"147","article-title":"Characterizing bar line-of-sight graphs","author":"Wismath","year":"1985"},{"key":"10.1016\/S0020-0190(97)00048-3_BIB14","article-title":"Bar-representable visibility graphs and related flow problems","author":"Wismath","year":"1989"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000483?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000483?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:54:03Z","timestamp":1556628843000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0020019097000483"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00048-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}