Multiagent Planning Supported by Plan Diversity Metrics and Landmark Actions. - Jan Tozicka; Jan Jakubuv; Karel Durkota; Antonín Komenda; Michal Pechoucek (ICAART (1), 2014)

Computing Optimal Policies for Attack Graphs with Action Failures and Costs. - Karel Durkota; Viliam Lisý (STAIRS, 2014)

Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs. - Karel Durkota; Viliam Lisý; Christopher Kiekintveld; Branislav Bosanský (AAMAS, 2015)

Approximate Solutions for Attack Graph Games with Imperfect Information. - Karel Durkota; Viliam Lisý; Branislav Bosanský; Christopher Kiekintveld (GameSec, 2015)

Optimal Network Security Hardening Using Attack Graph Games. - Karel Durkota; Viliam Lisý; Branislav Bosanský; Christopher Kiekintveld (IJCAI, 2015)

Extensibility Based Multiagent Planner with Plan Diversity Metrics. - Jan Tozicka; Jan Jakubuv; Karel Durkota; Antonín Komenda (Trans. Comput. Collect. Intell., 2015)

Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games. - Jiri Cermak; Branislav Bosanský; Karel Durkota; Viliam Lisý; Christopher Kiekintveld (AAAI, 2016)

Case Studies of Network Defense with Attack Graph Games. - Karel Durkota; Viliam Lisý; Christopher Kiekintveld; Branislav Bosanský; Michal Pechoucek (IEEE Intell. Syst., 2016)

Optimal Strategies for Detecting Data Exfiltration by Internal and External Attackers. - Karel Durkota; Viliam Lisý; Christopher Kiekintveld; Karel Horák 002; Branislav Bosanský; Tomás Pevný (GameSec, 2017)

Hardening networks against strategic attackers using attack graph games. - Karel Durkota; Viliam Lisý; Branislav Bosanský; Christopher Kiekintveld; Michal Pechoucek (Comput. Secur., 2019)

Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. - Olga Petrova; Karel Durkota; Galina Alperovich; Karel Horák 002; Michal Najman; Branislav Bosanský; Viliam Lisý (AAMAS, 2020)