The overwhelming majority of survivable (fault-tolerant) network design
...
In this article we study the problem of signal recovery for group models...
We study the problem of deleting a minimum cost set of vertices from a g...
The matching preclusion number of a graph is the minimal number of edges...
We describe a fast approximation algorithm for the Δ-separated
sparsity ...