Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
On the b-coloring of P4-tidy graphs
Discrete Applied Mathematics
Counting spanning trees in graphs using modular decomposition
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Two fixed-parameter algorithms for the cocoloring problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Journal of Graph Theory
The packing coloring problem for (q,q-4) graphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
2K2-partition of some classes of graphs
Discrete Applied Mathematics
Maximization coloring problems on graphs with few P4
Discrete Applied Mathematics
Fixed-parameter algorithms for the cocoloring problem
Discrete Applied Mathematics
| Hi-index | 0.04 |