{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:50Z","timestamp":1725541850391},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_12","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T08:12:27Z","timestamp":1259827947000},"page":"133-142","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of Generalized Domination Problems"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-73545-8_39","volume-title":"Computing and Combinatorics","author":"N. Alon","year":"2007","unstructured":"Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 394\u2013405. Springer, Heidelberg (2007)"},{"key":"12_CR2","unstructured":"Bodlaender, H.L., Kratsch, D.: A note on fixed parameter intractability of some domination-related problems. Private communication (1994)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(01)00207-1","volume":"81","author":"M. Cesati","year":"2002","unstructured":"Cesati, M.: Perfect code is W[1]-complete. Inf. Process. Lett.\u00a081, 163\u2013168 (2002)","journal-title":"Inf. Process. Lett."},{"key":"12_CR4","first-page":"270","volume-title":"LICS 2007","author":"A. Dawar","year":"2007","unstructured":"Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS 2007, pp. 270\u2013279. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"12_CR5","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congressus Numerantium, 161\u2013178 (1992)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. II. On completeness for W[1]. Theoret. Comput. Sci.\u00a0141, 109\u2013131 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR7","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1998)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(97)00101-1","volume":"209","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Threshold dominating sets and an improved characterization of\u00a0W[2]. Theoret. Comput. Sci.\u00a0209, 123\u2013140 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/S0097539797323571","volume":"29","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29 (electronic), 545\u2013570 (1999)","journal-title":"SIAM J. Comput."},{"key":"12_CR10","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74839-7_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P.A. Golovach","year":"2007","unstructured":"Golovach, P.A., Kratochv\u00edl, J.: Computational complexity of generalized domination: A complete dichotomy for chordal graphs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 1\u201311. Springer, Heidelberg (2007)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-79228-4_16","volume-title":"Theory and Applications of Models of Computation","author":"P.A. Golovach","year":"2008","unstructured":"Golovach, P.A., Kratochv\u00edl, J.: Generalized domination in degenerate graphs: a complete dichotomy of computational complexity. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 182\u2013191. Springer, Heidelberg (2008)"},{"key":"12_CR13","first-page":"128","volume":"5","author":"P. Heggernes","year":"1998","unstructured":"Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput.\u00a05, 128\u2013142 (1998)","journal-title":"Nordic J. Comput."},{"key":"12_CR14","unstructured":"Kloks, T., Cai, L.: Parameterized tractability of some (efficient) Y - domination variants for planar graphs and t-degenerate graphs. In: Proceedings of the International Computer Symposium (ICS 2000), Taiwan (2000)"},{"key":"12_CR15","first-page":"41","volume":"2","author":"J. Kratochv\u00edl","year":"1995","unstructured":"Kratochv\u00edl, J., Manuel, P.D., Miller, M.: Generalized domination in chordal graphs. Nordic J. Comput.\u00a02, 41\u201350 (1995)","journal-title":"Nordic J. Comput."},{"key":"12_CR16","series-title":"Texts in Algorithmics","first-page":"107","volume-title":"ACiD 2006","author":"H. Moser","year":"2006","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. In: Broersma, H., Dantchev, S.S., Johnson, M., Szeider, S. (eds.) ACiD 2006. Texts in Algorithmics, vol.\u00a07, pp. 107\u2013118. King\u2019s College, London (2006)"},{"key":"12_CR17","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, USA (2006)"},{"key":"12_CR18","first-page":"157","volume":"1","author":"J.A. Telle","year":"1994","unstructured":"Telle, J.A.: Complexity of domination-type problems in graphs. Nordic J. Comput.\u00a01, 157\u2013171 (1994)","journal-title":"Nordic J. Comput."},{"key":"12_CR19","unstructured":"Telle, J.A.: Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees. PhD thesis. Department of Computer Science, University of Oregon, Eugene (1994)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"J.A. Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math.\u00a010, 529\u2013550 (1997)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:51:59Z","timestamp":1619769119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}