Computing independent sets in graphs with large girth

Finding augmenting chains in extensions of claw-free graphs

Information Processing Letters

Stable sets in two subclasses of banner-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics

Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth

Combinatorics, Probability and Computing

New applications of clique separator decomposition for the Maximum Weight Stable Set problem

Theoretical Computer Science

Maximum independent sets in graphs of low degree

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

NP-hard graph problems and boundary classes of graphs

Theoretical Computer Science

Boundary classes of planar graphs

Combinatorics, Probability and Computing

The Maximum Independent Set Problem in Planar Graphs

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science

A note on the Greedy algorithm for finding independent sets of Ck-free graphs

Information Processing Letters

Stable sets in k-colorable P5-free graphs

Information Processing Letters

Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections

Combinatorics, Probability and Computing

On graphs without a C4 or a diamond

Discrete Applied Mathematics

Parameterized algorithms for the independent set problem in some hereditary graph classes

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms

Boundary properties of graphs for algorithmic graph problems

Theoretical Computer Science

New applications of clique separator decomposition for the maximum weight stable set problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions

Journal of Discrete Algorithms

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number

Journal of Discrete Algorithms

Linear time algorithm for computing a small biclique in graphs without long induced paths

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory

Maximum regular induced subgraphs in 2P3-free graphs

Theoretical Computer Science

Distance-$$d$$ independent set problems for bipartite and chordal graphs

Journal of Combinatorial Optimization