On variations of P4-sparse graphs
Discrete Applied Mathematics
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Information Processing Letters
On the b-dominating coloring of graphs
Discrete Applied Mathematics
Efficient parallel recognition of cographs
Discrete Applied Mathematics - Special issue: Max-algebra
Graph Theory, Computational Intelligence and Thought
On the b-dominating coloring of graphs
Discrete Applied Mathematics
Efficient parallel recognition of cographs
Discrete Applied Mathematics
An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Discrete Applied Mathematics
A novel branching strategy for parameterized graph modification problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Cograph editing: complexity and parameterized algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The multiple domination and limited packing problems in graphs
Information Processing Letters
A fully dynamic algorithm for the recognition of P4-sparse graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On the recognition of probe graphs of some self-complementary classes of perfect graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A fully dynamic algorithm for the recognition of P4-sparse graphs
Theoretical Computer Science
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
The packing coloring problem for (q,q-4) graphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Complexity and parameterized algorithms for Cograph Editing
Theoretical Computer Science
Note: The parametric complexity of graph diameter augmentation
Discrete Applied Mathematics
Maximization coloring problems on graphs with few P4
Discrete Applied Mathematics
Dot product dimensions of graphs
Discrete Applied Mathematics
Hi-index | 0.00 |