{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:20Z","timestamp":1725544640180},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11672142_29","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"361-371","source":"Crossref","is-referenced-by-count":8,"title":["Fast FPT-Algorithms for Cleaning Grids"],"prefix":"10.1007","author":[{"given":"Josep","family":"D\u00edaz","sequence":"first","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"29_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-Coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"29_CR2","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":"29_CR3","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.: Tractability of parameterized completion problems on chordal, strongly chordal and proper interval graphs. SIAM Journal of Computing\u00a028, 1906\u20131922 (1999)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J. Lewis","year":"1980","unstructured":"Lewis, J., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-Complete. Journal Comput. and Systems Sci.\u00a020(2), 219\u2013230 (1980)","journal-title":"Journal Comput. and Systems Sci."},{"issue":"4","key":"29_CR5","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(4), 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"key":"29_CR6","first-page":"239","volume":"25","author":"B. Monien","year":"1985","unstructured":"Monien, B.: How to find paths efficiently. Annals of Discrete Mathematics\u00a025, 239\u2013254 (1985)","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics\u00a0113(1), 109\u2013128 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"29_CR8","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1109\/43.238612","volume":"12","author":"S.D. Rao","year":"1993","unstructured":"Rao, S.D., Kurdahi, F.J.: On clustering for maximal regularity extraction. IEEE transactions on Computer-aided Design of Integrated Circuits and Systems\u00a012(8), 1198\u20131208 (1993)","journal-title":"IEEE transactions on Computer-aided Design of Integrated Circuits and Systems"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A. Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hankok, E.: Graph edit-distance from spectral seriation. IEEE Transactions on Pattern analysis and Machine Intelligence\u00a027, 365\u2013378 (2005)","journal-title":"IEEE Transactions on Pattern analysis and Machine Intelligence"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node and edge deletion NP-complete problems. In: ACM Symposium on Theory of Computing (STOC), pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Sasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:36:52Z","timestamp":1552361812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11672142_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}