We give a new general approach for designing exact exponential-time algorithms for subset
problems. In a subset problem the input implicitly describes a family of sets over a universe …

The number of minimal dominating sets that a graph on n vertices can have is known to be
at most 1.7159 n. This upper bound might not be tight, since no examples of graphs with …

In a graph G, a subset of vertices is a dissociation set if it induces a subgraph with maximum
degree at most 1. A maximal dissociation set of G is a dissociation set which is not a proper …

Abstract The Parameterized Algorithms and Computational Experiments challenge (PACE)
2022 was devoted to engineer algorithms solving the NP-hard Directed Feedback Vertex …

We consider the minimum-weight feedback vertex set problem in tournaments: given a
tournament with non-negative vertex weights, remove a minimum-weight set of vertices that …

A tournament is a directed graph T such that every pair of vertices are connected by an arc.
A feedback vertex set is a set S of vertices in T such that TS is acyclic. In this article we …

A tournament is a directed graph T such that every pair of vertices is connected by an arc. A
feedback vertex set is a set S of vertices in T such that T− S is acyclic. We consider the …

The class of tournaments is by far the most well-studied class of digraphs with many deep
and important results. Since Moon's pioneering book in 1968 [146], the study of tournaments …

Enumerating objects of specified type is one of the principal tasks in algorithmics. In graph
algorithms one often enumerates vertex subsets satisfying a certain property. We study the …

Given a directed graph G=(V, E), a feedback vertex set is a vertex subset C whose removal
makes the graph G acyclic. The feedback vertex set problem is to find the subset C* whose …