{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:22:20Z","timestamp":1773750140984,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319266251","type":"print"},{"value":"9783319266268","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_42","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T04:08:43Z","timestamp":1449634123000},"page":"574-585","source":"Crossref","is-referenced-by-count":3,"title":["Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth"],"prefix":"10.1007","author":[{"given":"Jessica","family":"Enright","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kitty","family":"Meeks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"42_CR1","first-page":"417","volume":"3","author":"RM Anderson","year":"1990","unstructured":"Anderson, R.M., Gupta, S., Ng, W.: The significance of sexual partner contact networks for the transmission dynamics of HIV. J. Acquir. Immune Defic. Syndr. Hum. Retrovirology 3, 417\u2013429 (1990)","journal-title":"J. Acquir. Immune Defic. Syndr. Hum. Retrovirology"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a \n                      \n                        \n                      \n                      $$k$$\n                      \n                        \n                          k\n                        \n                      \n                    -tree. SIAM J. Alg. Disc. Meth. 8, 277\u2013284 (1987)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Sesse, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 226\u2013234. ACM, New York, NY, USA (1993)","DOI":"10.1145\/167088.167161"},{"issue":"4","key":"42_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"42_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theor. Comput. Sci. 109(1\u20132), 49\u201382 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-319-13075-0_23","volume-title":"Algorithms and Computation","author":"PG Drange","year":"2014","unstructured":"Drange, P.G., Dregi, M.S., van\u2019t Hof, P.: On the computational complexity of vertex integrity and component order connectivity. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 285\u2013297. Springer, Heidelberg (2014)"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/31.1748","volume":"3","author":"ES El-Mallah","year":"1988","unstructured":"El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Trans. Circ. Syst. 3, 354\u2013362 (1988)","journal-title":"IEEE Trans. Circ. Syst."},{"key":"42_CR9","unstructured":"Enright, J., Meeks, K.: Deleting edges to restrict the size of an epidemic (2015). \n                      arXiv:1504.05773\n                      \n                     [cs.DS]"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-31155-0_10","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"E Ghosh","year":"2012","unstructured":"Ghosh, E., Kolay, S., Kumar, M., Misra, P., Panolan, F., Rai, A., Ramanujan, M.S.: Faster parameterized algorithms for deletion to split graphs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 107\u2013118. Springer, Heidelberg (2012)"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"PW Goldberg","year":"1993","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2, 139\u2013152 (1993)","journal-title":"J. Comput. Biol."},{"key":"42_CR12","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)"},{"issue":"9","key":"42_CR13","first-page":"895","volume":"12","author":"D Gross","year":"2013","unstructured":"Gross, D., Heinig, M., Iswara, L., Kazmierczak, L.W., Luttrell, K., Saccoman, J.T., Suffel, C.: A survey of component order connectivity models of graph theoretic networks. SWEAS Trans. Math. 12(9), 895\u2013910 (2013)","journal-title":"SWEAS Trans. Math."},{"key":"42_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/978-3-540-77120-3_79","volume-title":"Algorithms and Computation","author":"J Guo","year":"2007","unstructured":"Guo, J.: Problem Kernels for NP-complete edge deletion problems: split and related graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 915\u2013926. Springer, Heidelberg (2007)"},{"issue":"16","key":"42_CR15","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1098\/rsif.2007.1129","volume":"4","author":"RR Kao","year":"2007","unstructured":"Kao, R.R., Green, D.M., Johnson, J., Kiss, I.Z.: Disease dynamics over very different time-scales: foot-and-mouth disease and scrapie on the network of livestock movements in the UK. J. R. Soc. Interface 4(16), 907\u2013916 (2007)","journal-title":"J. R. Soc. Interface"},{"key":"42_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations and Approximations","author":"T Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth: Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)"},{"issue":"2","key":"42_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"42_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-20877-5_30","volume-title":"Theory and Applications of Models of Computation","author":"A Li","year":"2011","unstructured":"Li, A., Tang, L.: The complexity and approximability of minimum contamination problems. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 298\u2013307. Springer, Heidelberg (2011)"},{"issue":"1:3","key":"42_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0166-218X(94)90214-3","volume":"49","author":"F Margot","year":"1994","unstructured":"Margot, F.: Some complexity results about threshold graphs. Discrete Appl. Math. 49(1:3), 299\u2013308 (1994). (Special Volume Viewpoints on Optimization)","journal-title":"Discrete Appl. Math."},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1079\/ASC50020265","volume":"80","author":"A Mitchell","year":"2005","unstructured":"Mitchell, A., Bourn, D., Mawdsley, J., Wint, W., Clifton-Hadley, R., Gilbert, M.: Characteristics of cattle movements in britain: an analysis of records from the cattle tracing system. Anim. Sci. 80, 265\u2013273 (2005)","journal-title":"Anim. Sci."},{"issue":"1","key":"42_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109\u2013128 (2001). (Selected Papers: 12th Workshop on Graph-Theoretic Concepts in Computer Science)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"42_CR22","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. III. Planar Tree-Width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"42_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0166-218X(83)90101-4","volume":"6","author":"T Watanabe","year":"1983","unstructured":"Watanabe, T., Ae, T., Nakamura, A.: On the NP-hardness of edge-deletion and -contraction problems. Discrete Appl. Math. 6(1), 63\u201378 (1983)","journal-title":"Discrete Appl. Math."},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 253\u2013264. ACM, New York, NY, USA (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:04:22Z","timestamp":1559322262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}