{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:00Z","timestamp":1725516600420},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_16","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"171-179","source":"Crossref","is-referenced-by-count":3,"title":["On k- Versus (k\u2009+\u20091)-Leaf Powers"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","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":"16_CR2","unstructured":"Brandst\u00e4dt, A., Le, V.B., Rautenbach, D.: Exact leaf powers (manuscript) (submitted, 2006)"},{"key":"16_CR3","unstructured":"Brandst\u00e4dt, A., Le, V.B., Rautenbach, D.: Distance-hereditary 5-leaf powers (manuscript) (submitted, 2006)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Sritharan, R.: Structure and linear time recognition of 4-leaf powers. ACM Transactions on Algorithms (manuscript) (accepted, 2006)","DOI":"10.1016\/j.ipl.2006.01.004"},{"key":"16_CR5","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, extended abstract. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 525\u2013535. Springer, Heidelberg (2007)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0095-8956(74)90047-1","volume":"1","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A note on the metric properties of trees. J. Combin. Th.\u00a0(B) 1, 48\u201350 (1974)","journal-title":"J. Combin. Th."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Chang, M.-S., Ko, T.: The 3-Steiner Root Problem, extended abstract. In: Proceedings WG 2007. LNCS, vol.\u00a04769, pp. 109\u2013120 (2007)","DOI":"10.1007\/978-3-540-74839-7_11"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-540-30551-4_35","volume-title":"Algorithms and Computation","author":"M. Dom","year":"2004","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Error compensation in leaf root problems, extended abstract. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 389\u2013401. Springer, Heidelberg (2004); Algorithmica 44(4), 363-381 (2006)"},{"key":"16_CR9","unstructured":"Fellows, M., Meister, D., Rosamond, F., Sritharan, R., Telle, J.A.: On graphs that are k-leaf powers (manuscript, 2007)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","first-page":"539","volume-title":"Algorithms and Computation","author":"T. Jiang","year":"2000","unstructured":"Jiang, T., Kearney, P.E., Lin, G.-H.: Phylogenetic k-root and Steiner k-root, Extended abstract. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 539\u2013551. Springer, Heidelberg (2000)"},{"key":"16_CR11","unstructured":"Kennedy, W.: Strictly chordal graphs and phylogenetic roots, Master Thesis, University of Alberta (2005)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/11602613_74","volume-title":"Algorithms and Computation","author":"W. Kennedy","year":"2005","unstructured":"Kennedy, W., Lin, G.-H.: 5-th phylogenetic root construction for strictly chordal graphs, extended abstract. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 738\u2013747. Springer, Heidelberg (2005)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.jda.2005.06.005","volume":"4","author":"W. Kennedy","year":"2006","unstructured":"Kennedy, W., Lin, G.-H., Yan, G.: Strictly chordal graphs are leaf powers. J. Discrete Algorithms\u00a04, 511\u2013525 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"16_CR14","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 for leaf-labeled trees. J. Algorithms\u00a042, 69\u2013108 (2002)","journal-title":"J. Algorithms"},{"issue":"13","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.disc.2006.03.030","volume":"306","author":"D. Rautenbach","year":"2006","unstructured":"Rautenbach, D.: Some remarks about leaf roots. Discrete Math.\u00a0306(13), 1456\u20131461 (2006)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T17:05:52Z","timestamp":1684515952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}