On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters
On variations of P4-sparse graphs
Discrete Applied Mathematics
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
The clique operator on graphs with few P4's
Discrete Applied Mathematics
An optimal parallel solution for the path cover problem on P4-sparse graphs
Journal of Parallel and Distributed Computing
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
The clique operator on graphs with few P4's
Discrete Applied Mathematics
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
Maximum-Size subgraphs of p4-sparse graphs admitting a perfect matching
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
A fully dynamic algorithm for the recognition of P4-sparse graphs
Theoretical Computer Science
| Hi-index | 5.23 |