Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
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
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Discrete Applied Mathematics
Maximum-Size subgraphs of p4-sparse graphs admitting a perfect matching
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Maximization coloring problems on graphs with few P4
Discrete Applied Mathematics
Hi-index | 0.04 |