{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T00:45:14Z","timestamp":1767919514300,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1007\/bf00264230","type":"journal-article","created":{"date-parts":[[2004,9,27]],"date-time":"2004-09-27T17:17:22Z","timestamp":1096305442000},"page":"187-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":68,"title":["Drawing plane graphs nicely"],"prefix":"10.1007","volume":"22","author":[{"given":"Norishige","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazunori","family":"Onoguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1985,6,1]]},"reference":[{"key":"BF00264230_CR1","unstructured":"Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear algorithm for embedding planar graphs using PQ-trees. J. Comput. Syst. Sci. (To appear)"},{"key":"BF00264230_CR2","first-page":"153","volume-title":"Progress in Graph Theory","author":"N. Chiba","year":"1984","unstructured":"Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Progress in Graph Theory (J.A. Bondy, U.S.R. Murty, eds.), pp. 153\u2013173. Toronto: Academic Press 1984"},{"key":"BF00264230_CR3","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"Fary, I.: On straight representations of planar graphs. Acta Sci. Math. Szeged 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. Szeged"},{"key":"BF00264230_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 3, 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"BF00264230_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J.E. Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21, 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"BF00264230_CR6","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Anal. 16, 2, 346\u2013358 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"BF00264230_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"3","author":"E.M. Reingold","year":"1981","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Software Eng. 3, 223\u2013228 (1981)","journal-title":"IEEE Trans. Software Eng."},{"key":"BF00264230_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF00289576","volume":"18","author":"K.J. Supowit","year":"1983","unstructured":"Supowit, K.J., Reingold, E.M.: The complexity of drawing trees nicely. Acta Inf. 18, 377\u2013392 (1983)","journal-title":"Acta Inf."},{"key":"BF00264230_CR9","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0095-8956(80)90083-0","volume":"29","author":"C. Thomassen","year":"1980","unstructured":"Thomassen, C.: Planarity and duality of finite and infinite graphs. J. Comb. Theory, Ser. B 29, 244\u2013271 (1980)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"BF00264230_CR10","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proc. Lond. Math. Soc., (3) 10, 304\u2013320 (1960)","journal-title":"Proc. Lond. Math. Soc."},{"key":"BF00264230_CR11","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 13, 743\u2013768 (1963)","journal-title":"Proc. Lond. Math. Soc."},{"key":"BF00264230_CR12","doi-asserted-by":"publisher","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, Pract. Exper. 10, 553\u2013561 (1980)","journal-title":"Software, Pract. Exper."},{"key":"BF00264230_CR13","first-page":"514","volume":"5","author":"C. Wetherell","year":"1970","unstructured":"Wetherell, C., Shannon, A.: Tidy drawings of trees. IEEE Trans. Software Eng. 5, 514\u2013520 (1970)","journal-title":"IEEE Trans. Software Eng."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264230.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF00264230\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264230.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T08:06:32Z","timestamp":1681200392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF00264230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["BF00264230"],"URL":"https:\/\/doi.org\/10.1007\/bf00264230","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]},"assertion":[{"value":"27 September 1984","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 1985","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}