{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:48:46Z","timestamp":1725889726705},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332920"},{"type":"electronic","value":"9783642332937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_8","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T10:50:58Z","timestamp":1346237458000},"page":"61-72","source":"Crossref","is-referenced-by-count":0,"title":["Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Kowalik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"8_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. J. ACM\u00a051(3), 363\u2013384 (2004)","journal-title":"J. ACM"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K. Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable part I. Discharging. Illinois J. of Math.\u00a021, 429\u2013490 (1977)","journal-title":"Discharging. Illinois J. of Math."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (meta) kernelization. In: Proc. FOCS 2009, pp. 629\u2013638 (2009)","DOI":"10.1109\/FOCS.2009.46"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"71","author":"O.V. Borodin","year":"1997","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colourings of multigraphs. J. Comb. Theory, Ser. B\u00a071(2), 184\u2013204 (1997)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"8_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 J. Comput.\u00a037(4), 1077\u20131106 (2007)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: NONBLOCKER: Parameterized Algorithmics for MINIMUM DOMINATING SET. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 237\u2013245. Springer, Heidelberg (2006)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1137\/060650507","volume":"22","author":"Z. Dvorak","year":"2008","unstructured":"Dvorak, Z., Skrekovski, R., Valla, T.: Planar graphs of odd-girth at least 9 are homomorphic to the petersen graph. SIAM J. Disc. Math.\u00a022(2), 568\u2013591 (2008)","journal-title":"SIAM J. Disc. Math."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: Charikar, M. (ed.) SODA, pp. 503\u2013510. SIAM (2010)","DOI":"10.1137\/1.9781611973075.43"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-73420-8_34","volume-title":"Automata, Languages and Programming","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Linear Problem Kernels for NP-Hard Problems on Planar Graphs. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 375\u2013386. Springer, Heidelberg (2007)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-25870-1_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"I.A. Kanj","year":"2011","unstructured":"Kanj, I.A., Zhang, F.: On the Independence Number of Graphs with Maximum Degree 3. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 238\u2013249. Springer, Heidelberg (2011)"},{"issue":"5","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1016\/j.disc.2007.12.009","volume":"309","author":"A.V. Kostochka","year":"2009","unstructured":"Kostochka, A.V., Stodolsky, B.Y.: An upper bound on the domination number of n-vertex connected cubic graphs. Discrete Mathematics\u00a0309(5), 1142\u20131162 (2009)","journal-title":"Discrete Mathematics"},{"key":"8_CR12","unstructured":"Kowalik, L., Pilipczuk, M., Suchan, K.: Towards optimal kernel for connected vertex cover in planar graphs. CoRR abs\/1110.1964 (2011)"},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1002\/jgt.3190130610","volume":"13","author":"W. McCuaig","year":"1989","unstructured":"McCuaig, W., Shepherd, B.: Domination in graphs with minimum degree two. J. Graph Th.\u00a013(6), 749\u2013762 (1989)","journal-title":"J. Graph Th."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0963548300002042","volume":"5","author":"B.A. Reed","year":"1996","unstructured":"Reed, B.A.: Paths, stars and the number three. Combinatorics, Probability & Computing\u00a05, 277\u2013295 (1996)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N. Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D.P., Seymour, P.D., Thomas, R.: The four-colour theorem. J. Comb. Theory, Ser. B\u00a070(1), 2\u201344 (1997)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-22993-0_53","volume-title":"Mathematical Foundations of Computer Science 2011","author":"J. Wang","year":"2011","unstructured":"Wang, J., Yang, Y., Guo, J., Chen, J.: Linear Problem Kernels for Planar Graph Problems with Small Distance Property. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 592\u2013603. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33293-7_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:03:31Z","timestamp":1620129811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}