Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …

For more than 40 years, Branch & Reduce exponential-time backtracking algorithms have
been among the most common tools used for finding exact solutions of NP-hard problems …

The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of
attention, particularly with the focus of producing algorithms with stronger theoretical …

Nodes (smartCloud vehicles) of minimum connected dominating set form a virtual backbone
in a wireless vehicular ad hoc network. A minimum connected dominating set is a minimum …

In this paper, we propose computational approaches for the zero forcing problem, the
connected zero forcing problem, and the problem of forcing a graph within a specified …

This paper considers the minimum k-connected d-dominating set problem, which is a fault-
tolerant generalization of the minimum connected dominating set (MCDS) problem. Three …

The k-Leaf Out-Branching problem is to find an out-branching, that is a rooted oriented
spanning tree, with at least k leaves in a given digraph. The problem has recently received …

The {\sc $ k $-Leaf Out-Branching} problem is to find an out-branching (ie a rooted oriented
spanning tree) with at least $ k $ leaves in a given digraph. The problem has recently …

Zero forcing is an iterative graph coloring process whereby a colored vertex with a single
uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero …