{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:48:38Z","timestamp":1752461318955},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1007\/bf00289576","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T04:07:59Z","timestamp":1096949279000},"page":"377-392","source":"Crossref","is-referenced-by-count":59,"title":["The complexity of drawing trees nicely"],"prefix":"10.1007","volume":"18","author":[{"given":"Kenneth J.","family":"Supowit","sequence":"first","affiliation":[]},{"given":"Edward M.","family":"Reingold","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/S0002-9939-1976-0396605-3","volume":"55","author":"I. Borosh","year":"1976","unstructured":"Borosh, I., Treybig, L.B.: Bounds on Positive Integral Solutions of Linear Diophantine Equations. Proc. Amer. Math. Soc. 55, 299?304 (1976)","journal-title":"Proc. Amer. Math. Soc."},{"key":"CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979"},{"key":"CR3","first-page":"191","volume":"244","author":"L.G. Khachian","year":"1979","unstructured":"Khachian, L.G.: A Polynomial Algorithm for Linear Programming. Doklady Akad. Nauk SSSR 244, 191?194 (1979)","journal-title":"Doklady Akad. Nauk SSSR"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/359423.359434","volume":"20","author":"G.D. Knott","year":"1977","unstructured":"Knott, G.D.: A Numbering System for Binary Trees. Comm. ACM 20, 113?115 (1977)","journal-title":"Comm. ACM"},{"key":"CR5","volume-title":"The Art of Computer Programming, Vol.1: Fundamental Algorithms","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol.1: Fundamental Algorithms. Addison-Wesley Publishing Co., Reading, MA, 1968"},{"key":"CR6","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"E.M. Reingold","year":"1977","unstructured":"Reingold, E.M., Nievergelt, J., Deo, N.: Combinatorial Algorithms: Theory and Practice. Prentice-Hall: Englewood Cliffs, New Jersey, 1977"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E.M. Reingold","year":"1981","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier Drawings of Trees. IEEE Trans. Software Engineerg. 7 223?228 (1981)","journal-title":"IEEE Trans. Software Engineerg."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete Approximation Problems. J. ACM 23, 555?565 (1976)","journal-title":"J. ACM"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1002\/spe.4380100706","volume":"10","author":"J.G. Vaucher","year":"1980","unstructured":"Vaucher, J.G.: Pretty-Printing of Trees. Software-Practice and Experience 10, 553?561 (1980)","journal-title":"Software-Practice and Experience"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TSE.1979.234212","volume":"5","author":"C. Wetherell","year":"1979","unstructured":"Wetherell, C., Shannon, A.: Tidy Drawings of Trees. IEEE Trans. Software Engineerg. 5, 514?520 (1979)","journal-title":"IEEE Trans. Software Engineerg."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289576.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289576\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289576","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:57Z","timestamp":1554758097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["BF00289576"],"URL":"https:\/\/doi.org\/10.1007\/bf00289576","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}