{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:46Z","timestamp":1725525346867},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_30","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"345-356","source":"Crossref","is-referenced-by-count":1,"title":["Spherical-Rectangular Drawings"],"prefix":"10.1007","author":[{"given":"Mahdieh","family":"Hasheminezhad","sequence":"first","affiliation":[]},{"given":"S. Mehdi","family":"Hashemi","sequence":"additional","affiliation":[]},{"given":"Brendan D.","family":"McKay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"5","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tammasia, R.: On-line planarity testing. SIAM Journal on Computing\u00a05, 956\u2013997 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR2","unstructured":"Hasheminezhad, M., Hashemi, M.S., Tahmasbi, M.: Ortho-radial drawings of graphs. Australasian Journal Combinatorics (to appear)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-39890-5_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L. Kowalik","year":"2003","unstructured":"Kowalik, L.: Short cycles in planar graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 284\u2013296. Springer, Heidelberg (2003)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1142\/S0218195906002026","volume":"16","author":"K. Miura","year":"2006","unstructured":"Miura, K., Haga, H., Nishizeki, T.: Inner rectangular drawings of plane graphs. International Journal of Computational Geometry and Applications\u00a016, 249\u2013270 (2006)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0925-7721(98)00003-0","volume":"10","author":"M.S. Rahman","year":"1998","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: Rectangular grid drawing of plane graphs. Computational Geometry\u00a010, 203\u2013220 (1998)","journal-title":"Computational Geometry"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0925-7721(01)00061-X","volume":"21","author":"M.S. Rahman","year":"2002","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: Rectangular drawings of plane graphs without designated corners. Computational Geometry\u00a021, 121\u2013138 (2002)","journal-title":"Computational Geometry"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/S0196-6774(03)00126-3","volume":"50","author":"M.S. Rahman","year":"2004","unstructured":"Rahman, M.S., Nishizeki, T., Ghosh, S.: Rectangular drawings of planar graphs. Journal of Algorithms\u00a050, 62\u201378 (2004)","journal-title":"Journal of Algorithms"},{"key":"30_CR8","unstructured":"Thomassen, C.: Plane representations of graphs. Progress in Graph Theory, 43\u201369 (1984)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-540-45078-8_43","volume-title":"Algorithms and Data Structures","author":"H. Zhang","year":"2003","unstructured":"Zhang, H., He, X.: Compact visibility representation and straight-line grid embedding of plane graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 493\u2013504. Springer, Heidelberg (2003)"}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T07:52:39Z","timestamp":1551772359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}