{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T05:28:14Z","timestamp":1771738094735,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":[[2000,4]]},"DOI":"10.1016\/s0020-0190(00)00042-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:22:57Z","timestamp":1027650177000},"page":"7-13","source":"Crossref","is-referenced-by-count":25,"title":["A force-directed algorithm that preserves edge-crossing properties"],"prefix":"10.1016","volume":"74","author":[{"given":"Fran\u00e7ois","family":"Bertault","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00042-9_ID003","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","article-title":"How to draw a planar graph on a grid","volume":"Vol. 10","author":"de Fraysseix","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(00)00042-9_ID004","series-title":"Graph Drawing","author":"Di Battista","year":"1999"},{"key":"10.1016\/S0020-0190(00)00042-9_ID005","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","article-title":"Layout adjustment and the mental map","volume":"Vol. 6","author":"Eades","year":"1995","journal-title":"J. Visual Languages Comput."},{"key":"10.1016\/S0020-0190(00)00042-9_ID006","first-page":"149","article-title":"A heuristic for graph drawing","volume":"Vol. 42","author":"Eades","year":"1984","journal-title":"Congr. Numer."},{"issue":"11","key":"10.1016\/S0020-0190(00)00042-9_ID007","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","article-title":"Graph drawing by force-directed placement","volume":"Vol. 21","author":"Fruchterman","year":"1991","journal-title":"Software-Practice Exper."},{"key":"10.1016\/S0020-0190(00)00042-9_ID008","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","article-title":"An algorithm for drawing general undirected graphs","volume":"Vol. 31","author":"Kamada","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00042-9_ID009","series-title":"Proc. IEEE Symp. on Foundation of Computer Science","first-page":"101","article-title":"Drawing planar graphs using the lmc-ordering","author":"Kant","year":"1992"},{"issue":"1","key":"10.1016\/S0020-0190(00)00042-9_ID010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1997.2635","article-title":"Triangulating planar graphs while minimizing the maximum degree","volume":"Vol. 135","author":"Kant","year":"1997","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(00)00042-9_ID011","series-title":"A fast linear time embedding algorithm based on the Hopcropt\u2013Tarjan planarity test","author":"Mutzel","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000429?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000429?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T17:50:52Z","timestamp":1555264252000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0020019000000429"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00042-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}