{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:06:02Z","timestamp":1771455962396,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540390985","type":"print"},{"value":"9783540391012","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_24","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T15:43:02Z","timestamp":1158162182000},"page":"264-275","source":"Crossref","is-referenced-by-count":19,"title":["Kernels: Annotated, Proper and Induced"],"prefix":"10.1007","author":[{"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[]},{"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-28639-4_19","volume-title":"Parameterized and Exact Computation","author":"F.N. Abu-Khzam","year":"2004","unstructured":"Abu-Khzam, F.N., Langston, M.A.: A direct algorithm for the parameterized face cover problem. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 213\u2013222. Springer, Heidelberg (2004)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/11611257_11","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"J. Alber","year":"2006","unstructured":"Alber, J., Dorn, B., Niedermeier, R.: A general data reduction scheme for domination in graphs. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 137\u2013147. Springer, Heidelberg (2006)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-31856-9_22","volume-title":"STACS 2005","author":"J. Chen","year":"2005","unstructured":"Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 269\u2013280. Springer, Heidelberg (2005)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Fellows, M.R., Fernau, H., Prieto, E., Rosamond, F.A.: nonblocker: Parameterized algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 237\u2013245. Springer, Heidelberg (2006)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics\u00a0162, 439\u2013485 (2005)","journal-title":"Annals of Mathematics"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11758471_31","volume-title":"Algorithms and Complexity","author":"M. Dom","year":"2006","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R., Tru\u00df, A.: Fixed-parameter tractability results for feedback set problems in tournaments. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 320\u2013331. Springer, Heidelberg (2006)"},{"key":"24_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, pp. 49\u201399 (1999)","DOI":"10.1090\/dimacs\/049\/04"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-24595-7_31","volume-title":"Graph Drawing","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Fernau, H., Kaufmann, M.: Fixed parameter algorithms for one-sided crossing minimization revisited. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 332\u2013344. Springer, Heidelberg (2004)"},{"key":"24_CR10","unstructured":"Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-Hitting Set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity ECCC (2004)"},{"key":"24_CR11","unstructured":"Fernau, H.: Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitationsschrift, Universit\u00e4t T\u00fcbingen, Germany (2005)"},{"key":"24_CR12","unstructured":"Fernau, H.: Parameterized algorithmics for linear arrangement problems. In: CTW 2005: Workshop on Graphs and Combinatorial Optimization, University of Cologne, Germany, pp. 27\u201331 (2005) (Long version submitted)"},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.7155\/jgaa.00106","volume":"9","author":"H. Fernau","year":"2005","unstructured":"Fernau, H.: Two-layer planarization: improving on parameterized algorithmics. Journal of Graph Algorithms and Applications\u00a09, 205\u2013238 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"24_CR14","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, 321\u2013347 (2004)","journal-title":"Algorithmica"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/11758471_34","volume-title":"Algorithms and Complexity","author":"G. Gutin","year":"2006","unstructured":"Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The linear arrangement problem parameterized above guaranteed value. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 356\u2013367. Springer, Heidelberg (2006)"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms\u00a01, 89\u2013102 (2003)","journal-title":"Journal of Discrete Algorithms"},{"key":"24_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: On efficient fixed parameter algorithms for weighted vertex cover. Journal of Algorithms\u00a047, 63\u201377 (2003)","journal-title":"Journal of Algorithms"},{"key":"24_CR18","first-page":"41","volume":"86","author":"M. Serna","year":"2005","unstructured":"Serna, M., Thilikos, D.M.: Parameterized complexity for graph layout problems. EATCS Bulletin\u00a086, 41\u201365 (2005)","journal-title":"EATCS Bulletin"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:18:43Z","timestamp":1619507923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11847250_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}