{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:52Z","timestamp":1725552172115},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_35","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"397-408","source":"Crossref","is-referenced-by-count":14,"title":["Extending the Tractability Border for Closest Leaf Powers"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dom","sequence":"first","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Falk","family":"H\u00fcffner","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","first-page":"524","volume-title":"Proc. 44th FOCS","author":"M. Charikar","year":"2003","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. In: Proc. 44th FOCS, pp. 524\u2013533. IEEE Computer Society, Los Alamitos (2003); To appear in J. Comput. System Sci."},{"issue":"4","key":"35_CR2","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539701389154","volume":"32","author":"Z.-Z. Chen","year":"2003","unstructured":"Chen, Z.-Z., Jiang, T., Lin, G.: Computing phylogenetic roots with bounded degrees and errors. SIAM J. Comput.\u00a032(4), 864\u2013879 (2003)","journal-title":"SIAM J. Comput."},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 389\u2013401. Springer, Heidelberg (2004)"},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","volume":"9","author":"P. Erd\u0151s","year":"1962","unstructured":"Erd\u0151s, P., P\u00f3sa, L.: On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen\u00a09, 3\u201312 (1962)","journal-title":"Publ. Math. Debrecen"},{"key":"35_CR5","unstructured":"Jiang, T., Lin, G., Xu, J.: On the closest tree kth root problem. Manuscript, Department of Computer Science, University of Waterloo (2000)"},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jagm.1998.9999","volume":"29","author":"P.E. Kearney","year":"1998","unstructured":"Kearney, P.E., Corneil, D.G.: Tree powers. J. Algorithms\u00a029(1), 111\u2013131 (1998)","journal-title":"J. Algorithms"},{"issue":"3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M. K\u0159iv\u00e1nek","year":"1986","unstructured":"K\u0159iv\u00e1nek, M., Mor\u00e1vek, J.: NP-hard problems in hierarchical-tree clustering. Acta Inform.\u00a023(3), 311\u2013323 (1986)","journal-title":"Acta Inform."},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-40996-3_46","volume-title":"Algorithms and Computation","author":"G. Lin","year":"2000","unstructured":"Lin, G., Kearney, P.E., Jiang, T.: Phylogenetic k-root and Steiner k-root. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 539\u2013551. Springer, Heidelberg (2000)"},{"issue":"1","key":"35_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"Y.-L. Lin","year":"1995","unstructured":"Lin, Y.-L., Skiena, S.S.: Algorithms for square roots of graphs. SIAM J. Discrete Math.\u00a08(1), 99\u2013118 (1995)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"35_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0166-218X(94)00023-9","volume":"54","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Sudan, M.: Computing roots of graphs is hard. Discrete Appl. Math.\u00a054(1), 81\u201388 (1994)","journal-title":"Discrete Appl. Math."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Natanzon, A.: Complexity and approximation of some graph modification problems. Master\u2019s thesis, Department of Computer Science, Tel Aviv University (1999)","DOI":"10.1007\/3-540-46784-X_8"},{"issue":"1","key":"35_CR12","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(1), 69\u2013108 (2002)","journal-title":"J. Algorithms"},{"key":"35_CR13","unstructured":"Rautenbach, D.: 4-leafroots. Manuscript, Forschungsinstitut f\u00fcr Diskrete Mathematik, Universit\u00e4t Bonn (June 2004)"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R. Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math.\u00a0144, 173\u2013182 (2004)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T19:08:55Z","timestamp":1683313735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11604686_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}