1 citations · 1 across the 4 of their papers we have counts for
4 papers
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs
Mingyu Guo, Max Ward, Aneta Neumann +2
Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/a…
Finding -Hypernetworks in F-Hypergraphs is NP-Hard
Reynaldo Gil-Pons, Max Ward, Loïc Miller
We consider the problem of computing an -hypernetwork in an acyclic F-hypergraph. This is a fundamental computational problem arising in directed hypergraphs, and is a found…
A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs
Darcy Best, Max Ward
We provide an algorithm requiring only time to compute the maximum weight independent set of interval filament graphs. This also implies an algorithm to compute t…
Efficient Network Analysis Under Single Link Deletion
Max Ward, Amitava Datta, Hung X. Nguyen +1
The problem of worst case edge deletion from a network is considered. Suppose that you have a communication network and you can delete a single edge. Which edge deletion causes the…