{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T10:04:23Z","timestamp":1726135463231},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030862701"},{"type":"electronic","value":"9783030862718"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86271-8_11","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T19:08:06Z","timestamp":1631646486000},"page":"124-133","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Simple Genetic Algorithm for the Critical Node Detection Problem"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-0659-4594","authenticated-orcid":false,"given":"Mihai-Alexandru","family":"Suciu","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3915-8986","authenticated-orcid":false,"given":"No\u00e9mi","family":"Gask\u00f3","sequence":"additional","affiliation":[]},{"given":"Tam\u00e1s","family":"K\u00e9pes","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5572-8141","authenticated-orcid":false,"given":"Rodica Ioana","family":"Lung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,15]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.engappai.2016.06.010","volume":"55","author":"R Aringhieri","year":"2016","unstructured":"Aringhieri, R., Grosso, A., Hosteins, P., Scatamacchia, R.: A general evolutionary framework for different classes of critical node problems. Eng. Appl. Artif. Intell. 55, 128\u2013145 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Boginski, V., Commander, C.W.: Identifying critical nodes in protein-protein interaction networks. In: Clustering Challenges in Biological Networks, pp. 153\u2013167. World Scientific (2009)","DOI":"10.1142\/9789812771667_0007"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","volume":"12","author":"SP Borgatti","year":"2006","unstructured":"Borgatti, S.P.: Identifying sets of key players in a social network. Comput. Math. Organ. Theory 12(1), 21\u201334 (2006). https:\/\/doi.org\/10.1007\/s10588-006-7084-x","journal-title":"Comput. Math. Organ. Theory"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.trb.2009.07.007","volume":"44","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: Scheduling extra freight trains on railway networks. Transp. Res. Part B: Methodol. 44(2), 215\u2013231 (2010)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Chen, W., Jiang, M., Jiang, C., Zhang, J.: Critical node detection problem for complex network in undirected weighted networks. Phys. A: Stat. Mech. Appl. 538 (2020). https:\/\/doi.org\/10.1016\/j.physa.2019.122862","DOI":"10.1016\/j.physa.2019.122862"},{"issue":"21","key":"11_CR6","doi-asserted-by":"publisher","first-page":"4626","DOI":"10.1103\/PhysRevLett.85.4626","volume":"85","author":"R Cohen","year":"2000","unstructured":"Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S.: Resilience of the internet to random breakdowns. Phys. Rev. Lett. 85(21), 4626 (2000)","journal-title":"Phys. Rev. Lett."},{"issue":"12","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1093\/comjnl\/bxt128","volume":"57","author":"O Dagdeviren","year":"2013","unstructured":"Dagdeviren, O., Akram, V.: An energy-efficient distributed cut vertex detection algorithm for wireless sensor networks. Comput. J. 57(12), 1852\u20131869 (2013). https:\/\/doi.org\/10.1093\/comjnl\/bxt128","journal-title":"Comput. J."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Dagdeviren, O., Akram, V., Tavli, B., Yildiz, H., Atilgan, C.: Distributed detection of critical nodes in wireless sensor networks using connected dominating set (2017). https:\/\/doi.org\/10.1109\/ICSENS.2016.7808815","DOI":"10.1109\/ICSENS.2016.7808815"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s12532-019-00167-1","volume":"12","author":"F Furini","year":"2019","unstructured":"Furini, F., Ljubi\u0107, I., Malaguti, E., Paronuzzi, P.: On integer and bilevel formulations for the k-vertex cut problem. Math. Program. Comput. 12(2), 133\u2013164 (2019). https:\/\/doi.org\/10.1007\/s12532-019-00167-1","journal-title":"Math. Program. Comput."},{"issue":"21","key":"11_CR10","doi-asserted-by":"publisher","first-page":"8685","DOI":"10.1073\/pnas.0701361104","volume":"104","author":"KI Goh","year":"2007","unstructured":"Goh, K.I., Cusick, M.E., Valle, D., Childs, B., Vidal, M., Barab\u00e1si, A.L.: The human disease network. Proc. Natl. Acad. Sci. 104(21), 8685\u20138690 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"e59613","DOI":"10.1371\/journal.pone.0059613","volume":"8","author":"S Iyer","year":"2013","unstructured":"Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PloS One 8(4), e59613 (2013)","journal-title":"PloS One"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.dam.2015.01.043","volume":"210","author":"M Lalou","year":"2016","unstructured":"Lalou, M., Tahraoui, M., Kheddouci, H.: Component-cardinality-constrained critical node problem in graphs. Discrete Appl. Math. 210, 150\u2013163 (2016). https:\/\/doi.org\/10.1016\/j.dam.2015.01.043","journal-title":"Discrete Appl. Math."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cosrev.2018.02.002","volume":"28","author":"M Lalou","year":"2018","unstructured":"Lalou, M., Tahraoui, M., Kheddouci, H.: The critical node detection problem in networks: a survey. Comput. Sci. Rev. 28, 92\u2013117 (2018). https:\/\/doi.org\/10.1016\/j.cosrev.2018.02.002","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"11_CR14","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":"11_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69432-8","volume-title":"Parameter Setting in Evolutionary Algorithms","author":"F Lobo","year":"2007","unstructured":"Lobo, F., Lima, C.F., Michalewicz, Z.: Parameter Setting in Evolutionary Algorithms, vol. 54. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69432-8"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ins.2016.10.014","volume":"377","author":"M Lozano","year":"2017","unstructured":"Lozano, M., Garc\u00eda-Mart\u00ednez, C., Rodriguez, F.J., Trujillo, H.M.: Optimizing network attacks by artificial bee colony. Inf. Sci. 377, 30\u201350 (2017)","journal-title":"Inf. Sci."},{"issue":"5663","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo, R., et al.: Superfamilies of evolved and designed networks. Science 303(5663), 1538\u20131542 (2004)","journal-title":"Science"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Min, S., Jiandong, L., Yan, S.: Critical nodes detection in mobile ad hoc network, vol. 2, pp. 336\u2013340 (2006). https:\/\/doi.org\/10.1109\/AINA.2006.136","DOI":"10.1109\/AINA.2006.136"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Paudel, N., Georgiadis, L., Italiano, G.: Computing critical nodes in directed graphs. ACM J. Exp. Algorithmics 23 (2018). https:\/\/doi.org\/10.1145\/3228332","DOI":"10.1145\/3228332"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1093\/nar\/gkn230","volume":"36","author":"J Reimand","year":"2008","unstructured":"Reimand, J., Tooming, L., Peterson, H., Adler, P., Vilo, J.: GraphWeb: mining heterogeneous biological networks for gene modules with functional significance. Nucleic Acids Res. 36, 452\u2013459 (2008)","journal-title":"Nucleic Acids Res."},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Rezaei, J., Zare-Mirakabad, F., MirHassani, S., Marashi, S.A.: EIA-CNDP: an exact iterative algorithm for critical node detection problem. Comput. Oper. Res. 127 (2021). https:\/\/doi.org\/10.1016\/j.cor.2020.105138","DOI":"10.1016\/j.cor.2020.105138"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: 17. A Value for n-Person Games, pp. 307\u2013317. Princeton University Press (1953). DOIurl10.1515\/9781400881970-018","DOI":"10.1515\/9781400881970-018"},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/net.20464","volume":"60","author":"S Shen","year":"2012","unstructured":"Shen, S., Smith, J.C.: Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. Networks 60(2), 103\u2013119 (2012)","journal-title":"Networks"},{"issue":"3","key":"11_CR24","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.disopt.2012.07.001","volume":"9","author":"S Shen","year":"2012","unstructured":"Shen, S., Smith, J.C., Goli, R.: Exact interdiction models and algorithms for disconnecting networks via node deletions. Discrete Optim. 9(3), 172\u2013188 (2012)","journal-title":"Discrete Optim."},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/j.ejor.2017.08.053","volume":"265","author":"M Ventresca","year":"2018","unstructured":"Ventresca, M., Harrison, K., Ombuki-Berman, B.: The bi-objective critical node detection problem. Eur. J. Oper. Res. 265(3), 895\u2013908 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.08.053","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"11_CR26","doi-asserted-by":"publisher","first-page":"2763","DOI":"10.1016\/j.cor.2012.02.008","volume":"39","author":"M Ventresca","year":"2012","unstructured":"Ventresca, M.: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput. Oper. Res. 39(11), 2763\u20132775 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"11_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10878-014-9730-4","volume":"28","author":"A Veremyev","year":"2014","unstructured":"Veremyev, A., Prokopyev, O.A., Pasiliao, E.L.: An integer programming framework for critical elements detection in graphs. J. Comb. Optim. 28(1), 233\u2013273 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9730-4","journal-title":"J. Comb. Optim."},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Yang, R., Huang, L., Lai, Y.C.: Selectivity-based spreading dynamics on complex networks. Phys. Rev. e 78(2), 026111 (2008)","DOI":"10.1103\/PhysRevE.78.026111"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86271-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:31:00Z","timestamp":1710343860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86271-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030862701","9783030862718"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86271-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Artificial Intelligence Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hais2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.haisconference.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}