{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:33:16Z","timestamp":1766377996383},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_36","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"351-358","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A Force-Directed Algorithm that Preserves Edge Crossing Properties"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bertault","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Frayssex de","year":"1990","unstructured":"H. de Frayssex, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"36_CR2","first-page":"149","volume":"42","author":"P. D. Eades","year":"1984","unstructured":"P. D. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149\u2013160, 1984.","journal-title":"Congressus Numerantium"},{"issue":"11","key":"36_CR3","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129\u20131164, 1991.","journal-title":"Software-Practice and Experience"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7\u201315, 1989.","journal-title":"Information Processing Letters"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"G. Kant. Drawing planar graphs using the lmc-ordering. Proc. IEEE Symp. on Foundation of Computer Science, pages 101\u2013110, 1992.","DOI":"10.1109\/SFCS.1992.267814"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2635","volume":"135","author":"G. Kant","year":"1997","unstructured":"Goos Kant and Hans L. Bodlaender. Triangulating planar graphs while minimizing the maximum degree. Information and Computation, 135(1):1\u201314, 1997.","journal-title":"Information and Computation"},{"key":"36_CR7","unstructured":"P. Mutzel. A fast linear time embedding algorithm based on the Hopcropt-Tarjan planarity test. Technical report, Institut f\u00fcr Informatik, universit\u00e4t zu K\u00f6ln, 1992."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:13:49Z","timestamp":1585934029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}