{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:30Z","timestamp":1725558930341},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140549"},{"type":"electronic","value":"9783642140556"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14055-6_37","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T14:44:24Z","timestamp":1277822664000},"page":"356-364","source":"Crossref","is-referenced-by-count":1,"title":["Rank Correlation Coefficient Correction by Removing Worst Cases"],"prefix":"10.1007","author":[{"given":"Martin","family":"Krone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Klawonn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-61680-2_54","volume-title":"Algorithms - ESA \u201996","author":"T. Fujito","year":"1996","unstructured":"Fujito, T.: A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract). In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 167\u2013178. Springer, Heidelberg (1996)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"M.G. Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika\u00a030, 81\u201393 (1938)","journal-title":"Biometrika"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proc. Am. Math. Soc.\u00a07, 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"37_CR4","first-page":"253","volume-title":"10th Annual ACM Symposium on Theory of Computing","author":"M. Yannakakis","year":"1978","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: 10th Annual ACM Symposium on Theory of Computing, pp. 253\u2013264. ACM, New York (1978)"}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14055-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:44:36Z","timestamp":1552625076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14055-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140549","9783642140556"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14055-6_37","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}