{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:07Z","timestamp":1725551887939},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_21","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T16:37:18Z","timestamp":1136479038000},"page":"237-245","source":"Crossref","is-referenced-by-count":21,"title":["nonblocker: Parameterized Algorithmics for minimum dominating set"],"prefix":"10.1007","author":[{"given":"Frank","family":"Dehne","sequence":"first","affiliation":[]},{"given":"Michael","family":"Fellows","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Prieto","sequence":"additional","affiliation":[]},{"given":"Frances","family":"Rosamond","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00453-001-0116-5","volume":"33","author":"J. Alber","year":"2002","unstructured":"Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed Parameter Algorithms for Dominating Set and Related Problems on Planar Graphs. Algorithmica\u00a033, 461\u2013493 (2002)","journal-title":"Algorithmica"},{"key":"21_CR2","volume-title":"Complexity and Approximation; Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Creczenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation; Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"21_CR3","first-page":"3","volume":"10","author":"M. Blank","year":"1973","unstructured":"Blank, M.: An Estimate of the External Stability Number of a Graph without Suspended Vertices (in Russian). Prikl. Math. i Programmirovanie Vyp\u00a010, 3\u201311 (1973)","journal-title":"Prikl. Math. i Programmirovanie Vyp"},{"key":"21_CR4","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":"21_CR5","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":"21_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"SOFSEM 2006","author":"H. Fernau","year":"2006","unstructured":"Fernau, H.: Roman Domination: a Parameterized Perspective. In: Wiedermann, J., et al. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831. Springer, Heidelberg (2006)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11523468_16","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: Domination \u2013 a Case Study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 191\u2013203. Springer, Heidelberg (2005)"},{"key":"21_CR8","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Technical Report 307, Department of Informatics, University of Bergen (2005)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24749-4_6","volume-title":"STACS 2004","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Thilikos, D.: A Simple and Fast Approach for Solving Problems on Planar Graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 56\u201367. Springer, Heidelberg (2004)"},{"key":"21_CR10","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"21_CR11","series-title":"Monographs and Textbooks in Pure and Applied Mathematics","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1998)"},{"key":"21_CR12","first-page":"23","volume":"40","author":"S.T. Hedetniemi","year":"1983","unstructured":"Hedetniemi, S.T.: A Max-Min Relationship between Matchings and Domination in Graphs. Congressus Numerantium\u00a040, 23\u201334 (1983)","journal-title":"Congressus Numerantium"},{"issue":"6","key":"21_CR13","first-page":"443","volume":"63","author":"T. Kikuno","year":"1980","unstructured":"Kikuno, T., Yoshida, N., Kakuda, Y.: The NP-Completeness of the Dominating Set Problem in Cubic Planar Graphs. Transactions of the Institute of Electronics and Communication Engineers of Japan\u00a0E63(6), 443\u2013444 (1980)","journal-title":"Transactions of the Institute of Electronics and Communication Engineers of Japan"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(98)00147-4","volume":"91","author":"D.F. Manlove","year":"1999","unstructured":"Manlove, D.F.: On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs. Discrete Applied Mathematics\u00a091, 155\u2013175 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1002\/jgt.3190130610","volume":"13","author":"B. McCuaig","year":"1989","unstructured":"McCuaig, B., Shepherd, B.: Domination in Graphs of Minimum Degree Two. Journal of Graph Theory\u00a013, 749\u2013762 (1989)","journal-title":"Journal of Graph Theory"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","volume":"14","author":"J. Nieminen","year":"1974","unstructured":"Nieminen, J.: Two Bounds for the Domination Number of a Graph. Journal of the Institute of Mathematics and its Applications\u00a014, 183\u2013187 (1974)","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Ore, O.: Theory of Graphs, Colloquium Publications. American Mathematical Society XXXVIII (1962)","DOI":"10.1090\/coll\/038"},{"key":"21_CR18","unstructured":"Prieto, E.: Systematic Kernelization in FPT Algorithm Design. PhD thesis, The University of Newcastle, Australia (2005)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0963548300002042","volume":"5","author":"B. Reed","year":"1996","unstructured":"Reed, B.: Paths, Stars, and the Number Three. Combinatorics, Probability and Computing\u00a05, 277\u2013295 (1996)","journal-title":"Combinatorics, Probability and Computing"},{"key":"21_CR20","unstructured":"Thomass\u00e9, S., Yeo, Y.: Total Domination of Graphs and Small Transversals of Hypergraphs. To appear in Combinatorica (2005)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:26Z","timestamp":1619507366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11611257_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}