{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:12:06Z","timestamp":1725577926276},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_20","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"220-225","source":"Crossref","is-referenced-by-count":1,"title":["Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Frati","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0218195994000215","volume":"4","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Cohen, R.F., di Battista, G., Tamassia, R., Tollis, I.G.: How to draw a series-parallel digraph. International Journal of Computational Geometry & Applications\u00a04(4), 385\u2013402 (1994)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"20_CR2","unstructured":"Biedl, T.C.: Small poly-line drawings of series-parallel graphs. Tech. Report CS-2007-23, School of Computer Science, University of Waterloo, Canada (2005)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-11805-0_27","volume-title":"Graph Drawing","author":"T.C. Biedl","year":"2010","unstructured":"Biedl, T.C.: On small drawings of series-parallel graphs and other subclasses of planar graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 280\u2013291. Springer, Heidelberg (2010)"},{"issue":"6","key":"20_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0020-0190(02)00433-7","volume":"85","author":"T.C. Biedl","year":"2003","unstructured":"Biedl, T.C., Chan, T.M., L\u00f3pez-Ortiz, A.: Drawing K\n                  2,n\n                  : A lower bound. Information Processing Letters\u00a085(6), 303\u2013305 (2003)","journal-title":"Information Processing Letters"},{"issue":"1","key":"20_CR5","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(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-005-1185-7","volume":"45","author":"E. Di Giacomo","year":"2006","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica\u00a045(4), 531\u2013547 (2006)","journal-title":"Algorithmica"},{"key":"20_CR7","first-page":"147","volume":"2","author":"D. Dolev","year":"1984","unstructured":"Dolev, D., Leighton, T., Trickey, H.: Planar embeddings of planar graphs. Advances in Computing Research\u00a02, 147\u2013161 (1984)","journal-title":"Advances in Computing Research"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90041-D","volume":"98","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D.: Parallel recognition of series-parallel graphs. Information and Computation\u00a098(1), 41\u201355 (1992)","journal-title":"Information and Computation"},{"key":"20_CR9","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":"20_CR10","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM Journal on Computing\u00a011(2), 298\u2013313 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR12","unstructured":"Wood, D.R.: Private Communication (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T04:10:48Z","timestamp":1553400648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}