{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:42Z","timestamp":1761610302948,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3923,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s1571-0661(05)80534-1","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"81-90","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Software System for Computing Labeled Orthogonal Drawings of Graphs"],"prefix":"10.1016","volume":"72","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80534-1_BIB1","series-title":"Symposium on Graph Drawing (GD'99), volume 1731 of LNCS","first-page":"297","article-title":"Orthogonal and quasi-upward drawings with vertices of arbitrary sizes","author":"Battista","year":"2000"},{"unstructured":"C. Binucci, W. Didimo, G. Liotta, and M. Nonato. Computing labeled orthogonal drawings. In Symposium on Graph Drawing (GD'02)., to appear.","key":"10.1016\/S1571-0661(05)80534-1_BIB2"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB3","series-title":"Proc. GD '95, volume 1027 of LNCS","first-page":"254","article-title":"Drawing high degree graphs with low bend numbers","author":"F\u00f6\u00dfmeier","year":"1996"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB4","series-title":"Duxbury Press \/ Brooks\/Cole Publishing Company","article-title":"AMPL: A modeling Language For Mathematical Programming","author":"Fourer","year":"1993"},{"unstructured":"GDToolkit. Online: Graph drawing toolkit: http:\/\/www.dia.uniroma3.it\/~gdt.","key":"10.1016\/S1571-0661(05)80534-1_BIB5"},{"unstructured":"ILOG CPLEX. http:\/\/www.ilog.com\/products\/cplex.","key":"10.1016\/S1571-0661(05)80534-1_BIB6"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB7","series-title":"Symposium on Graph Drawing (GD'96), volume 1190 of LNCS","first-page":"241","article-title":"On the edge label placement problem","author":"Kakoulis","year":"1997"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB8","series-title":"Symposium on Graph Drawing (GD'97), volume 1353 of LNCS","first-page":"169","article-title":"An algorithm for labeling edges of hierarchical drawings","author":"Kakoulis","year":"1998"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0925-7721(00)00025-0","article-title":"On the complexity of the edge label placement problem","volume":"18","author":"Kakoulis","year":"2001","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB10","series-title":"Symposium on Graph Drawing (GD'99)","first-page":"27","article-title":"Combining graph labeling and compaction","author":"Klau","year":"1999"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB11","series-title":"In Integer Programming and Combinatorial Optimization (IPCO'99), volume 1610 of LNCS","first-page":"304","article-title":"Optimal compaction of orthogonal grid drawings","author":"Klau","year":"1999"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB12","series-title":"In Proc. COCOON'OO, volume 1858 of LNCS","first-page":"340","article-title":"Optimal labelling of point features in the sliding model","author":"Klau","year":"2001"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB13","series-title":"Symposium on Graph Drawing (GD '00), volume 1984 of LNCS","first-page":"91","article-title":"Labeling points with rectangles of various shape","author":"Nakano","year":"2001"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","article-title":"On the complexity of orthogonal compaction","volume":"19","author":"Patrignani","year":"2001","journal-title":"Computational Geometry: Theory and Applications"},{"unstructured":"T. Strijk and A. Wolff. The map labeling bibliography., on-line: http:\/\/www.math-inf.uni-greifswald.de\/map-labeling\/bibliography\/.","key":"10.1016\/S1571-0661(05)80534-1_BIB15"},{"key":"10.1016\/S1571-0661(05)80534-1_BIB16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","article-title":"Automatic graph drawing and readability of diagrams","volume":"1","author":"Tamassia","year":"1988","journal-title":"IEEE Trans. Syst. Man Cybern"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105805341?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105805341?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:48Z","timestamp":1761610008000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105805341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S1571066105805341"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80534-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Software System for Computing Labeled Orthogonal Drawings of Graphs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80534-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}