On maximum independent sets in image-free graphs

The complexity status of the Maximum Independent Set Problem (MIS) for the family of image-free graphs is unknown. Although for many subclasses of image-free graphs MIS can be solved in polynomial time, only exponential time MIS-algorithms for general graphs are known so far. In this note we present the first algorithm to solve MIS for image-free graphs in subexponential time.