Discrete Mathematics
On the stable set problem in special P5-free graphs
Discrete Applied Mathematics
On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Independent domination in finitely defined classes of graphs
Theoretical Computer Science
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
An augmenting graph approach to the stable set problem in P5-free graphs
Discrete Applied Mathematics
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
Some results on maximum stable sets in certain P5-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Theoretical Computer Science
Note: On the complexity of 4-coloring graphs without long induced paths
Theoretical Computer Science
Maximum independent sets in subclasses of P5-free graphs
Information Processing Letters
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics
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
Hi-index | 0.05 |