We present an output sensitive algorithm for computing a maximum independent set of an unweighted circle graph. Our algorithm requires O(n min{d, α}) time at worst, for an n vertex circle graph where α is the independence ...