3 papers
cs.DS2026
Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
Jialiang Li, Aneta Neumann, Frank Neumann +2
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algor…
cs.AI2025
Adaptive Wizard for Removing Cross-Tier Misconfigurations in Active Directory
Huy Q. Ngo, Mingyu Guo, Hung Nguyen
Security vulnerabilities in Windows Active Directory (AD) systems are typically modeled using an attack graph and hardening AD systems involves an iterative workflow: security team…
cs.CR2024
Optimizing Cyber Response Time on Temporal Active Directory Networks Using Decoys
Huy Q. Ngo, Mingyu Guo, Hung Nguyen
Microsoft Active Directory (AD) is the default security management system for Window domain network. We study the problem of placing decoys in AD network to detect potential attack…