{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:06Z","timestamp":1725488946697},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_36","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"394-405","source":"Crossref","is-referenced-by-count":0,"title":["Packing and Squeezing Subgraphs into Planar Graphs"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Frati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Geyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"36_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Bra\u00df","year":"2007","unstructured":"Bra\u00df, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom.\u00a036(2), 117\u2013130 (2007)","journal-title":"Comput. Geom."},{"issue":"4","key":"36_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Information Processing Letters\u00a051(4), 207\u2013211 (1994)","journal-title":"Information Processing Letters"},{"issue":"3","key":"36_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms & Applications\u00a03(3), 1\u201327 (1999)","journal-title":"J. Graph Algorithms & Applications"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Frati, F.: Embedding graphs simultaneously with fixed edges. Graph Drawing, 108\u2013113 (2006)","DOI":"10.1007\/978-3-540-70904-6_12"},{"key":"36_CR5","unstructured":"Frati, F., Geyer, M., Kaufmann, M.: Packing and squeezing subgraphs into planar graphs. Tech. Report RT-DIA-114-2007, Dept. of Computer Science and Automation, University of Roma Tre (2007)"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, A., Hernando, C., Hurtado, F., Noy, M., Tejel, J.: Packing trees into planar graphs. J. Graph Theory, 172\u2013181 (2002)","DOI":"10.1002\/jgt.10042"},{"key":"36_CR7","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":"36_CR8","doi-asserted-by":"crossref","unstructured":"Geyer, M., Kaufmann, M., Vrt\u00f3, I.: Two trees which are self-intersecting when drawn simultaneously. In: Graph Drawing, pp. 201\u2013210 (2005)","DOI":"10.1007\/11618058_19"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D.: Edge partition of planar graphs into two outerplanar graphs. In: STOC, pp. 504\u2013512 (2005)","DOI":"10.1145\/1060590.1060666"},{"key":"36_CR10","first-page":"149","volume":"11","author":"S.M. Hedetniemi","year":"1981","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: A note on packing two trees into $K\\sb{N}$ . Ars Combin.\u00a011, 149\u2013153 (1981)","journal-title":"Ars Combin."},{"issue":"6","key":"36_CR11","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/eujc.1996.0047","volume":"17","author":"M. Maheo","year":"1996","unstructured":"Maheo, M., Sacl\u00e9, J.-F., Wo\u017aniak, M.: Edge-disjoint placement of three trees. European J. Combin.\u00a017(6), 543\u2013563 (1996)","journal-title":"European J. Combin."},{"issue":"1","key":"36_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P. Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: A survey. Graphs and Combinatorics\u00a014(1), 59\u201373 (1998)","journal-title":"Graphs and Combinatorics"},{"key":"36_CR13","unstructured":"Oda, Y., Ota, K.: Tight planar packings of two trees. In: European Workshop on Computational Geometry, pp. 215\u2013216 (2006)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order\u00a05, 323\u2013343 (1989)","journal-title":"Order"},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM\u00a023(1), 31\u201342 (1976)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:02Z","timestamp":1619519342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}