Optimal parallel coloring algorithms for a family of tree-representable graphs
CSC '91 Proceedings of the 19th annual conference on Computer Science
On a Generalization of Bi-Complement Reducible Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
New Graph Classes of Bounded Clique-Width
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On variations of P4-sparse graphs
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
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
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the b-dominating coloring of graphs
Discrete Applied Mathematics
The clique operator on graphs with few P4's
Discrete Applied Mathematics
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms (TALG)
Representation of graphs by OBDDs
Discrete Applied Mathematics
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the b-dominating coloring of graphs
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics
The clique operator on graphs with few P4's
Discrete Applied Mathematics
Discrete Applied Mathematics
On prime inductive classes of graphs
European Journal of 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
Maximum-Size subgraphs of p4-sparse graphs admitting a perfect matching
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
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
Representation of graphs by OBDDs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Two fixed-parameter algorithms for the cocoloring problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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
2K2-partition of some classes of graphs
Discrete Applied Mathematics
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
Fixed-parameter algorithms for the cocoloring problem
Discrete Applied Mathematics
| Hi-index | 0.05 |