{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:58:29Z","timestamp":1725893909096},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540778905"},{"type":"electronic","value":"9783540778912"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77891-2_13","type":"book-chapter","created":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T08:19:36Z","timestamp":1200125976000},"page":"132-143","source":"Crossref","is-referenced-by-count":1,"title":["Four-Connected Spanning Subgraphs of Doughnut Graphs"],"prefix":"10.1007","author":[{"given":"Md. Rezaul","family":"Karim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"13_CR2","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":"13_CR3","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"Fary, I.: On Straight line representation of planar graphs. Acta Sci. Math. Szeged\u00a011, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. Szeged"},{"key":"13_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":"13_CR5","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 Company, New York (1979)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"13_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/APVIS.2007.329284","volume-title":"Proc. of Asia-Pacific Symposium on Visualisation 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: Hong, S., Ma, K. (eds.) Proc. of Asia-Pacific Symposium on Visualisation 2007, pp. 109\u2013112. IEEE, Los Alamitos (2007)"},{"key":"13_CR9","doi-asserted-by":"crossref","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":"13_CR10","doi-asserted-by":"publisher","first-page":"464","DOI":"10.2307\/2031777","volume":"2","author":"K.S. Stein","year":"1951","unstructured":"Stein, K.S.: Convex maps. Proc. Amer Math. Soc.\u00a02, 464\u2013466 (1951)","journal-title":"Proc. Amer Math. Soc."},{"key":"13_CR11","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkugen zum veierfarben problem. Jasresber. Deutsch. Math-Verien.\u00a046, 26\u201332 (1936)","journal-title":"Jasresber. Deutsch. Math-Verien."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77891-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:04Z","timestamp":1619520904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77891-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540778905","9783540778912"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77891-2_13","relation":{},"subject":[]}}