{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:10Z","timestamp":1725465550564},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_20","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T08:57:16Z","timestamp":1368608236000},"page":"234-245","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Network Decontamination with Threshold Immunity"],"prefix":"10.1007","author":[{"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Luccio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Altshuler, Y., Dolev, S., Elovici, Y., Aharony, N.: TTLed random walks for collaborative monitoring. In: Proc. 2nd Int. Work. Network Sci. Comm. Net. (2010)","DOI":"10.1109\/INFCOMW.2010.5466697"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2012.08.004","volume":"219","author":"L. Barri\u00e8re","year":"2012","unstructured":"Barri\u00e8re, L., Flocchini, P., Fomin, F.V., Fraignaud, P., Nisse, N., Santoro, N., Thilikos, D.M.: Connected graph searching. Inf. and Comp.\u00a0219, 1\u201316 (2012)","journal-title":"Inf. and Comp."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraignaud, P., Santoro, N.: Capture of an intruder by mobile agents.Proceedings of the 14th Symposium on Parallel Algorithms and Architectures (SPAA), pp. 200\u2013209 (2002)","DOI":"10.1145\/564870.564906"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"Journal of Algorithms"},{"issue":"1-2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2008.02.004","volume":"399","author":"L. Blin","year":"2008","unstructured":"Blin, L., Fraignaud, P., Nisse, N., Vial, S.: Distributed chasing of network intruders. Theoretical Computer Science\u00a0399(1-2), 12\u201337 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"41","key":"20_CR6","doi-asserted-by":"publisher","first-page":"5700","DOI":"10.1016\/j.tcs.2011.06.017","volume":"412","author":"D. Dereniowski","year":"2011","unstructured":"Dereniowski, D.: Connected searching of weighted trees. Theoretical Computer Science\u00a0412(41), 5700\u20135713 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/net.20240","volume":"52","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Decontamination of hypercubes by mobile agents. Networks\u00a052(3), 167\u2013178 (2008)","journal-title":"Networks"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1142\/S0129054107004838","volume":"18","author":"P. Flocchini","year":"2006","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Decontaminating chordal rings and tori using mobile agents. Int. J. on Found. of Comp. Sci.\u00a018(3), 547\u2013563 (2006)","journal-title":"Int. J. on Found. of Comp. Sci."},{"key":"20_CR9","unstructured":"Flocchini, P., Luccio, F.L., Song, L.X.: Size optimal strategies for capturing an intruder in mesh networks. In: Proceedings of the International Conference on Communications in Computing, pp. 200\u2013206 (2005)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-540-92182-0_31","volume-title":"Algorithms and Computation","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Tree decontamination with temporary immunity. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 330\u2013341. Springer, Heidelberg (2008)"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theoretical Computer Science\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theoretical Computer Science"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Thilikos, D.M., Todineau, I.: Connected graph searching in outerplanar graphs. In: Proc. 7th Int. Conference on Graph Theory, (ICGT) (2005)","DOI":"10.1016\/j.endm.2005.06.032"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00446-009-0089-1","volume":"22","author":"D. Ilcinkas","year":"2009","unstructured":"Ilcinkas, D., Nisse, N., Soguet, D.: The cost of monotonicity in distributed graph searching. Distributed Computing\u00a022(2), 117\u2013127 (2009)","journal-title":"Distributed Computing"},{"issue":"9","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1016\/j.jpdc.2007.04.013","volume":"67","author":"N. Imani","year":"2007","unstructured":"Imani, N., Sarbazi-Azadb, H., Zomaya, A.Y.: Capturing an intruder in product networks. Journal of Parallel and Distributed Computing\u00a067(9), 1018\u20131028 (2007)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TPDS.2008.108","volume":"20","author":"N. Imani","year":"2009","unstructured":"Imani, N., Sarbazi-Azad, H., Zomaya, A.Y., Moinzadeh, P.: Detecting threats in star graphs. IEEE Trans. on Parallel and Distr. Systems\u00a020(4), 474\u2013483 (2009)","journal-title":"IEEE Trans. on Parallel and Distr. Systems"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Luccio, F., Pagli, L.: A general approach to toroidal mesh decontamination with local immunity. In: Proc. 23rd Int. Par. and Distr. Processing Symp. (IPDPS) (2009)","DOI":"10.1109\/IPDPS.2009.5160996"},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0129054107004784","volume":"18","author":"F. Luccio","year":"2007","unstructured":"Luccio, F., Pagli, L., Santoro, N.: Network decontamination in presence of local immunity. Int. J. of Foundation of Computer Science\u00a018(3), 457\u2013474 (2007)","journal-title":"Int. J. of Foundation of Computer Science"},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/s00224-008-9116-z","volume":"44","author":"F.L. Luccio","year":"2009","unstructured":"Luccio, F.L.: Contiguous search problem in Sierpinski graphs. Theory of Computing Systems\u00a044(2), 186\u2013204 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"12","key":"20_CR19","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1016\/j.dam.2008.08.007","volume":"157","author":"N. Nisse","year":"2009","unstructured":"Nisse, N.: Connected graph searching in chordal graphs. Discrete Applied Mathematics\u00a0157(12), 2603\u20132610 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms. John Wiley (2007)","DOI":"10.1002\/0470072644"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/11753728_58","volume-title":"Computer Science \u2013 Theory and Applications","author":"P. Shareghi","year":"2006","unstructured":"Shareghi, P., Imani, N., Sarbazi-Azad, H.: Capturing an intruder in the pyramid. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 580\u2013590. Springer, Heidelberg (2006)"},{"issue":"18","key":"20_CR22","doi-asserted-by":"publisher","first-page":"5770","DOI":"10.1016\/j.disc.2008.05.033","volume":"309","author":"B. Yanga","year":"2009","unstructured":"Yanga, B., Dyerb, D., Alspach, B.: Sweeping graphs with large clique number. Discrete Mathematics\u00a0309(18), 5770\u20135780 (2009)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T22:20:11Z","timestamp":1557699611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}