{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:06:31Z","timestamp":1758636391547},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85097-7_11","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T03:18:26Z","timestamp":1219115906000},"page":"116-126","source":"Crossref","is-referenced-by-count":10,"title":["Parameterized Algorithms for Generalized Domination"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Sriganesh","family":"Srihari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_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. LNCS, vol.\u00a04598, pp. 394\u2013405. Springer, Heidelberg (2007)"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0022-0000(03)00074-6","volume":"67","author":"L. Cai","year":"2003","unstructured":"Cai, L., Juedes, D.: On the Existence of Subexponential Algorithms. Journal of Computer and System Sciences\u00a067(4), 789\u2013807 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved Parameterized Upper Bounds for Vertex Cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"issue":"6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of ACM\u00a052(6), 866\u2013893 (2005)","journal-title":"Journal of ACM"},{"key":"11_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"11_CR6","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 W[2]. Theoretical Computer Science\u00a0209(1-2), 123\u2013140 (1998)","journal-title":"Theoretical Computer Science"},{"key":"11_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":"11_CR8","doi-asserted-by":"crossref","unstructured":"Duh, R., F\u00fcrer, M.: Approximation of k-set cover by semi-local optimization. In: The Proceedings of STOC, pp. 256\u2013264 (1997)","DOI":"10.1145\/258533.258599"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A Threshold of ln n for Approximating Set Cover. Journal of ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of ACM"},{"key":"11_CR11","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"11_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.7151\/dmgt.1171","volume":"22","author":"T. Gerlach","year":"2002","unstructured":"Gerlach, T., Harant, J.: A Note on Domination in Bipartite Graphs. Discuss. Math. Graph Theory\u00a022, 229\u2013231 (2002)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences\u00a09(3), 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR15","doi-asserted-by":"crossref","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, Oxford (2006)"},{"key":"11_CR16","unstructured":"Raman, V., Saurabh, S.: Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles (to appear in Algorithmica)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:31:48Z","timestamp":1558265508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540850960","9783540850977"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}