{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:48Z","timestamp":1725559128566},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_35","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T14:15:37Z","timestamp":1279030537000},"page":"389-401","source":"Crossref","is-referenced-by-count":9,"title":["Error Compensation in Leaf Root Problems"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"H\u00fcffner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","first-page":"238","volume-title":"Proc. 43rd FOCS","author":"N. Bansal","year":"2002","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. In: Proc. 43rd FOCS, pp. 238\u2013247. IEEE Computer Society, Los Alamitos (2002)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. In: SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters\u00a058, 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"issue":"4","key":"35_CR4","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 Journal on Computing\u00a032(4), 864\u2013879 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09, 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-540-45078-8_44","volume-title":"Algorithms and Data Structures","author":"M.R. Fellows","year":"2003","unstructured":"Fellows, M.R.: New directions and new challenges in algorithm design and complexity, parameterized. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 505\u2013519. Springer, Heidelberg (2003)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-44849-7_17","volume-title":"Algorithms and Complexity","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol.\u00a02653, pp. 108\u2013119. Springer, Heidelberg (2003)"},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J. Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica\u00a039(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"35_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR10","volume-title":"Manuscript","author":"T. Jiang","year":"2000","unstructured":"Jiang, T., Lin, G., Xu, J.: On the closest tree kth root problem. In: Manuscript, Department of Computer Science, University of Waterloo (2000)"},{"issue":"5","key":"35_CR11","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM Journal on Computing\u00a028(5), 1906\u20131922 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"35_CR12","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. Journal of Algorithms\u00a029(1), 111\u2013131 (1998)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"35_CR13","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 Informatica\u00a023(3), 311\u2013323 (1986)","journal-title":"Acta Informatica"},{"key":"35_CR14","unstructured":"Lau, L.C.: Bipartite roots of graphs. In: Proc. 15th ACM-SIAM SODA, pp. 952\u2013961. ACM\/SIAM (2004)"},{"issue":"1","key":"35_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/S0895480103425930","volume":"18","author":"L.C. Lau","year":"2004","unstructured":"Lau, L.C., Corneil, D.G.: Recognizing powers of proper interval, split, and chordal graphs. SIAM Journal on Discrete Mathematics\u00a018(1), 83\u2013102 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"35_CR16","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_CR17","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 Journal on Discrete Mathematics\u00a08(1), 99\u2013118 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"35_CR18","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 Applied Mathematics\u00a054(1), 81\u201388 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR19","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"},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-28629-5_4","volume-title":"Mathematical Foundations of Computer Science 2004","author":"R. Niedermeier","year":"2004","unstructured":"Niedermeier, R.: Ubiquitous parameterization \u2014 invitation to fixed-parameter algorithms. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 84\u2013103. Springer, Heidelberg (2004)"},{"issue":"1","key":"35_CR21","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. Journal of Algorithms\u00a042(1), 69\u2013108 (2002)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"35_CR22","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R. Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics\u00a0131(3), 651\u2013654 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-36379-3_33","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Shamir","year":"2002","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 379\u2013390. Springer, Heidelberg (2002)"}],"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-30551-4_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:26Z","timestamp":1605741686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}