{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:00:28Z","timestamp":1648936828836},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,1,22]],"date-time":"2011-01-22T00:00:00Z","timestamp":1295654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10878-011-9381-7","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T19:45:47Z","timestamp":1295639147000},"page":"99-115","source":"Crossref","is-referenced-by-count":2,"title":["Small grid drawings of planar graphs with balanced partition"],"prefix":"10.1007","volume":"24","author":[{"given":"Xiao","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Hikino","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,22]]},"reference":[{"key":"9381_CR1","series-title":"LNCS","first-page":"54","volume-title":"Proc of GD 2002","author":"T Biedl","year":"2002","unstructured":"Biedl T (2002) Drawing outer-planar graphs in o(nlog\u2009n) area. In: Goodrich MT, Kobourov SG (eds) Proc of GD 2002. LNCS, vol 2528, pp 54\u201365"},{"key":"9381_CR2","series-title":"LNCS","first-page":"280","volume-title":"Proc of GD 2009","author":"T Biedl","year":"2010","unstructured":"Biedl T (2010) On small drawings of series-parallel graphs and other subclasses of planar graphs. In: Proc of GD 2009. LNCS, vol 5849, pp 280\u2013291"},{"key":"9381_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.endm.2008.06.005","volume":"31","author":"FJ Brandenburg","year":"2008","unstructured":"Brandenburg FJ (2008) Drawing planar graphs on 8n 2\/9 area. Electron Notes Discrete Math 31:37\u201340","journal-title":"Electron Notes Discrete Math"},{"key":"9381_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M Chrobak","year":"1997","unstructured":"Chrobak M, Kant G (1997) Convex grid drawings of 3-connected planar graphs. Int J Comput Geom Appl 7:211\u2013223","journal-title":"Int J Comput Geom Appl"},{"key":"9381_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak M, Payne TH (1995) A linear-time algorithm for drawing a planar graph on a grid. Inf Process Lett 54:241\u2013246","journal-title":"Inf Process Lett"},{"key":"9381_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix H, Pach J, Pollack R (1990) How to draw a planar graph on a grid. Combinatorica 10:41\u201351","journal-title":"Combinatorica"},{"key":"9381_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00453-007-9117-3","volume":"54","author":"G Battista Di","year":"2009","unstructured":"Di Battista G, Frati F (2009) Small area drawings of outerplanar graphs. Algorithmica 54:25\u201353","journal-title":"Algorithmica"},{"key":"9381_CR8","first-page":"147","volume":"2","author":"D Dolev","year":"1984","unstructured":"Dolev D, Leighton FT, Trickey H (1984) Planar embedding of planar graphs. Adv Comput Res 2:147\u2013161","journal-title":"Adv Comput Res"},{"key":"9381_CR9","series-title":"LNCS","first-page":"159","volume-title":"Proc of WG 2008","author":"F Frati","year":"2008","unstructured":"Frati F (2008) A lower bound on the area requirements of series-parallel graphs. In: Broersma H, Erlebach T, Friedetzky T, Paulusma D (eds) Proc of WG 2008. LNCS, vol 5344, pp 159\u2013170"},{"key":"9381_CR10","series-title":"LNCS","first-page":"339","volume-title":"Proc of GD 2007","author":"F Frati","year":"2007","unstructured":"Frati F, Patrignami M (2007) A note on minimum-area straight-line drawings of planar graphs. In: Hong SH, Nishizeki T, Quan W (eds) Proc of GD 2007. LNCS, vol\u00a04875, pp 339\u2013344"},{"key":"9381_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00454-001-0004-4","volume":"26","author":"K Miura","year":"2001","unstructured":"Miura K, Nakano S, Nishizeki T (2001) Grid drawings of 4-connected plane graphs. Discrete Comput Geom 26:73\u201387","journal-title":"Discrete Comput Geom"},{"key":"9381_CR12","volume-title":"Planar graphs: theory and algorithms","author":"T Nishizeki","year":"2008","unstructured":"Nishizeki T, Chiba N (2008) Planar graphs: theory and algorithms. Dover, New York"},{"key":"9381_CR13","doi-asserted-by":"crossref","DOI":"10.1142\/5648","volume-title":"Planar graph drawing","author":"T Nishizeki","year":"2004","unstructured":"Nishizeki T, Rahman MS (2004) Planar graph drawing. Singapore, World Scientific"},{"key":"9381_CR14","first-page":"138","volume-title":"Proc of first ACM-SIAM symposium on discrete algorithms","author":"W Schnyder","year":"1990","unstructured":"Schnyder W (1990) Embedding planar graphs on the grid. In: Proc of first ACM-SIAM symposium on discrete algorithms, pp 138\u2013148"},{"key":"9381_CR15","unstructured":"Shiloach Y (1976) Arrangements of planar graphs on the planar lattice. PhD thesis, Weizmann Institute of Science"},{"key":"9381_CR16","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K Takamizawa","year":"1982","unstructured":"Takamizawa K, Nishizeki T, Saito N (1982) Linear-time computability of combinatorial problems on series-parallel graphs. J ACM 29:623\u2013641","journal-title":"J ACM"},{"key":"9381_CR17","series-title":"LNCS","first-page":"47","volume-title":"Proc of WALCOM 2010","author":"X Zhou","year":"2010","unstructured":"Zhou X, Hikino T, Nishizeki N (2010) Grid drawings of planar graphs with balanced bipartition. In: Proc of WALCOM 2010. LNCS, vol 5942, pp 47\u201357"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9381-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9381-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9381-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:15Z","timestamp":1559276595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9381-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,22]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["9381"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9381-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,22]]}}}