{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:47:26Z","timestamp":1742381246189},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_32","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:14:14Z","timestamp":1195215254000},"page":"344-353","source":"Crossref","is-referenced-by-count":27,"title":["Improving Walker\u2019s Algorithm to Run in Linear Time"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Leipert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"C. Buchheim, M. J\u00fcnger, and S. Leipert. Improving Walker\u2019s algorithm to run in linear time. Technical Report zaik2002-431, ZAIK, Universit\u00e4t zu K\u00f6ln, 2002.","DOI":"10.1007\/3-540-36151-0_32"},{"issue":"2","key":"32_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E. Reingold","year":"1981","unstructured":"E. Reingold and J. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, 7(2):223\u2013228, 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"32_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BFb0040379","volume-title":"On finding lowest common ancestors: Simplification and parallelization","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. In Proceedings of the Third Aegean Workshop on Computing, volume 319 of Lecture Notes in Computer Science, pages 111\u2013123, 1988."},{"issue":"4","key":"32_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF00289576","volume":"18","author":"K. Supowit","year":"1983","unstructured":"K. Supowit and E. Reingold. The complexity of drawing trees nicely. Acta Informatica, 18(4):377\u2013392, 1983.","journal-title":"Acta Informatica"},{"issue":"7","key":"32_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"J. Walker II","year":"1990","unstructured":"J. Walker II. A node-positioning algorithm for general trees. Software-Practice and Experience, 20(7):685\u2013705, 1990.","journal-title":"Software-Practice and Experience"},{"issue":"5","key":"32_CR6","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/TSE.1979.234212","volume":"5","author":"C. Wetherell","year":"1979","unstructured":"C. Wetherell and A. Shannon. Tidy drawings of trees. IEEE Transactions on Software Engineering, 5(5):514\u2013520, 1979.","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:31:56Z","timestamp":1556969516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}