{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:51Z","timestamp":1725740511292},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_31","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"353-364","source":"Crossref","is-referenced-by-count":2,"title":["Planar Packing of Binary Trees"],"prefix":"10.1007","author":[{"given":"Markus","family":"Geyer","sequence":"first","affiliation":[]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Kusters","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(90)90382-R","volume":"85","author":"J. Akiyama","year":"1990","unstructured":"Akiyama, J., Chv\u00e1tal, V.: Packing paths perfectly. Discrete Mathematics\u00a085(3), 247\u2013255 (1990)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"31_CR2","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."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Caro, Y., Yuster, R.: Packing graphs: The packing problem solved. Electr. J. Comb.\u00a04(1) (1997)","DOI":"10.37236\/1286"},{"issue":"4","key":"31_CR4","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":"31_CR5","doi-asserted-by":"publisher","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"},{"issue":"2","key":"31_CR6","first-page":"201","volume":"70","author":"A. Frank","year":"1995","unstructured":"Frank, A., Szigeti, Z.: A note on packing paths in planar graphs. Math. Program.\u00a070(2), 201\u2013209 (1995)","journal-title":"Math. Program."},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-70904-6_12","volume-title":"Graph Drawing","author":"F. Frati","year":"2007","unstructured":"Frati, F.: Embedding graphs simultaneously with fixed edges. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 108\u2013113. Springer, Heidelberg (2007)"},{"key":"31_CR8","unstructured":"Frati, F.: Planar packing of diameter-four trees. In: 21st Canadian Conference on Computational Geometry (CCCG 2009), pp. 95\u201398 (2009)"},{"issue":"6","key":"31_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ipl.2008.11.002","volume":"109","author":"F. Frati","year":"2009","unstructured":"Frati, F., Geyer, M., Kaufmann, M.: Planar packings of trees and spider trees. Information Processing Letters\u00a0109(6), 301\u2013307 (2009)","journal-title":"Information Processing Letters"},{"key":"31_CR10","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":"31_CR11","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.\u00a0R. Garey and D.\u00a0S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979."},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11618058_19","volume-title":"Graph Drawing","author":"M. Geyer","year":"2006","unstructured":"Geyer, M., Kaufmann, M., Vrt\u2019o, I.: Two trees which are self\u2013intersecting when drawn simultaneously. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 201\u2013210. Springer, Heidelberg (2006)"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D.: Edge partition of planar graphs into two outerplanar graphs. In: Proc. 37th Annu. ACM Sympos. Theory Comput., pp. 504\u2013512 (2005)","DOI":"10.1145\/1060590.1060666"},{"key":"31_CR14","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":"31_CR15","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":"31_CR16","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":"31_CR17","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"s1-36","author":"C.S.J.A. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge-Disjoint Spanning Trees of Finite Graphs. Journal of the London Mathematical Society-second Series\u00a0s1-36, 445\u2013450 (1961)","journal-title":"Journal of the London Mathematical Society-second Series"},{"key":"31_CR18","unstructured":"Oda, Y., Ota, K.: Tight planar packings of two trees. In: European Workshop on Computational Geometry, pp. 215\u2013216 (2006)"},{"key":"31_CR19","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":"31_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"s1-36","author":"W.T. Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. Journal of the London Mathematical Society\u00a0s1-36(1), 221\u2013230 (1961)","journal-title":"Journal of the London Mathematical Society"},{"issue":"1","key":"31_CR21","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","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T07:15:48Z","timestamp":1596093348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}