On the stable set problem in special P5-free graphs
Discrete Applied Mathematics
Finding augmenting chains in extensions of claw-free graphs
Information Processing Letters
An augmenting graph approach to the stable set problem in P5-free graphs
Discrete Applied Mathematics
Some results on graphs without long induced paths
Information Processing Letters
On easy and hard hereditary classes of graphs with respect to the independent set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
P5-free augmenting graphs and the maximum stable set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Stable sets in two subclasses of banner-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Some results on maximum stable sets in certain P5-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Augmenting graphs for independent sets
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Construction of a Maximum Stable Set with $k$-Extensions
Combinatorics, Probability and Computing
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
Augmenting chains in graphs without a skew star
Journal of Combinatorial Theory Series B
Note: A note on the computational complexity of graph vertex partition
Discrete Applied Mathematics
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Theoretical Computer Science
Maximum independent sets in subclasses of P5-free graphs
Information Processing Letters
Polynomial-time solvability of the maximum clique problem
ECC'09 Proceedings of the 3rd international conference on European computing conference
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Information Processing Letters
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
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem
Theoretical Computer Science
| Hi-index | 0.89 |