In the Maximum Independent Set problem we are asked to find a set of pairwise
nonadjacent vertices in a given graph with the maximum possible cardinality. In general …

We propose an algorithm for solving the maximum weighted stable set problem on claw-free
graphs that runs in O (| V|(| E|+| V| log| V|))-time, drastically improving the previous best …

We propose an algorithm for solving the maximum weighted stable set problem on claw-free
graphs that runs in O (n 3)-time, drastically improving the previous best known complexity …

This thesis concerns the relationship between four graph invariants: ω, χf, χ, and∆. These are
the clique number, the fractional chromatic number, the chromatic number, and the …

An efficient dominating set (or perfect code) in a graph is a set of vertices the closed
neighborhoods of which partition the vertex set of the graph. The minimum weight efficient …

The subject of this work is the study of LS+-perfect graphs defined as those graphs G for
which the stable set polytope STAB (G) is achieved in one iteration of Lovász–Schrijver PSD …

An apple A k is the graph obtained from a chordless cycle C k of length k≥ 4 by adding a
vertex that has exactly one neighbor on the cycle. The class of apple-free graphs is a …

An efficient dominating set (or perfect code) in a graph is a set of vertices the closed
neighborhoods of which partition the graph's vertex set. We introduce graphs that are …

In this paper we show how to solve the Maximum Weight Stable Set Problem in a claw-free
graph G (V, E) with α (G) ≤ 3 α (G)≤ 3 in time O (| E|\log| V|) O (| E| log| V|). More precisely …

We algorithmize the recent structural characterization for claw-free graphs by Chudnovsky
and Seymour. Building on this result, we show that Dominating Set on claw-free graphs is (i) …