{"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":1781804252817,"version":"3.54.5"},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":5645,"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,2]]},"DOI":"10.1016\/s0925-7721(97)00026-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T15:57:07Z","timestamp":1051113427000},"page":"159-180","source":"Crossref","is-referenced-by-count":116,"title":["A better heuristic for orthogonal graph drawings"],"prefix":"10.1016","volume":"9","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Goos","family":"Kant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00026-6_BIB1","series-title":"Proc. Graph Drawing '95","first-page":"28","article-title":"New lower bounds for orthogonal graph drawing","volume":"1027","author":"Biedl","year":"1996"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB2","series-title":"Proc. Scandinavian Workshop on Algorithm Theory","first-page":"333","article-title":"Optimal orthogonal drawings of triconnected plane graphs","volume":"1097","author":"Biedl","year":"1996"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB3","series-title":"Proc. 8th Canadian Conference on Computational Geometry","first-page":"295","article-title":"Improved orthogonal drawings of 3-graphs","author":"Biedl","year":"1996"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB4","series-title":"Proc. 8th Canadian Conference on Computational Geometry","first-page":"306","article-title":"Optimal orthogonal drawings of connected plane graphs","author":"Biedl","year":"1996"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB5","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","article-title":"A linear algorithm for embedding planar graphs using PQ-trees","volume":"30","author":"Chiba","year":"1985","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"10.1016\/S0925-7721(97)00026-6_BIB6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for automatic graph drawing: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"5\u20136","key":"10.1016\/S0925-7721(97)00026-6_BIB7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","article-title":"An experimental comparison of four graph drawing algorithms","volume":"7","author":"Di Battista","year":"1997","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB8","series-title":"Proc. 19th Annual 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)00026-6_BIB9","series-title":"Rectilinear planar drawings with few bends in each edge","author":"Even","year":"1993"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB10","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/0304-3975(76)90086-4","article-title":"Computing an st-numbering","volume":"2","author":"Even","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0925-7721(97)00026-6_BIB11","series-title":"Graph-Theoretic Concepts in Comp. Science (16th Workshop WG '90)","first-page":"130","article-title":"The VLSI layout problem in various embedding models","author":"Formann","year":"1992"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB12","series-title":"Proc. Graph Drawing '95","first-page":"254","article-title":"Drawing high degree graphs with low bend numbers","volume":"1027","author":"F\u00f6\u00dfmeier","year":"1996"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB13","series-title":"Proc. Graph Drawing '94","first-page":"286","article-title":"On the computational complexity of upward and rectilinear planarity testing","volume":"894","author":"Garg","year":"1995"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB14","series-title":"Proc. Graph Drawing '96","first-page":"201","article-title":"A new minimum cost flow algorithm with applications to graph drawing","volume":"1190","author":"Garg","year":"1997"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BF02086606","article-title":"Drawing planar graphs using the canonical ordering","volume":"16","author":"Kant","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB16","first-page":"129","article-title":"The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits","author":"Kramer","year":"1984"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB17","series-title":"Theory of Graphs, Internat. Symp. Rome","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1966"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB18","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02006104","article-title":"General theoretical results on rectilinear embeddability of graphs","volume":"7","author":"Liu","year":"1991","journal-title":"Acta Math. Appl. Sinica"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB20","series-title":"Proc. Graph Drawing '95","first-page":"385","article-title":"Portable graph layout and editing","volume":"1024","author":"Madden","year":"1996"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB21","series-title":"Proc. Graph Drawing '96","first-page":"355","article-title":"A pairing technique for area-efficient orthogonal drawings","volume":"1190","author":"Papakostas","year":"1997"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB22","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)00026-6_BIB23","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)00026-6_BIB24","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)00026-6_BIB25","series-title":"Proc. IEEE Internat. Symp. on Circuits and Systems","first-page":"495","article-title":"Efficient embedding of planar graphs in linear time","author":"Tamassia","year":"1987"},{"key":"10.1016\/S0925-7721(97)00026-6_BIB26","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."},{"key":"10.1016\/S0925-7721(97)00026-6_BIB27","series-title":"Proc. 7th Symp. on Theory of Computing","first-page":"45","article-title":"On non-linear lower bounds in computational complexity","author":"Valiant","year":"1975"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000266?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000266?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:25:34Z","timestamp":1555197934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0925772197000266"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00026-6","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}