{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:12:07Z","timestamp":1737436327620,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73545-8_39","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"394-405","source":"Crossref","is-referenced-by-count":5,"title":["Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Gutner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"39_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"},{"issue":"4","key":"39_CR2","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":"1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jcta.2003.08.001","volume":"104","author":"N. Alon","year":"2003","unstructured":"Alon, N., Cohen, G.D., Krivelevich, M., Litsyn, S.: Generalized hashing and parent-identifying codes. J. Comb. Theory, Ser. A\u00a0104(1), 207\u2013215 (2003)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"4","key":"39_CR4","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"issue":"3","key":"39_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica\u00a017(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"issue":"8","key":"39_CR6","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":"39_CR7","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, New York (1976)"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/11847250_22","volume-title":"Second International Workshop on Parameterized and Exact Computation","author":"L. Cai","year":"2006","unstructured":"Cai, L., Chan, S.M., Chan, S.O.: Random separation: A new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 239\u2013250. Springer, Heidelberg (2006)"},{"issue":"1","key":"39_CR9","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":"39_CR10","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":"39_CR11","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, Heidelberg (2005)","edition":"3"},{"key":"39_CR12","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, Heidelberg (1999)"},{"issue":"2","key":"39_CR13","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":"39_CR14","series-title":"An EATCS Series","volume-title":"Parameterized complexity theory. Texts in Theoretical Computer Science","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)"},{"key":"39_CR15","first-page":"168","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"F.V. Fomin","year":"2003","unstructured":"Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: branch-width and exponential speed-up. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 168\u2013177. ACM Press, New York (2003)"},{"issue":"4","key":"39_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR17","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":"39_CR18","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":"Combinatorics, Probability & Computing"},{"issue":"4","key":"39_CR19","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":"39_CR20","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science, pp. 182\u2013191 (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"issue":"2","key":"39_CR21","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":"39_CR22","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"},{"issue":"2","key":"39_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1137\/S0895480194274133","volume":"10","author":"R. Yuster","year":"1997","unstructured":"Yuster, R., Zwick, U.: Finding even cycles even faster. SIAM Journal on Discrete Mathematics\u00a010(2), 209\u2013222 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"39_CR24","unstructured":"Yuster, R., Zwick, U.: Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 254\u2013260 (2004)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T12:32:42Z","timestamp":1737376362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540735441","9783540735458"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}