{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:11Z","timestamp":1725489251623},"publisher-location":"Berlin, Heidelberg","reference-count":5,"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_43","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"416-417","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations"],"prefix":"10.1007","author":[{"given":"Ho-Lin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"43_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-58950-3_395","volume-title":"Graph Drawing\u201994","author":"F. Brandenburg","year":"1994","unstructured":"F. Brandenburg, Designing Graph Drawings by Layout Graph Grammars, Graph Drawing\u201994, LNCS 894, pp. 416\u2013427, 1994."},{"key":"43_CR2","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999."},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S0218195996000101","volume":"6","author":"P. Eades","year":"1996","unstructured":"P. Eades, X. Lin, and R. Tamassia, An Algorithm for Drawing a Hierarchical Graph, Internat. J. Comput. Geom. Appl., Vol. 6, pp. 145\u2013156, 1996.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0196-6774(87)90042-3","volume":"8","author":"T. Lengauer","year":"1987","unstructured":"T. Lengauer, Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs, J. Algorithms, Vol. 8, pp. 260\u2013284, 1987.","journal-title":"J. Algorithms"},{"issue":"3","key":"43_CR5","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1145\/65950.65952","volume":"36","author":"T. Lengauer","year":"1989","unstructured":"T. Lengauer, Hierarchical Planarity Testing Algorithms, J. ACM, Vol. 36, No. 3, pp. 474\u2013509, 1989.","journal-title":"J. ACM"}],"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_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:14:15Z","timestamp":1585934055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_43","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"}]}}