{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:43:57Z","timestamp":1764783837483},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1109\/cdc.2015.7402770","type":"proceedings-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T16:32:44Z","timestamp":1456763564000},"page":"3560-3567","source":"Crossref","is-referenced-by-count":8,"title":["A lower bound on the performance of dynamic curing policies for epidemics on graphs"],"prefix":"10.1109","author":[{"given":"Kimon","family":"Drakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asuman","family":"Ozdaglar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John N.","family":"Tsitsiklis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Markov chains and mixing times","author":"levin","year":"2006","journal-title":"American Mathematical Society"},{"key":"ref11","first-page":"549","article-title":"The search number of a connected graph","author":"parsons","year":"1978","journal-title":"Proceedings of the Ninth Southeastern Conference on Combinatorics Graph Theory and Computing (Florida Atlantic Univ Boca Raton Fla 1978)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6761078"},{"journal-title":"Stochastic Calculus and Financial Applications","year":"2000","author":"steele","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.247901"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129184"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2015.2393291"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7040083"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2011.6076889"},{"key":"ref7","article-title":"When is a network epidemic hard to eliminate?","author":"drakopoulos","year":"2015","journal-title":"Submitted to Operations Research"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20315"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90003-H"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/151261.151263"}],"event":{"name":"2015 54th IEEE Conference on Decision and Control (CDC)","start":{"date-parts":[[2015,12,15]]},"location":"Osaka","end":{"date-parts":[[2015,12,18]]}},"container-title":["2015 54th IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7396016\/7402066\/07402770.pdf?arnumber=7402770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T13:27:04Z","timestamp":1490189224000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7402770\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/cdc.2015.7402770","relation":{},"subject":[],"published":{"date-parts":[[2015,12]]}}}