{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:40Z","timestamp":1725570460630},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_34","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:13:41Z","timestamp":1291407221000},"page":"378-389","source":"Crossref","is-referenced-by-count":6,"title":["On Tractable Cases of Target Set Selection"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Nichterlein","sequence":"first","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Uhlmann","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","first-page":"355","volume-title":"Proc. 10th ACM EC","author":"O. Ben-Zwi","year":"2009","unstructured":"Ben-Zwi, O., Hermelin, D., Lokshtanov, D., Newman, I.: An exact almost optimal algorithm for target set selection in social networks. In: Proc. 10th ACM EC, pp. 355\u2013362. ACM Press, New York (2009)"},{"doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: Kernelization: New upper and lower bound techniques. In: IWPEC 2009. LNCS, vol.\u00a05917, pp. 17\u201337. Springer, Heidelberg (2009)","key":"34_CR2","DOI":"10.1007\/978-3-642-11269-0_2"},{"unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Analysis of data reduction: Transformations give evidence for non-existence of polynomial kernels. Technical Report UU-CS-2008-030, Department of Information and Computing Sciences, Utrecht University (2008)","key":"34_CR3"},{"key":"34_CR4","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: a Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a03. SIAM, Philadelphia (1999)"},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N. Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM Journal on Discrete Mathematics\u00a023(3), 1400\u20131415 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"key":"34_CR7","first-page":"57","volume-title":"Proc. 7th ACM KDD","author":"P. Domingos","year":"2001","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. 7th ACM KDD, pp. 57\u201366. ACM Press, New York (2001)"},{"key":"34_CR8","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)"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"34_CR10","series-title":"LNCS","first-page":"221","volume-title":"TAMC 2009","author":"J. Fiala","year":"2009","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. In: TAMC 2009. LNCS, vol.\u00a05532, pp. 221\u2013230. Springer, Heidelberg (2009)"},{"key":"34_CR11","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"4","key":"34_CR12","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1177\/1059712308090536","volume":"16","author":"D.W. Franks","year":"2008","unstructured":"Franks, D.W., Noble, J., Kaufmann, P., Stagl, S.: Extremism propagation in social networks with hubs. Adaptive Behavior\u00a016(4), 264\u2013274 (2008)","journal-title":"Adaptive Behavior"},{"issue":"1","key":"34_CR13","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. ACM SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"key":"34_CR14","first-page":"137","volume-title":"Proc. 9th ACM KDD","author":"D. Kempe","year":"2003","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. 9th ACM KDD, pp. 137\u2013146. ACM Press, New York (2003)"},{"unstructured":"McCartin, C., Rossmanith, P., Fellows, M.: Frontiers of intractability for dominating set (2007) (manuscript)","key":"34_CR15"},{"unstructured":"McConnell, R.M., Spinrad, J.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: Proc. 5th SODA, pp. 536\u2013545. ACM\/SIAM (1994)","key":"34_CR16"},{"key":"34_CR17","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)"},{"unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS. LIPIcs, vol.\u00a05, pp. 17\u201332. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2010)","key":"34_CR18"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1136\/sti.78.suppl_1.i159","volume":"78","author":"J.J. Potterat","year":"2002","unstructured":"Potterat, J.J., Phillips-Plummer, L., Muth, S.Q., Rothenberg, R.B., Woodhouse, D.E., Maldonado-Long, T.S., Zimmerman, H.P., Muth, J.B.: Risk network structure in the early epidemic phase of HIV transmission in Colorado Springs. Sexually Transmitted Infections\u00a078, 159\u2013163 (2002)","journal-title":"Sexually Transmitted Infections"},{"issue":"1-2","key":"34_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R. Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics\u00a0144(1-2), 173\u2013182 (2004)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T17:19:29Z","timestamp":1553275169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}