{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T21:09:03Z","timestamp":1783976943192,"version":"3.55.0"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Yunnan Fundamental Research Projects","award":["202501AS070076"],"award-info":[{"award-number":["202501AS070076"]}]},{"name":"Yunnan Fundamental Research Projects","award":["202501AS070170"],"award-info":[{"award-number":["202501AS070170"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1109\/tdsc.2026.3692750","type":"journal-article","created":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T19:53:12Z","timestamp":1778701992000},"page":"9426-9439","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing the Weight Stable Set Attack With Budget Constraint"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0306-8268","authenticated-orcid":false,"given":"Ruiqing","family":"Sun","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Yunnan University, Kunming, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Yunnan University, Kunming, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Network model for disaster management","author":"Arulselvan","year":"2009"},{"key":"ref2","volume-title":"Network Science","author":"Barabasi","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1150"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.06.023"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.10.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-006-7084-x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0798"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9071-7"},{"issue":"1\/2","key":"ref12","first-page":"15","article-title":"Heuristics for the 0-1 min-knapsack problem","volume":"10","author":"Csirik","year":"1991","journal-title":"Acta Cybernetica"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-99948-z"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462098"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2011.6127492"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_14"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17458-2_15"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1026"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2025.3591543"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_18"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"issue":"2","key":"ref23","first-page":"117","volume-title":"Proc. VLDB Endowment","volume":"18","author":"Huang"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6681"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-022-01629-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9025-6"},{"key":"ref28","volume-title":"The Computational Complexity of Machine Learning","author":"Kearns","year":"1990"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9317-0"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.5210\/fm.v7i4.941"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.47"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"ref33","first-page":"32:1","article-title":"Improved algorithms for MST and metric-TSP interdiction","volume-title":"Proc. 44th Int. Colloq. Automata Lang. Program.","author":"Linhares"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.156"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.036104"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/EISIC.2011.57"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0005-0"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0066-0"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-019-00513-y"},{"key":"ref41","volume-title":"Combinatorial Optimization - Polyhedra and Effciency","author":"Schrijver","year":"2005"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2019.2948623"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-019-00804-y"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00182-8"},{"key":"ref45","volume-title":"The Theory of the Market Economy","author":"Stackelberg","year":"1952"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00059-6"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1002\/net.21622"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.2974220"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90236-R"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.06.006"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.49"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3056450"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8858\/11603880\/11517215.pdf?arnumber=11517215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T20:08:56Z","timestamp":1783973336000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11517215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":53,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2026.3692750","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7]]}}}