{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:52:18Z","timestamp":1756572738838,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"South Australian Government through the Research Consortium ?Unlocking Complex Resources through Lean Processing?"},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP190103894, FT200100536"],"award-info":[{"award-number":["DP190103894, FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Partially supported by the ?Cyber NGT ? Provable Network Security? grant"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528729","type":"proceedings-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T13:59:57Z","timestamp":1658152797000},"page":"1191-1199","source":"Crossref","is-referenced-by-count":12,"title":["Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation"],"prefix":"10.1145","author":[{"given":"Diksha","family":"Goel","sequence":"first","affiliation":[{"name":"University of Adelaide, Australia"}]},{"given":"Max Hector","family":"Ward-Graham","sequence":"additional","affiliation":[{"name":"Harvard University and University of Adelaide, Australia"}]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Australia"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Australia"}]},{"given":"Hung","family":"Nguyen","sequence":"additional","affiliation":[{"name":"University of Adelaide, Australia"}]},{"given":"Mingyu","family":"Guo","sequence":"additional","affiliation":[{"name":"University of Adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Dynamic programming. Science 153, 3731","author":"Bellman Richard","year":"1966","unstructured":"Richard Bellman . 1966. Dynamic programming. Science 153, 3731 ( 1966 ), 34--37. Richard Bellman. 1966. Dynamic programming. Science 153, 3731 (1966), 34--37."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2704781"},{"volume-title":"A guide to microsoft active directory (ad) design","author":"Dias John","key":"e_1_3_2_1_3_1","unstructured":"John Dias . 2002. A guide to microsoft active directory (ad) design . Technical Report. Lawrence Livermore National Lab.(LLNL), Livermore, CA (United States) . John Dias. 2002. A guide to microsoft active directory (ad) design. Technical Report. Lawrence Livermore National Lab.(LLNL), Livermore, CA (United States)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389844"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459313"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629605"},{"key":"e_1_3_2_1_7_1","volume-title":"Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. arXiv preprint arXiv:2112.13175","author":"Guo Mingyu","year":"2021","unstructured":"Mingyu Guo , Jialiang Li , Aneta Neumann , Frank Neumann , and Hung Nguyen . 2021. Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. arXiv preprint arXiv:2112.13175 ( 2021 ). Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, and Hung Nguyen. 2021. Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. arXiv preprint arXiv:2112.13175 (2021)."},{"key":"e_1_3_2_1_8_1","first-page":"372","article-title":"Finding diverse and similar solutions in constraint programming","volume":"5","author":"Hebrard Emmanuel","year":"2005","unstructured":"Emmanuel Hebrard , Brahim Hnich , Barry O'Sullivan , and Toby Walsh . 2005 . Finding diverse and similar solutions in constraint programming . In AAAI , Vol. 5. 372 -- 377 . Emmanuel Hebrard, Brahim Hnich, Barry O'Sullivan, and Toby Walsh. 2005. Finding diverse and similar solutions in constraint programming. In AAAI, Vol. 5. 372--377.","journal-title":"AAAI"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3208287"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.2995713"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0062186"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830569"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001665"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5531"},{"key":"e_1_3_2_1_16_1","volume-title":"Asian Conference on Machine Learning. PMLR, 726--739","author":"Yang Feidiao","year":"2018","unstructured":"Feidiao Yang , Tiancheng Jin , Tie-Yan Liu , Xiaoming Sun , and Jialin Zhang . 2018 . Boosting dynamic programming with neural networks for solving np-hard problems . In Asian Conference on Machine Learning. PMLR, 726--739 . Feidiao Yang, Tiancheng Jin, Tie-Yan Liu, Xiaoming Sun, and Jialin Zhang. 2018. Boosting dynamic programming with neural networks for solving np-hard problems. In Asian Conference on Machine Learning. PMLR, 726--739."},{"key":"e_1_3_2_1_17_1","first-page":"6","article-title":"Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness","volume":"10","author":"Yin Zhengyu","year":"2010","unstructured":"Zhengyu Yin , Dmytro Korzhyk , Christopher Kiekintveld , Vincent Conitzer , and Milind Tambe . 2010 . Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness .. In AAMAS , Vol. 10. 6 . Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintveld, Vincent Conitzer, and Milind Tambe. 2010. Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness.. In AAMAS, Vol. 10. 6.","journal-title":"AAMAS"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3326851"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Boston Massachusetts","acronym":"GECCO '22"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:29Z","timestamp":1750186829000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":18,"alternative-id":["10.1145\/3512290.3528729","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528729","relation":{},"subject":[],"published":{"date-parts":[[2022,7,8]]}}}