{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:22Z","timestamp":1725521722939},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_37","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"402-413","source":"Crossref","is-referenced-by-count":3,"title":["Leaf Powers and Their Properties: Using the Trees"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Meister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sritharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Brandst\u00e4dt, A.: Talk at GROW workshop in Eugene, USA (October 2007)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Le, V.B.: Structure and linear time recognition of 3-leaf powers. Information Processing Letters\u00a098, 133\u2013138 (2006)","journal-title":"Information Processing Letters"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-540-74456-6_47","volume-title":"Mathematical Foundations of Computer Science 2007","author":"A. Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Wagner, P.: On (k,\u2113)-leaf powers. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 525\u2013535. Springer, Heidelberg (2007)"},{"key":"37_CR4","unstructured":"Brandst\u00e4dt, A., Wagner, P.: On k- versus (k + 1)-Leaf Powers (manuscript, 2008)"},{"issue":"6","key":"37_CR5","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ic.2005.11.006","volume":"204","author":"A. Blumensath","year":"2006","unstructured":"Blumensath, A., Courcelle, B.: Recognizability, hypergraph operations, and logical types. Information and Computation\u00a0204(6), 853\u2013919 (2006)","journal-title":"Information and Computation"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second order theory of graphs I: recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"issue":"2","key":"37_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"37_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"37_CR9","unstructured":"Fellows, M., Meister, D., Rosamond, F., Sritharan, R., Telle, J.A.: On graphs that are k-leaf powers (manuscript, 2007)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-74839-7_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Gurski","year":"2007","unstructured":"Gurski, F., Wanke, E.: The Clique-Width of Tree-Power and Leaf-Power Graphs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 76\u201385. Springer, Heidelberg (2007)"},{"issue":"1","key":"37_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jagm.1998.9999","volume":"29","author":"P. Kearney","year":"1998","unstructured":"Kearney, P., Corneil, D.: Tree Powers. Journal of Algorithms\u00a029(1), 111\u2013131 (1998)","journal-title":"Journal of Algorithms"},{"key":"37_CR12","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1093\/oso\/9780198537359.003.0006","volume-title":"Handbook of Logic in Computer Science","author":"J.A. Makowsky","year":"1992","unstructured":"Makowsky, J.A.: Model theory and computer science: an appetizer. In: Handbook of Logic in Computer Science, vol.\u00a01, pp. 763\u2013814. Oxford University Press, New York (1992)"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1195","volume":"42","author":"N. Nishimura","year":"2002","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: On graph powers of leaf-labeled trees. Journal of Algorithms\u00a042, 69\u2013108 (2002)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"37_CR14","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B\u00a096(4), 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T21:25:03Z","timestamp":1709760303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}