{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T08:50:39Z","timestamp":1686214239043},"reference-count":16,"publisher":"Elsevier BV","issue":"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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)00207-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"111-115","source":"Crossref","is-referenced-by-count":4,"title":["Relating bends and size in orthogonal graph drawings"],"prefix":"10.1016","volume":"65","author":[{"given":"Therese C.","family":"Biedl","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00207-X_BIB1","series-title":"Symp. on Graph Drawing, GD 95","first-page":"28","article-title":"New lower bounds for orthogonal graph drawings","volume":"vol. 1027","author":"Biedl","year":"1996"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB2","series-title":"Proc. 8th Canadian Conf. on Computational Geometry","first-page":"306","article-title":"Optimal orthogonal drawings of connected plane graphs","volume":"vol. 5","author":"Biedl","year":"1996"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB3","series-title":"Proc. 5th Scandinavian Workshop on Algorithms Theory","first-page":"333","article-title":"Optimal orthogonal drawings of triconnected plane graphs","volume":"vol. 1095","author":"Biedl","year":"1996"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB4","article-title":"Orthogonal graph drawing: Algorithms and lower bounds","author":"Biedl","year":"1996"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB5_1","series-title":"Proc. 2nd European Symp. on Algorithms","first-page":"124","article-title":"A better heuristic for orthogonal graph drawings","volume":"vol. 855","author":"Biedl","year":"1994"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB5_2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"Biedl","year":"1998","journal-title":"Comp. Geom. Theory Appl."},{"key":"10.1016\/S0020-0190(97)00207-X_BIB6","series-title":"Proc. 5th European Symp. on Algorithms","first-page":"37","article-title":"Area-efficient static and incremental graph drawings","volume":"vol. 1284","author":"Biedl","year":"1997"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB7","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":"Comp. Geom. Theory Appl."},{"issue":"5","key":"10.1016\/S0020-0190(97)00207-X_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"An experimental comparison of four graph drawing algorithms","volume":"7","author":"Di Battista","year":"1997","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0020-0190(97)00207-X_BIB9","series-title":"Graph-Theoretic Concepts in Computer Science: Proc. Internat. Workshop WG","first-page":"130","article-title":"The VLSI layout problem in various embedding models","volume":"vol. 484","author":"Formann","year":"1991"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB10","series-title":"Proc. Symp. on Graph Drawing 95","first-page":"254","article-title":"Drawing high degree graphs with low bend numbers","volume":"vol. 1027","author":"F\u00f6\u00dfmeier","year":"1996"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB11","series-title":"Proc. DIMACS Internat. Workshop, Graph Drawing 94","first-page":"286","article-title":"On the computational complexity of upward and rectilinear planarity testing","volume":"vol. 894","author":"Garg","year":"1995"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB12","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\/S0020-0190(97)00207-X_BIB13","series-title":"Advances in Computing Research","first-page":"129","article-title":"The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits","volume":"vol. 2","author":"Kramer","year":"1984"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB14","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/S0020-0190(97)00207-X_BIB15","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."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700207X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700207X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T11:14:34Z","timestamp":1578482074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909700207X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S002001909700207X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00207-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}