{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T23:28:23Z","timestamp":1771889303747,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041273","type":"print"},{"value":"9783642041280","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_62","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"694-705","source":"Crossref","is-referenced-by-count":14,"title":["Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels"],"prefix":"10.1007","author":[{"given":"Geevarghese","family":"Philip","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"62_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for Dominating Set. Journal of the ACM\u00a051(3), 363\u2013384 (2004)","journal-title":"Journal of the ACM"},{"key":"62_CR2","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":"62_CR3","unstructured":"Alon, N., Gutner, S.: Kernels for the dominating set problem on graphs with an excluded minor. Technical Report TR08-066, The Electronic Colloquium on Computational Complexity (ECCC) (2008)"},{"key":"62_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-540-70575-8_46","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (Extended abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 563\u2013574. Springer, Heidelberg (2008)"},{"issue":"4","key":"62_CR5","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1137\/050646354","volume":"37","author":"J. Chen","year":"2007","unstructured":"Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. SIAM Journal of Computing\u00a037(4), 1077\u20131106 (2007)","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"62_CR6","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., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of the ACM\u00a052(6), 866\u2013893 (2005)","journal-title":"Journal of the ACM"},{"key":"62_CR7","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through Colors and IDs. Accepted at ICALP 2009 (2009)","DOI":"10.1007\/978-3-642-02927-1_32"},{"key":"62_CR9","doi-asserted-by":"publisher","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)"},{"issue":"2","key":"62_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.jalgor.2004.02.001","volume":"52","author":"J.A. Ellis","year":"2004","unstructured":"Ellis, J.A., Fan, H., Fellows, M.R.: The Dominating Set problem is fixed parameter tractable for graphs of bounded genus. Journal of Algorithms\u00a052(2), 152\u2013168 (2004)","journal-title":"Journal of Algorithms"},{"key":"62_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-540-27836-8_50","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Thilikos, D.M.: Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 581\u2013592. Springer, Heidelberg (2004)"},{"issue":"2","key":"62_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/S0097539702419649","volume":"36","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM Journal of Computing\u00a036(2), 281\u2013309 (2006)","journal-title":"SIAM Journal of Computing"},{"key":"62_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.jda.2005.12.008","volume":"4","author":"G. Franceschini","year":"2006","unstructured":"Franceschini, G., Luccio, F., Pagli, L.: Dense trees: a new look at degenerate graphs. Journal of Discrete Algorithms\u00a04, 455\u2013474 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"62_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2013Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP\u2013Completeness. Freeman, San Francisco (1979)"},{"key":"62_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92248-3_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P.A. Golovach","year":"2008","unstructured":"Golovach, P.A., Villanger, Y.: Parameterized complexity for domination problems on degenerate graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, Springer, Heidelberg (2008)"},{"issue":"1","key":"62_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"issue":"2","key":"62_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-007-9148-9","volume":"52","author":"V. Raman","year":"2008","unstructured":"Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT\u00a0algorithms for W-hard problems in graphs with\u00a0no\u00a0short cycles. Algorithmica\u00a052(2), 203\u2013225 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"62_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1112\/jlms\/s1-38.1.423","volume":"s1-38","author":"H. Sachs","year":"1963","unstructured":"Sachs, H.: Regular graphs with given girth and restricted circuits. Journal of the London Mathematical Society\u00a0s1-38(1), 423\u2013429 (1963)","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:32Z","timestamp":1558524152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}