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 …

We introduce two interdiction problems involving matchings, one dealing with edge
removals and the other dealing with vertex removals. Given is an undirected graph G with …

Classical analysis of two-player quantitative games involves an adversary (modeling the
environment of the system) which is purely antagonistic and asks for strict guarantees while …

Computing shortest paths is a fundamental operation in processing graph data. In many real-
world applications, discovering shortest paths between two vertices empowers us to make …

We study a dynamic network game between an attacker and a user. The user wishes to find
a shortest path between a pair of nodes in a directed network, and the attacker seeks to …

In this paper we introduce a stochastic interdiction problem for median systems in which the
operational state of the system's disrupted elements in the aftermath of the disruption is …

In this invited contribution, we summarize new solution concepts useful for the synthesis of
reactive systems that we have introduced in several recent publications. These solution …

One of the key challenges in securing the US-Mexico border is the smuggling of illicit goods
and humans between Ports-of-Entry (POEs). A confluence of factors advantageous to …

We study the minimum vertex blocker clique problem (VBCP), 1 which is to remove a subset
of vertices of minimum cardinality in a weighted undirected graph, such that the maximum …

This paper addresses the shortest path interdiction problem, in which the leader aims to
maximise the length of the shortest path that the follower can traverse subject to a limited …