{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:13Z","timestamp":1725544033441},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_5","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T11:03:36Z","timestamp":1265108616000},"page":"47-57","source":"Crossref","is-referenced-by-count":0,"title":["Small Grid Drawings of Planar Graphs with Balanced Bipartition"],"prefix":"10.1007","author":[{"given":"Xiao","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Hikino","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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":"5_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications\u00a07, 211\u2013223 (1997)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"5_CR3","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proc. of First ACM-SIAM Symposium on Discrete Algorithms, pp. 138\u2013148 (1990)"},{"key":"5_CR4","first-page":"147","volume":"2","author":"D. Dolev","year":"1984","unstructured":"Dolev, D., Leighton, F.T., Trickey, H.: Planar embedding of planar graphs. Advances in Computing Research\u00a02, 147\u2013161 (1984)","journal-title":"Advances in Computing Research"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-77537-9_33","volume-title":"Graph Drawing","author":"F. Frati","year":"2008","unstructured":"Frati, F., Patrignami, M.: A note on minimum-area straight-line drawings of planar graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 339\u2013344. Springer, Heidelberg (2008)"},{"key":"5_CR6","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.: Grid drawings of 4-connected plane graphs. Discrete & Computational Geometry\u00a026, 73\u201387 (2001)","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR7","unstructured":"Shiloach, Y.: Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute of Science (1976)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-007-9117-3","volume":"54","author":"G.D. Battista","year":"2009","unstructured":"Battista, G.D., Frati, F.: Small area drawings of outerplanar graphs. Algorithmica\u00a054, 25\u201353 (2009)","journal-title":"Algorithmica"},{"key":"5_CR9","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. Information Processing Letters\u00a054, 241\u2013246 (1995)","journal-title":"Information Processing Letters"},{"key":"5_CR10","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":"5_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM\u00a029, 623\u2013641 (1982)","journal-title":"J. ACM"},{"key":"5_CR12","volume-title":"Planar Graphs: Theory and Algorithms","author":"T. Nishizeki","year":"2008","unstructured":"Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. Dover Publications, New York (2008)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Biedl, T.: On small drawings of series-parallel graphs and other subclasses of planar graphs. In: Proc. of GD 2009 (to appear)","DOI":"10.1007\/978-3-642-11805-0_27"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-92248-3_15","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Frati","year":"2008","unstructured":"Frati, F.: A lower bound on the area requirements of series-parallel graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 159\u2013170. Springer, Heidelberg (2008)"},{"key":"5_CR15","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(nlogn) area. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 54\u201365. Springer, Heidelberg (2002)"}],"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-11440-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:37Z","timestamp":1606167637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}