{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:46:03Z","timestamp":1776681963346,"version":"3.51.2"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030420703","type":"print"},{"value":"9783030420710","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-42071-0_2","type":"book-chapter","created":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T17:02:44Z","timestamp":1587574964000},"page":"7-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Collaborating with Hans: Some Remaining Wonderments"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S1571-0661(04)81014-4","volume":"78","author":"R-G Downey","year":"2003","unstructured":"Downey, R.-G., Estivill-Castro, V., Fellows, M.-R., Prieto-Rodriguez, E., Rosamond, F.: Cutting up is hard to do: the parameterized complexity of k-cut and related problems. Electr. Notes Theor. Comput. Sci. 78, 209\u2013222 (2003)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"2_CR2","unstructured":"Barefoot, C., Clark, H., Douthett, J., Entringer, R., Fellows, M.: Length 0 modulo 3 in graphs. Ann. Discret. Math. 87\u2013101 (1991)"},{"key":"2_CR3","unstructured":"Edouard, B., Bousquet, N., Thomass\u00e9, S., Watrigant, R.: When maximum stable set can be solved in FPT time. In: 30th International Symposium on Algorithms and Computation (ISAAC), Article no. 49(22), pp. 1\u201349. Schloss Dagstuhl Leibniz Zentrum for Informatiks (2019)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-07956-1_20","volume-title":"Algorithmic Aspects in Information and Management","author":"L Cai","year":"2014","unstructured":"Cai, L., Ye, J.: Parameterized complexity of connected induced subgraph problems. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 219\u2013230. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07956-1_20"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19222-7_1","volume-title":"Combinatorial Algorithms","author":"K Dabrowski","year":"2011","unstructured":"Dabrowski, K., Lozin, V., M\u00fcller, H., Rautenbach, D.: Parameterized algorithms for the independent set problem in some hereditary graph classes. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 1\u20139. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19222-7_1"},{"key":"2_CR6","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"2_CR7","series-title":"Monograph in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monograph in Computer Science. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"issue":"1\u20132","key":"2_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(97)00300-9","volume":"233","author":"K Cattell","year":"2000","unstructured":"Cattell, K., Dinneen, M., Downey, R., Fellows, M., Langston, M.: On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1\u20132), 107\u2013127 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-319-98355-4_19","volume-title":"Adventures Between Lower Bounds and Higher Altitudes","author":"MR Fellows","year":"2018","unstructured":"Fellows, M.R., Jaffke, L., Kir\u00e1ly, A.I., Rosamond, F.A., Weller, M.: What is known about vertex cover kernelization? In: B\u00f6ckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 330\u2013356. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98355-4_19"},{"key":"2_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.-S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)"},{"key":"2_CR11","unstructured":"de Berg, M., Bodlaender, H., Fellows, M., Knauer, C. (Scientific Organizers): Fixed-parameter computational geometry. In: Leiden Workshop, Lorentz Center (2016)"},{"key":"2_CR12","unstructured":"Downey, R., Fellows, M., Niedermeier, R., Rossmanith, P. (Scientific Organizers): Parameterized complexity. Dagstuhl Seminar 01311, Dagstuh (2001)"},{"issue":"4","key":"2_CR13","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. J. Assoc. Comput. Mach. 42(4), 844\u2013856 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3\u20132","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 3\u20132(1), 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Treewidth, Kernels, and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42071-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T14:02:47Z","timestamp":1671372167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-42071-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030420703","9783030420710"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42071-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}