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
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
Hole and antihole detection in graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
The pair completion algorithm for the homogeneous set sandwich problem
Information Processing Letters
An optimal parallel solution for the path cover problem on P4-sparse graphs
Journal of Parallel and Distributed Computing
On transitive orientations with restricted covering graphs
Information Processing Letters
Perfect Sorting by Reversals Is Not Always Difficult
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
Note: Matching cutsets in graphs of diameter 2
Theoretical Computer Science
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
Probe threshold and probe trivially perfect graphs
Theoretical Computer Science
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
Information Processing Letters
Transitive orientations in bull-reducible Berge graphs
Discrete Applied Mathematics
Single machine scheduling with precedence constraints and positionally dependent processing times
Computers and Operations Research
The possible cardinalities of global secure sets in cographs
Theoretical Computer Science
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
Homogeneity vs. adjacency: generalising some graph decomposition algorithms
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
Drawing graphs using modular decomposition
GD'05 Proceedings of the 13th international conference on Graph Drawing
Computing common intervals of K permutations, with applications to modular decomposition of graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Applying modular decomposition to parameterized bicluster editing
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Reconstruction algorithm for permutation graphs
WALCOM'10 Proceedings of the 4th 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
| Hi-index | 0.01 |