{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:05Z","timestamp":1725525365961},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_27","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"310-321","source":"Crossref","is-referenced-by-count":0,"title":["Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Md. Rezaul","family":"Karim","sequence":"first","affiliation":[]},{"given":"Md. Jawaherul","family":"Alam","sequence":"additional","affiliation":[]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-24595-7_55","volume-title":"Graph Drawing","author":"F. Brandenburg","year":"2004","unstructured":"Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 515\u2013539. Springer, Heidelberg (2004)"},{"key":"27_CR2","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.C. Biedl","year":"2002","unstructured":"Biedl, T.C.: Drawing outerplanar graphs in O(nlogn) area. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 54\u201365. Springer, Heidelberg (2002)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11618058_9","volume-title":"Graph Drawing","author":"G. Battista Di","year":"2006","unstructured":"Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 89\u2013100. Springer, Heidelberg (2006)"},{"key":"27_CR4","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, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"27_CR5","unstructured":"Frati, F.: Straight-line drawings of outerplanar graphs in O(dnlogn) area. In: Proc. of the 19th Canadian Conference on Computational Geometry, pp. 225\u2013228 (2007)"},{"key":"27_CR6","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 drawings of outerplanar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 129\u2013134. Springer, Heidelberg (2004)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-24595-7_15","volume-title":"Graph Drawing","author":"A. Garg","year":"2004","unstructured":"Garg, A., Rusu, A.: A more practical algorithm for drawing binary trees in linear area with arbitrary aspect ratio. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 159\u2013165. Springer, Heidelberg (2004)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/APVIS.2007.329284","volume-title":"Proc. of Asia-pacific Symposium on Visualization, 2007","author":"M.R. Karim","year":"2007","unstructured":"Karim, M.R., Rahman, M.S.: Straight-line grid drawings of planar graphs with linear area. In: Proc. of Asia-pacific Symposium on Visualization, 2007, pp. 109\u2013112. IEEE, Los Alamitos (2007)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-77891-2_13","volume-title":"WALCOM: Algorithms and Computation","author":"M.R. Karim","year":"2008","unstructured":"Karim, M.R., Rahman, M.S.: Four-connected spanning subgraphs of doughnut graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol.\u00a04921, pp. 132\u2013143. Springer, Heidelberg (2008)"},{"key":"27_CR10","doi-asserted-by":"publisher","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"key":"27_CR11","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proc. of the First ACM-SIAM Symp. on Discrete Algorithms, San Francisco, pp. 138\u2013148 (1990)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T08:30:46Z","timestamp":1551774646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}