The survey is a comprehensive overview of the developing area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …

Active Directory (AD) is the default security management system for Windows domain
networks. An AD environment naturally describes an attack graph where nodes represent …

For problems intractable on graphs of bounded treewidth, two graph parameters treedepth
and vertex cover number have been used to obtain fine-grained algorithmic and complexity …

Active Directory is the default security management system for Windows domain networks.
We study the shortest path edge interdiction problem for defending Active Directory style …

Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central
topic of study in parameterized complexity. A main aim of research in this area is to …

Treewidth is arguably the most important structural graph parameter leading to
algorithmically beneficial graph decompositions. Triggered by a strongly growing interest in …

Vertex Integrity is a graph measure which sits squarely between two more well-studied
notions, namely vertex cover and tree-depth, and that has recently gained attention as a …

We study variants of the classic $ s $-$ t $ cut problem and prove the following improved
hardness results assuming the Unique Games Conjecture (UGC).-For any constant $ k\geq …

We study the NP‐hard shortest path most vital edges problem arising in the context of
analyzing network robustness. For an undirected graph with positive integer edge lengths …

Abstract We study the Length-Bounded Cut problem for special graph classes and from a
parameterized complexity viewpoint. Here, we are given a graph G, two vertices s and t, and …