{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:30:38Z","timestamp":1742934638599,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319721491"},{"type":"electronic","value":"9783319721507"}],"license":[{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72150-7_56","type":"book-chapter","created":{"date-parts":[[2017,11,26]],"date-time":"2017-11-26T08:21:29Z","timestamp":1511684489000},"page":"692-703","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Attacking Unexplored Networks - The Probe-and-Attack Problem"],"prefix":"10.1007","author":[{"given":"Bryan H.","family":"Chong","sequence":"first","affiliation":[]},{"given":"Mario","family":"Ventresca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,27]]},"reference":[{"issue":"16","key":"56_CR1","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1016\/j.dam.2013.03.021","volume":"161","author":"B Addis","year":"2013","unstructured":"Addis, B., Di Summa, M., Grosso, A.: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth. Discrete Appl. Math. 161(16), 2349\u20132360 (2013)","journal-title":"Discrete Appl. Math."},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Albanese, M., Battista, E., Jajodia, S., Casola, V.: Manipulating the attacker\u2019s view of a system\u2019s attack surface. In: 2014 IEEE Conference on Communications and Network Security (CNS), pp. 472\u2013480. IEEE (2014)","DOI":"10.1109\/CNS.2014.6997517"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Alderson, D.L., Brown, G.G., Carlyle, W.M., Wood, R.K.: Solving defender-attacker-defender models for infrastructure defense. Tech. rep., Naval Postgraduate School Monterey CA Dept. of Operations Research (2011)","DOI":"10.1287\/ics.2011.0047"},{"issue":"12","key":"56_CR4","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerliova","year":"2006","unstructured":"Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal\u2019ak, M., Ram, L.S.: Network discovery and verification. IEEE J. Sel. Areas Commun. 24(12), 2168\u20132181 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"6","key":"56_CR5","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/inte.1060.0252","volume":"36","author":"G Brown","year":"2006","unstructured":"Brown, G., Carlyle, M., Salmer\u00f3n, J., Wood, K.: Defending critical infrastructure. Interfaces 36(6), 530\u2013544 (2006)","journal-title":"Interfaces"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"Brown, G.G., Carlyle, W.M., Salmeron, J., Wood, K.: Analyzing the vulnerability of critical infrastructure to attack and planning defenses. In: Emerging Theory, Methods, and Applications, pp. 102\u2013123. INFORMS (2005)","DOI":"10.1287\/educ.1053.0018"},{"key":"56_CR7","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.geb.2012.12.007","volume":"79","author":"M Dziubi\u0144ski","year":"2013","unstructured":"Dziubi\u0144ski, M., Goyal, S.: Network design and defence. Games Econ. Behav. 79, 30\u201343 (2013)","journal-title":"Games Econ. Behav."},{"issue":"10","key":"56_CR8","doi-asserted-by":"crossref","first-page":"12187","DOI":"10.3390\/en81012187","volume":"8","author":"J Gao","year":"2015","unstructured":"Gao, J., Liu, X., Li, D., Havlin, S.: Recent progress on the resilience of complex networks. Energies 8(10), 12187\u201312210 (2015)","journal-title":"Energies"},{"issue":"6","key":"56_CR9","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/opre.48.6.894.12392","volume":"48","author":"DS Hochbaum","year":"2000","unstructured":"Hochbaum, D.S., Chen, A.: Performance analysis and best implementations of old and new algorithms for the open-pit mining problem. Oper. Res. 48(6), 894\u2013914 (2000)","journal-title":"Oper. Res."},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PloS One 8(4), e59,613 (2013)","DOI":"10.1371\/journal.pone.0059613"},{"issue":"1","key":"56_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1009813105532","volume":"3","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Pferschy, U.: A new fully polynomial time approximation scheme for the knapsack problem. J. Combinat. Optim. 3(1), 59\u201371 (1999)","journal-title":"J. Combinat. Optim."},{"issue":"1","key":"56_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"LG Khachiyan","year":"1980","unstructured":"Khachiyan, L.G.: Polynomial algorithms in linear programming. USSR Comput. Math. Math. Phys. 20(1), 53\u201372 (1980)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"56_CR13","unstructured":"Lerchs, H., Grossman, I.: Optimum design of open-pit mines. In: Operations Research, vol.\u00a012, p. B59. Inst. Operations Research Management Sciences 901 Elkridge Landing rd, STE 400, Linthicum Hts, MD 21090-2909 (1964)"},{"issue":"3","key":"56_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","volume":"8","author":"M Magazine","year":"1981","unstructured":"Magazine, M., Oguz, O.: A fully polynomial approximation algorithm for the 0\u20131 knapsack problem. Eur. J. Oper. Res. 8(3), 270\u2013273 (1981)","journal-title":"Eur. J. Oper. Res."},{"key":"56_CR15","doi-asserted-by":"crossref","unstructured":"Peixoto, T.P., Bornholdt, S.: Evolution of robust network topologies: emergence of central backbones. Phys. Rev. Lett. 109(11), 118703 (2012)","DOI":"10.1103\/PhysRevLett.109.118703"},{"issue":"2","key":"56_CR16","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1006\/jagm.1997.0917","volume":"27","author":"JG Propp","year":"1998","unstructured":"Propp, J.G., Wilson, D.B.: How to get a perfectly random sample from a generic markov chain and generate a random spanning tree of a directed graph. J. Alg. 27(2), 170\u2013217 (1998)","journal-title":"J. Alg."},{"key":"56_CR17","doi-asserted-by":"crossref","unstructured":"Rowe, N.C., Goh, H.C.: Thwarting cyber-attack reconnaissance with inconsistency and deception. In: Information Assurance and Security Workshop, 2007. IAW\u201907. IEEE SMC, pp. 151\u2013158. IEEE (2007)","DOI":"10.1109\/IAW.2007.381927"},{"issue":"6","key":"56_CR18","doi-asserted-by":"crossref","first-page":"1905","DOI":"10.1016\/j.cor.2006.09.019","volume":"35","author":"MP Scaparra","year":"2008","unstructured":"Scaparra, M.P., Church, R.L.: A bilevel mixed-integer program for critical infrastructure protection planning. Comput. Oper. Res. 35(6), 1905\u20131923 (2008)","journal-title":"Comput. Oper. Res."},{"key":"56_CR19","doi-asserted-by":"crossref","unstructured":"Ventresca, M., Aleman, D.: A fast greedy algorithm for the critical node detection problem. In: International Conference on Combinatorial Optimization and Applications, pp. 603\u2013612. Springer (2014)","DOI":"10.1007\/978-3-319-12691-3_45"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72150-7_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T17:01:06Z","timestamp":1570381266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72150-7_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"ISBN":["9783319721491","9783319721507"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72150-7_56","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2017,11,27]]}}}