{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:46Z","timestamp":1761610306072,"version":"build-2065373602"},"reference-count":6,"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)80526-2","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"25-31","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["ILOG JViews Graph Layout: a Java library for highly demanding graph-based applications"],"prefix":"10.1016","volume":"72","author":[{"given":"Georg","family":"Sander","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Vasiliu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80526-2_BIB1","first-page":"149","article-title":"A heuristic for graph drawing","volume":"42","author":"Eades","year":"1984","journal-title":"Congressus Numeratium"},{"key":"10.1016\/S1571-0661(05)80526-2_BIB2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(96)80467-7","article-title":"Rectilinear paths among rectilinear obstacles","volume":"70","author":"Lee","year":"1996","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S1571-0661(05)80526-2_BIB3","first-page":"447","article-title":"A fast heuristic for hierarchical manhattan layout","author":"Sander","year":"1996","journal-title":"Proc. Symposium on Graph Drawing, LNCS 1027"},{"key":"10.1016\/S1571-0661(05)80526-2_BIB4","series-title":"Proc. Symposium on Graph Drawing, GD'2001, LNCS 2265","first-page":"438","article-title":"The ILOG J Views graph layout module","author":"Sander","year":"2002"},{"key":"10.1016\/S1571-0661(05)80526-2_BIB5","series-title":"Proc. COMES'93, Douai, France","first-page":"73","article-title":"A topological graph unfolding algorithm","author":"Vasiliu","year":"1993"},{"issue":"7","key":"10.1016\/S1571-0661(05)80526-2_BIB6","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1002\/spe.4380200705","article-title":"A node positioning algorithm for generalized trees","volume":"20","author":"Walker","year":"1990","journal-title":"Software Pract. and Exper"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105805262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105805262?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:51Z","timestamp":1761610011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105805262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S1571066105805262"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80526-2","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":"ILOG JViews Graph Layout: a Java library for highly demanding graph-based applications","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)80526-2","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"}]}}