{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:14:37Z","timestamp":1770894877501,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642112683","type":"print"},{"value":"9783642112690","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_20","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"246-257","source":"Crossref","is-referenced-by-count":5,"title":["Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor"],"prefix":"10.1007","author":[{"given":"Shai","family":"Gutner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"20_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(4), 461\u2013493 (2002)","journal-title":"Algorithmica"},{"key":"20_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)"},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jcss.2004.03.007","volume":"71","author":"J. Alber","year":"2005","unstructured":"Alber, J., Fan, H., Fellows, M.R., Fernau, H., Niedermeier, R., Rosamond, F.A., Stege, U.: A refined search tree technique for dominating set on planar graphs. J. Comput. Syst. Sci.\u00a071(4), 385\u2013405 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"20_CR4","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":"20_CR5","unstructured":"Alon, N., Gutner, S.: Kernels for the dominating set problem on graphs with an excluded minor. Electronic Colloquium on Computational Complexity (ECCC) 15(066) (2008)"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/s00453-008-9204-0","volume":"54","author":"N. Alon","year":"2009","unstructured":"Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica\u00a054(4), 544\u2013556 (2009)","journal-title":"Algorithmica"},{"issue":"8","key":"20_CR7","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1006\/eujc.1997.0188","volume":"19","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B., Thomason, A.: Proof of a conjecture of Mader, Erd\u00f6s and Hajnal on topological complete subgraphs. Eur. J. Comb.\u00a019(8), 883\u2013887 (1998)","journal-title":"Eur. J. Comb."},{"key":"20_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with applications. American Elsevier Publishing Co., Inc., New York (1976)"},{"issue":"4","key":"20_CR9","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 J. Comput.\u00a037(4), 1077\u20131106 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1077464.1077468","volume":"1","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Transactions on Algorithms\u00a01(1), 33\u201347 (2005)","journal-title":"ACM Transactions on Algorithms"},{"issue":"6","key":"20_CR11","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":"20_CR12","series-title":"Graduate Texts in Mathematics","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Berlin (2005)","edition":"3"},{"key":"20_CR13","series-title":"Monographs in Computer Science","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. Monographs in Computer Science. Springer, New York (1999)"},{"issue":"2","key":"20_CR14","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. J. Algorithms\u00a052(2), 152\u2013168 (2004)","journal-title":"J. Algorithms"},{"key":"20_CR15","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized complexity theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"20_CR17","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 J. Comput.\u00a036(2), 281\u2013309 (2006)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"20_CR18","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00493-003-0037-9","volume":"23","author":"M. Grohe","year":"2003","unstructured":"Grohe, M.: Local tree-width, excluded minors, and approximation algorithms. Combinatorica\u00a023(4), 613\u2013632 (2003)","journal-title":"Combinatorica"},{"issue":"3","key":"20_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"A. Itai","year":"1982","unstructured":"Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks\u00a012(3), 277\u2013286 (1982)","journal-title":"Networks"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-45687-2_33","volume-title":"Mathematical Foundations of Computer Science 2002","author":"I.A. Kanj","year":"2002","unstructured":"Kanj, I.A., Perkovic, L.: Improved parameterized algorithms for planar dominating set. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 399\u2013410. Springer, Heidelberg (2002)"},{"key":"20_CR21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1017\/S096354830000184X","volume":"5","author":"J. Koml\u00f3s","year":"1996","unstructured":"Koml\u00f3s, J., Szemer\u00e9di, E.: Topological cliques in graphs II. Combinatorics. Probability & Computing\u00a05, 79\u201390 (1996)","journal-title":"Probability & Computing"},{"issue":"4","key":"20_CR22","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A.V. Kostochka","year":"1984","unstructured":"Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica\u00a04(4), 307\u2013316 (1984)","journal-title":"Combinatorica"},{"key":"20_CR23","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, Oxford (2006)"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-642-04128-0_62","volume-title":"ESA 2009","author":"G. Philip","year":"2009","unstructured":"Philip, G., Raman, V., Sikdar, S.: Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 694\u2013705. Springer, Heidelberg (2009)"},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. Thomason","year":"1984","unstructured":"Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc.\u00a095(2), 261\u2013265 (1984)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A. Thomason","year":"2001","unstructured":"Thomason, A.: The extremal function for complete minors. J. Comb. Theory, Ser. B\u00a081(2), 318\u2013338 (2001)","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T22:11:46Z","timestamp":1675894306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}