The recent advance in the microarray data analysis makes it easy to simultaneously
measure the expression levels of several thousand genes. These levels can be used to …

The class of 2K2-free graphs includes several interesting subclasses such as split, pseudo-
split, threshold graphs, complements to chordal, interval or trivially perfect graphs. The …

We study the problem of finding in a graph an inclusionwise maximal independent set of
minimum cardinality, known as minimum maximal independent set or independent …

Interference and collisions greatly limit the throughput of mesh networks that use contention-
based MAC protocols such as IEEE 802.11. Significantly higher throughput is achievable if …

The class of P5-free graphs is the unique minimal class defined by a single connected
forbidden induced subgraph for which the complexity status of the maximum independent …

Graph decompositions such as decomposition by clique separators and modular
decomposition are of crucial importance for designing efficient graph algorithms. Clique …

We examine the problem of exactly or approximately counting all perfect matchings in
hereditary classes of nonbipartite graphs. In particular, we consider the switch Markov chain …

In the present paper we review the method of augmenting graphs, which is a general
approach to solve the maximum independent set problem. Our objective is the employment …

Abstract We consider the Maximum Independent Set (MIS) problem, which is known to be
NP-hard in general, in subclasses of S i, j, k-free graphs, where S i, j, k is the graph …

Finding augmenting chains is in the heart of the maximum matching problem, which is
equivalent to the maximum stable set problem in the class of line graphs. Due to the …