{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:54:39Z","timestamp":1767138879241,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_25","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"292-304","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subexponential Fixed-Parameter Algorithms for Partial Vector Domination"],"prefix":"10.1007","author":[{"given":"Toshimasa","family":"Ishii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"issue":"6","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.jcss.2010.12.002","volume":"77","author":"O Amini","year":"2011","unstructured":"Amini, O., Fomin, F.V., Saurabh, S.: Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. 77(6), 1159\u20131171 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2011.08.013","volume":"160","author":"N Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On bounded-degree vertex deletion parameterized by treewidth. Discrete Appl. Math. 160(1), 53\u201360 (2012)","journal-title":"Discrete Appl. Math."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/3-540-63165-8_217","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for branchwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 627\u2013637. Springer, Heidelberg (1997)"},{"key":"25_CR4","unstructured":"Chapelle, M.: Parameterized complexity of generalized domination problems on bounded tree-width graphs (2010). arXiv preprint arXiv:1004.2642"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milani\u010d, M., Vaccaro, U.: Latency-bounded target set selection in social networks (2013). arXiv preprint arXiv:1303.6785","DOI":"10.1007\/978-3-642-39053-1_8"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-22953-4_25","volume-title":"Fundamentals of Computation Theory","author":"F Cicalese","year":"2011","unstructured":"Cicalese, F., Milani\u010d, M., Vaccaro, U.: Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 288\u2013297. Springer, Heidelberg (2011)"},{"issue":"6","key":"25_CR7","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.dam.2012.10.007","volume":"161","author":"F Cicalese","year":"2013","unstructured":"Cicalese, F., Milanic, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Discrete Appl. Math. 161(6), 750\u2013767 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"DG Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 34(4), 825\u2013847 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1077464.1077468","volume":"1","author":"ED 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 Trans. Algorithms (TALG) 1(1), 33\u201347 (2005)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Kawarabayashi, K.i.: Algorithmic graph minor theory: decomposition, approximation, and coloring. In: 2005 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 637\u2013646. IEEE (2005)","DOI":"10.1109\/SFCS.2005.14"},{"key":"25_CR12","unstructured":"Demaine, E.D., Hajiaghayi, M.: Bidimensionality: new connections between fpt algorithms and ptass. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 590\u2013601. Society for Industrial and Applied Mathematics (2005)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11841036_27","volume-title":"Algorithms \u2013 ESA 2006","author":"F Dorn","year":"2006","unstructured":"Dorn, F.: Dynamic programming and fast matrix multiplication. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 280\u2013291. Springer, Heidelberg (2006)"},{"key":"25_CR14","volume-title":"Fixed-Parameter Tractability and Completeness","author":"RG Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-Parameter Tractability and Completeness. Cornell University, Mathematical Sciences Institute (1992)"},{"issue":"16","key":"25_CR15","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ipl.2011.05.016","volume":"111","author":"FV Fomin","year":"2011","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16), 814\u2013818 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"25_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/S0097539702419649","volume":"36","author":"FV Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: branch-width and exponential speed-up. SIAM J. Comput. 36(2), 281\u2013309 (2006)","journal-title":"SIAM J. Comput."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J Harant","year":"1999","unstructured":"Harant, J., Pruchnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Comb. Probab. Comput. 8, 547\u2013553 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"25_CR18","first-page":"201","volume":"55","author":"F Harary","year":"2000","unstructured":"Harary, F., Haynes, T.W.: Double domination in graphs. Ars Comb. 55, 201\u2013214 (2000)","journal-title":"Ars Comb."},{"key":"25_CR19","volume-title":"Domination in Graphs: Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics, vol. 40. Marcel Dekker, New York (1998)"},{"key":"25_CR20","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Ishii, T., Ono, H., Uno, Y.: (Total) vector domination for graphs with bounded branchwidth (2013). arXiv preprint arXiv:1306.5041","DOI":"10.1007\/978-3-642-54423-1_21"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-54423-1_21","volume-title":"LATIN 2014: Theoretical Informatics","author":"T Ishii","year":"2014","unstructured":"Ishii, T., Ono, H., Uno, Y.: (Total) vector domination for graphs with bounded branchwidth. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 238\u2013249. Springer, Heidelberg (2014)"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-85097-7_11","volume-title":"Combinatorial Optimization and Applications","author":"V Raman","year":"2008","unstructured":"Raman, V., Saurabh, S., Srihari, S.: Parameterized algorithms for generalized domination. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 116\u2013126. Springer, Heidelberg (2008)"},{"issue":"2","key":"25_CR24","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. X. obstructions to tree-decomposition. J. Comb. Theor. Ser. B 52(2), 153\u2013190 (1991)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"2","key":"25_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"PD Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217\u2013241 (1994)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:51:28Z","timestamp":1746294688000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-319-09174-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":25,"aliases":["10.1007\/978-3-319-14115-2_25"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-09174-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}