We study the problem of finding a path between two vertices in finite directed graphs whose independence number is bounded by some constant k. The independence number of a graph is the largest numberâ€¦ (More)

In this survey we present partial information classes, which have been studied under different names and in different contexts in the literature. They are defined in terms of partial informationâ€¦ (More)

The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regarding the deterministic advice complexity of the P-selective setsâ€”i.e., the amount of Karpâ€“ Liptonâ€¦ (More)

1 I n t r o d u c t i o n Even if a language A C {0, 1}* is not in P , some knowledge about the characteristic function of A may be computable in polynomial time. The idea is to consider n-tuplesâ€¦ (More)

This chapter surveys the use of fixed-parameter algorithms in phylogenetics. A central computational problem in this field is the construction of a likely phylogeny (genealogical tree) for a set ofâ€¦ (More)

We study the reachability problem for finite directed graphs whose independence number is bounded by some constant k. This problem is a generalisation of the reachability problem for tournaments. Weâ€¦ (More)