{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:31:15Z","timestamp":1742977875734,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_41","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"524-536","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Enumeration for Modification Problems"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[]},{"given":"Ra\u00efda","family":"Ktari","sequence":"additional","affiliation":[]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[]},{"given":"Julian-Steffen","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Olive","sequence":"additional","affiliation":[]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics 65, 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR2","series-title":"Monographs on Discrete Applied Mathematics","volume-title":"Graph Classes: A Survey","author":"A Brandtst\u00e4dt","year":"1988","unstructured":"Brandtst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Monographs on Discrete Applied Mathematics. SIAM, Philadelphia (1988)"},{"issue":"4","key":"41_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 58(4), 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"issue":"6","key":"41_CR4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1051\/ita\/1997310604991","volume":"31","author":"N Creignou","year":"1997","unstructured":"Creignou, N., H\u00e9brard, J.J.: On generating all solutions of generalized satisfiability problems. Theoretical Informatics and Applications 31(6), 499\u2013511 (1997)","journal-title":"Theoretical Informatics and Applications"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-40313-2_27","volume-title":"Mathematical Foundations of Computer Science 2013","author":"N Creignou","year":"2013","unstructured":"Creignou, N., Meier, A., M\u00fcller, J.-S., Schmidt, J., Vollmer, H.: Paradigms for parameterized enumeration. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 290\u2013301. Springer, Heidelberg (2013)"},{"key":"41_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-21581-0_11","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"N Creignou","year":"2011","unstructured":"Creignou, N., Olive, F., Schmidt, J.: Enumerating all solutions of a boolean CSP by non-decreasing weight. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 120\u2013133. Springer, Heidelberg (2011)"},{"issue":"3","key":"41_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science 351(3), 337\u2013350 (2006)","journal-title":"Theoretical Computer Science"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-45655-4_60","volume-title":"Computing and Combinatorics","author":"H Fernau","year":"2002","unstructured":"Fernau, H.: On parameterized enumeration. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 564\u2013573. Springer, Heidelberg (2002)"},{"issue":"4","key":"41_CR9","doi-asserted-by":"publisher","first-page":"1964","DOI":"10.1137\/12089051X","volume":"27","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Saurabh, S., Villanger, Y.: A polynomial kernel for proper interval vertex deletion. SIAM Journal Discrete Mathematics 27(4), 1964\u20131976 (2013)","journal-title":"SIAM Journal Discrete Mathematics"},{"issue":"2","key":"41_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory of Computing Systems 30(2), 113\u2013119 (1997)","journal-title":"Theory of Computing Systems"},{"key":"41_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"41_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-30891-8_15","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"S Gaspers","year":"2012","unstructured":"Gaspers, S., Szeider, S.: Backdoors to Satisfaction. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) Fellows Festschrift 2012. LNCS, vol. 7370, pp. 287\u2013317. Springer, Heidelberg (2012). http:\/\/dx.doi.org\/10.1007\/978-3-642-30891-8_15"},{"issue":"1","key":"41_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for CLOSEST STRING and related problems. Algorithmica 37(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"3","key":"41_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters 27(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"issue":"5","key":"41_CR15","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 28(5), 1906\u20131922 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR16","unstructured":"Schmidt, J.: Enumeration: Algorithms and Complexity. Master\u2019s thesis, Leibniz Universit\u00e4t Hannover (2009)"},{"issue":"1\u20132","key":"41_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"114","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics 114(1\u20132), 173\u2013182 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"41_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1590\/S0101-74382005000200004","volume":"25","author":"K S\u00f6rensen","year":"2005","unstructured":"S\u00f6rensen, K., Janssens, G.K.: An algorithm to generate all spanning trees of a graph in order of increasing cost. Pesquisa Operacional 25(2), 219\u2013229 (2005)","journal-title":"Pesquisa Operacional"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Proc. STOC, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"},{"issue":"1","key":"41_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic Discrete Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM Journal on Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T07:49:56Z","timestamp":1675842596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}