{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T17:37:32Z","timestamp":1781804252821,"version":"3.54.5"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0925-7721(97)00017-5","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T18:53:11Z","timestamp":1051210391000},"page":"83-110","source":"Crossref","is-referenced-by-count":55,"title":["Algorithms for area-efficient orthogonal drawings"],"prefix":"10.1016","volume":"9","author":[{"given":"Achilleas","family":"Papakostas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00017-5_BIB1","article-title":"Embedding nonplanar graphs in the rectangular grid","author":"Biedl","year":"1993","journal-title":"Rutcor Research Report 27-93"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB2","series-title":"Proc. of Workshop GD '95","first-page":"28","article-title":"New lower bounds for orthogonal graph drawings","volume":"1027","author":"Biedl","year":"1995"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB3","series-title":"Proc. of CCCG '96","article-title":"Improved orthogonal drawings of 3-graphs","author":"Biedl","year":"1996"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB4_1","article-title":"A better heuristic for orthogonal graph drawings","author":"Biedl","year":"1995"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB4_2","series-title":"Proc. 2nd Annu. European Symposium on Algorithms (ESA '94)","first-page":"24","article-title":"A better heuristic for orthogonal graph drawings","volume":"855","author":"Biedl","year":"1994"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB5","series-title":"Proc. of COCOON '95","first-page":"31","article-title":"An efficient orthogonal grid drawing algorithm for cubic graphs","volume":"959","author":"Calamoneri","year":"1995"},{"issue":"5","key":"10.1016\/S0925-7721(97)00017-5_BIB6","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":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB7","series-title":"Proc. Workshop on Algorithms and Data Structures","first-page":"151","article-title":"Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs","volume":"709","author":"Di Battista","year":"1993"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB8","series-title":"Proc. 19th Annu. ACM Symp. Theory of Computing","first-page":"365","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB9","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB10","article-title":"Rectilinear planar drawings with few bends in each edge","author":"Even","year":"1994"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","article-title":"Computing an st-numbering","volume":"2","author":"Even","year":"1976","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0925-7721(97)00017-5_BIB12","series-title":"Proc. DIMACS Workshop GD '94","first-page":"286","article-title":"On the computational complexity of upward and rectilinear planarity testing","volume":"894","author":"Garg","year":"1994"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB13","series-title":"Proc. 33rd Annu. IEEE Symp. on Found. of Comp. Science","first-page":"101","article-title":"Drawing planar graphs using the lmc-ordering","author":"Kant","year":"1992"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB14","series-title":"Proc. 22nd Annu. IEEE Symp. on Found. of Comp. Science","first-page":"1","article-title":"New lower bound techniques for VLSI","author":"Leighton","year":"1981"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB15","series-title":"Proc. 21st Annu. IEEE Symp. on Found. of Comp. Science","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB16","series-title":"Proc. DIMACS Workshop GD '94","first-page":"40","article-title":"Improved algorithms and bounds for orthogonal drawings","volume":"894","author":"Papakostas","year":"1994"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB17","series-title":"Proc. of Workshop GD '95","first-page":"419","article-title":"Issues in interactive orthogonal graph drawing","volume":"1027","author":"Papakostas","year":"1995"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0166-218X(94)00020-E","article-title":"Drawing graphs on rectangular grids","volume":"63","author":"Sch\u00e4ffter","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(97)00017-5_BIB19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","article-title":"On minimal node-cost planar embeddings","volume":"14","author":"Storer","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB20","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","article-title":"On embedding a graph in the grid with the minimum number of bends","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(97)00017-5_BIB21","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","article-title":"Planar grid embeddings in linear time","volume":"36","author":"Tamassia","year":"1989","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/S0925-7721(97)00017-5_BIB22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(91)90059-Q","article-title":"Lower bounds for planar orthogonal drawings of graphs","volume":"39","author":"Tamassia","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0925-7721(97)00017-5_BIB23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:25:09Z","timestamp":1556385909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0925772197000175"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00017-5","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}