{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:27:00Z","timestamp":1726406820388},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_9","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"89-100","source":"Crossref","is-referenced-by-count":7,"title":["Small Area Drawings of Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36151-0_6","volume-title":"Graph Drawing","author":"T. Biedl","year":"2002","unstructured":"Biedl, T.: Drawing outer-planar graphs in O(n logn) area. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 54\u201365. Springer, Heidelberg (2002)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-63938-1_47","volume-title":"Graph Drawing","author":"P. Bose","year":"1997","unstructured":"Bose, P.: On embedding an outer-planar graph in a point set. In: Di Battista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 25\u201336. Springer, Heidelberg (1997)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: A near-linear area bound for drawing binary trees. Algorithmica\u00a034(1) (2002)","DOI":"10.1007\/s00453-002-0937-x"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M. Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. IPL\u00a054(4), 241\u2013246 (1995)","journal-title":"IPL"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"9_CR6","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)"},{"issue":"4","key":"9_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S. Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.K.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl.\u00a07(4), 363\u2013398 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-36151-0_30","volume-title":"Graph Drawing","author":"A. Garg","year":"2002","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of binary trees with linear area and arbitrary aspect ratio. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 320\u2013331. Springer, Heidelberg (2002)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-24595-7_12","volume-title":"Graph Drawing","author":"A. Garg","year":"2004","unstructured":"Garg, A., Rusu, A.: Area-efficient planar straight-line grid drawings of outerplanar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 129\u2013134. Springer, Heidelberg (2004)"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. Amer. Math. Monthly\u00a098(2), 165\u2013166 (1991)","journal-title":"Amer. Math. Monthly"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci., pp. 270\u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895480193242931","volume":"7","author":"S. Malitz","year":"1994","unstructured":"Malitz, S., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete Math.\u00a07, 172\u2013183 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"9_CR13","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discr. Alg., pp. 138\u2013148 (1990)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T06:11:06Z","timestamp":1586671866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11618058_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}