Bilevel optimization is a field of mathematical programming in which some variables are
constrained to be the solution of another optimization problem. As a consequence, bilevel …

In networks, not all nodes have the same importance, and some are more important than
others. The issue of finding the most important nodes in networks has been addressed …

One of the fundamental tasks in complex networks is detecting critical nodes whose removal
significantly disrupts network connectivity. Identifying critical nodes can help analyze the …

Fifty years of research in Networks coincides with 50 years of advances in resilience theory
and applications. The purpose of this review is to identify how these two technical …

This study considers a class of critical node detection problems that involves minimization of
a distance‐based connectivity measure of a given unweighted graph via the removal of a …

The-separator problem (-SP) consists of finding the minimum set of vertices whose removal
separates the network into multiple different connected components with fewer than a limited …

This study presents an integer programming framework for minimizing the connectivity and
cohesiveness properties of a given graph by removing nodes and edges subject to a joint …

Critical node detection problems aim to optimally delete a subset of nodes in order to
optimize or restrict a certain metric of network fragmentation. In this paper, we consider two …

Abstract In recent years, Industrial Control Systems (ICS) have become increasingly
exposed to a wide range of cyber-physical attacks, having massive destructive …

Critical node problems (CNPs) involve finding a set of critical nodes from a graph whose
removal results in optimizing a predefined measure over the residual graph. As useful …